poj2377Bad Cowtractors
来源:互联网 发布:mac地址修改器win8.1 编辑:程序博客网 时间:2024/06/14 20:36
Bad Cowtractors
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13474 Accepted: 5570
Description
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".
Input
* 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.
Output
* 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.
Sample Input
5 81 2 31 3 72 3 102 4 42 5 83 4 63 5 24 5 17
Sample Output
42
Hint
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>#include<string.h>using namespace std;struct node{int a,b,c;}num[20010];bool cmp(node x,node y){return x.c>y.c;}int pre[1010];void init(){for(int i=1;i<1010;i++){pre[i]=i;}}int find(int p){while(p!=pre[p])p=pre[p];return p;}int merge(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy){pre[fx]=fy;return 1;}return 0;}int main(){int n,m,i,j,t;long long ans;while(~scanf("%d%d",&n,&m)){init();for(i=0;i<m;i++){scanf("%d%d%d",&num[i].a,&num[i].b,&num[i].c);if(num[i].a>num[i].b){t=num[i].a;num[i].a=num[i].b;num[i].b=t;}}sort(num,num+m,cmp);ans=0;for(i=0;i<m;i++){if(merge(num[i].a,num[i].b)){ans+=num[i].c;}}int sum=0;for(i=1;i<=n;i++)if(pre[i]==i)sum++;if(sum==1)printf("%lld\n",ans);elseprintf("-1\n");}return 0;}
Source
0 0
- poj2377Bad Cowtractors
- poj2377Bad Cowtractors
- POJ2377Bad Cowtractors(最大生成树)
- 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
- eclipse 中的快捷键
- 防止出现403
- HDU 5758 Explorer Bo
- BZOJ2049 洞穴勘测 LCT
- 经典排序算法----堆与堆排序(不稳定)
- poj2377Bad Cowtractors
- 【Linux全面学习】12.修改系统启动级别
- C/C++中对象和变量的区别!!!
- KMP
- 在linux(centos)使用openssl生成https证书并配置到nginx的实现过程
- LoginFilter器
- light oj 1078 - Integer Divisibility
- vmwore unbuntu14.04 忘记开机密码
- C# 中字符串“1.0”和数据库中char(10)类型的字段值“1.0”比较。