###### yuyanggo的专栏

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18127    Accepted Submission(s): 6907

Problem Description
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected.

We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.

Input
The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j.

Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.

Output
You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum.

Sample Input
3 0 990 692 990 0 179 692 179 0 1 1 2

Sample Output
179

Source

Recommend
Eddy   |   We have carefully selected several similar problems for you:  1233 1301 1162 1232 1875

#include<cstdio>
#include<algorithm>
using namespace std;

const int maxn=1e2;
int f[maxn*maxn+10];
struct edge{
int u,v,w;
}e[maxn*maxn+10];

bool cmp_e(edge a,edge b)
{
return a.w<b.w;
}

int find(int x)
{
if(f[x]==x)return x;
return f[x]=find(f[x]);
}

int main()
{
//freopen("1.in","r",stdin);

int n,i,j,k,s,x,y,ans;
while(scanf("%d",&n)==1)
{
for(s=0,i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
scanf("%d",&k);
if(i<j)e[++s].u=i,e[s].v=j,e[s].w=k;
}
for(i=1;i<=n;i++)f[i]=i;
sort(e+1,e+s+1,cmp_e);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d",&x,&y);
f[find(x)]=find(y);
}
for(ans=0,i=1;i<=s;i++)
{
x=find(e[i].u),y=find(e[i].v);
if(x!=y)f[x]=y,ans+=e[i].w;
}
printf("%d\n",ans);
}
return 0;
}

#### 杭电 1301 Jungle Roads 【最小生成树&&Kruskal】

2015-08-12 19:57:15

2014-08-12 19:44:19

2016-05-21 19:43:15

2013-08-10 11:55:10

2016-08-04 20:17:04

2012-04-05 17:49:50

#### HDU1102(最小生成树Kruskal算法)

2016-06-01 19:29:38

2018-01-26 18:43:50

2016-06-04 17:54:27

2013-01-29 17:03:48