HDU1233还是畅通工程
思路:
模板题。可是我竟然把&&打错成&,wa了n次!!!
#代码:
#include<bits/stdc++.h>
#define pii pair<int,int>
#define ll long long
#define cl(x) memset(x,0,sizeof(x))
const int N=1e6+10;
const int mod=1e7+9;
const int maxn=0x3f3f3f3f;
const int minn=0xc0c0c0c0;
const int inf=99999999;
using namespace std;
struct edge
{
int u,v,w;
}a[N];
int fa[110],len;
int cmp(edge x,edge y)
{
return x.w<y.w;
}
int find(int x)
{
if(fa[x]!=x)
fa[x]=find(fa[x]);
return fa[x];
}
int judge(int x,int y)
{
int t1=find(x),t2=find(y);
if(t1!=t2)
{
fa[t1]=t2;
return 1;
}
return 0;
}
int main()
{
int n;
while(~scanf("%d",&n) && n)
{
int i;
for(i=1;i<=n;i++)
fa[i]=i;
for(i=1;i<=n*(n-1)/2;i++)
scanf("%d%d%d",&a[i].u,&a[i].v,&a[i].w);
sort(a+1,a+n*(n-1)/2+1,cmp);
int count=0;
ll ans=0;
for(i=1;i<=n*(n-1)/2;i++)
{
if(judge(a[i].u,a[i].v))
{
count++;
ans+=a[i].w;
}
if(count==n-1)
break;
}
printf("%lld\n",ans);
}
return 0;
}