Bad Cowtractors
来源:互联网 发布:ipad4下载软件 编辑:程序博客网 时间:2024/05/17 15:40
最大生成树~
Bessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already done some surveying, and found M (1 <= M <= 20,000) possible connection routes between pairs of barns. Each possible connection route has an associated cost C (1 <= C <= 100,000). Farmer John wants to spend the least amount on connecting the network; he doesn't even want to pay Bessie.
Realizing Farmer John will not pay her, Bessie decides to do the worst job possible. She must decide on a set of connections to install so that (i) the total cost of these connections is as large as possible, (ii) all the barns are connected together (so that it is possible to reach any barn from any other barn via a path of installed connections), and (iii) so that there are no cycles among the connections (which Farmer John would easily be able to detect). Conditions (ii) and (iii) ensure that the final set of connections will look like a "tree".
Realizing Farmer John will not pay her, Bessie decides to do the worst job possible. She must decide on a set of connections to install so that (i) the total cost of these connections is as large as possible, (ii) all the barns are connected together (so that it is possible to reach any barn from any other barn via a path of installed connections), and (iii) so that there are no cycles among the connections (which Farmer John would easily be able to detect). Conditions (ii) and (iii) ensure that the final set of connections will look like a "tree".
* Line 1: Two space-separated integers: N and M
* Lines 2..M+1: Each line contains three space-separated integers A, B, and C that describe a connection route between barns A and B of cost C.
* Lines 2..M+1: Each line contains three space-separated integers A, B, and C that describe a connection route between barns A and B of cost C.
* Line 1: A single integer, containing the price of the most expensive tree connecting all the barns. If it is not possible to connect all the barns, output -1.
5 81 2 31 3 72 3 102 4 42 5 83 4 63 5 24 5 17
42
OUTPUT DETAILS:
The most expensive tree has cost 17 + 8 + 10 + 7 = 42. It uses the following connections: 4 to 5, 2 to 5, 2 to 3, and 1 to 3.
The most expensive tree has cost 17 + 8 + 10 + 7 = 42. It uses the following connections: 4 to 5, 2 to 5, 2 to 3, and 1 to 3.
#include<stdio.h>#include<algorithm>#define maxe 20005#define maxv 1005using namespace std;struct list{int a;int b;int cost;}edge[maxe];int pre[maxv];int find(int a){int r=a;while(r!=pre[r])r=pre[r];while(a!=pre[a]){int z=a;a=pre[a];pre[z]=r;}return r;}bool cmp(struct list e,struct list f){return e.cost>f.cost;}void kruskal(int n,int m){long long ans=0;int num_edge=0;for(int i=0;i<=n;i++)pre[i]=i;sort(edge,edge+m,cmp);for(int i=0;i<m;i++){int fa,fb;fa=find(edge[i].a);fb=find(edge[i].b);if(fa!=fb){pre[fa]=fb;ans+=edge[i].cost;num_edge++;if(num_edge==n-1)break;}}if(num_edge!=n-1)printf("-1");elseprintf("%lld",ans);}int main(){int n,m;scanf("%d%d",&n,&m);for(int i=0;i<m;i++){scanf("%d%d%d",&edge[i].a,&edge[i].b,&edge[i].cost);}kruskal(n,m);return 0;}
阅读全文
0 0
- Bad Cowtractors
- Bad Cowtractors
- Bad Cowtractors
- Bad Cowtractors
- Bad Cowtractors
- Bad Cowtractors
- PKU 2377 Bad Cowtractors
- EOJ 5 Bad Cowtractors
- poj 2377 Bad Cowtractors
- poj 2377 Bad Cowtractors
- poj 2377 Bad Cowtractors
- poj2377 - Bad Cowtractors
- POJ_2377 Bad Cowtractors
- POJ 2377 Bad Cowtractors
- POJ 2377 Bad Cowtractors
- POJ-2377-Bad Cowtractors
- POJ 2377 Bad Cowtractors
- poj 2377 Bad Cowtractors
- 对jquery里面的on()方法的理解
- Log4j使用笔记
- CodeForces
- 软件开发的基本步骤
- Maven,jdk,Eclipse,Tomcat,Spring环境的搭建和使用
- Bad Cowtractors
- 触电(by quqi99)
- C++模板(一)
- 手把手教你用Mysql-Cluster-7.5搭建数据库集群
- Python whl包、tar包、tar.gz包的区别
- Shell实现俄罗斯方块小游戏
- 玲珑杯1114(组合数)
- 杭电acm 3132GCC(简单数论)
- 三条命令解决Git 如何删除远程服务器文件同时保留本地文件