POJ 2377（求花费最大施工方案）并查集

19 篇文章 0 订阅
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

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".

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.

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 8
1 2 3
1 3 7
2 3 10
2 4 4
2 5 8
3 4 6
3 5 2
4 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.
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
struct none
{
int a,b,c;
}no[200000];
bool cmp(none x,none y)
{
return x.c>y.c;
}
int k[200000],n,m,x,y,z,i,j;
int find(int x)
{
while(k[x]!=x)
x=k[x];
return x;
}
void mange(int x,int y)
{
int fx=find(x);
int fy=find(y);
if(fx!=fy)
{
k[fy]=fx;
}
}
int main()
{
scanf("%d%d",&n,&m);
for( i=0;i<=n;i++)
{
k[i]=i;
}
for( i=0;i<m;i++)
{scanf("%d%d%d",&no[i].a,&no[i].b,&no[i].c);
}
sort(no,no+m,cmp);
int sum=0,l=0;
for(i=0;i<m;i++)
{
if(find(no[i].a)!=find(no[i].b))
{sum=sum+no[i].c;
mange(no[i].a,no[i].b);}

}
for(i=1;i<=n;i++)
{
if(k[i]==i)
l++;
}
if(l==1)
printf("%d\n",sum);
else
printf("-1\n");
}

• 1
点赞
• 0
收藏
觉得还不错? 一键收藏
• 0
评论
04-25
02-22 1485
06-12 623
09-15 523
03-18
06-01
08-29 1865
08-04 242
08-05 397
08-03 481
07-21 990
08-03 1699

“相关推荐”对你有帮助么？

• 非常没帮助
• 没帮助
• 一般
• 有帮助
• 非常有帮助

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。