Input
Output
Sample Input
9
A 2 B 12 I 25
B 3 C 10 H 40 I 8
C 2 D 18 G 55
D 1 E 44
E 2 F 60 G 38
F 0
G 1 H 35
H 1 I 35
3
A 2 B 10 C 40
B 1 C 20
0
Sample Output
216
30
思路
模板题,Kruskal算法求最小生成树
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
//Kruskal
using namespace std;
typedef long long ll;
const int N = 1e3+10;
struct node
{
int x,y;
int z;
} e[N];
bool cmp(node a,node b)
{
return a.z<b.z;
}
int pre[N];
int findd(int x)//找父节点
{
if(x!=pre[x])
{
int t=findd(pre[x]);
pre[x]=t;
}
return pre[x];
}
void unity(int x,int y)
{
int fx = findd(x), fy = findd(y);
if (fx != fy)
{
pre[fy] = fx;
}
}
int judge(int x,int y)//判断x,y是否连通(父节点相同)
{
int fx=findd(x),fy=findd(y);
if(fx!=fy)return 1;
return 0;
}
int n,m;
int main()
{
ll ans;
char c1,c2 ;
while(~scanf("%d",&n)&&n)
{
ans=0;
int m,w,k=1;
for(int i=1; i<n; i++)
{
cin>>c1;
scanf("%d",&m);
while(m--)
{
cin>>c2;
scanf("%d",&w);
e[k].x=c1-'A';
e[k].y=c2-'A';
e[k].z=w;
k++;
}
}
k--;
sort(e+1,e+1+k,cmp);
for(int i=0; i<=n; i++)pre[i]=i;
for(int i=1; i<=k; i++)
{
int fx=findd(e[i].x);
int fy=findd(e[i].y);
if(fx==fy)continue;
pre[fy]=fx;
ans+=e[i].z;
}
printf("%lld\n",ans);
}
return 0;
}