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.
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.
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.
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.
3 0 990 692 990 0 179 692 179 0 1 1 2
179
思路:注意多组数据,看清格式,题目不难的;
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int pre[10010];
struct node
{
int a;
int b;
int c;
}s[10010];
bool cmp(node x,node y)
{
return x.c<y.c;
}
int find(int x)//并查集;
{
if(pre[x]==-1)
return x;
return pre[x]=find(pre[x]);
}
int main()
{
int t,n,i,j,a,b,c;
while(scanf("%d",&t)!=EOF)
{
int p=0;
for(i=1;i<=t;i++)
{
for(j=1;j<=t;j++)
{
scanf("%d",&c);
if(c!=0)
{ //构造结构体;
s[p].a=i,s[p].b=j,s[p].c=c;
p++;
}
}
}
sort(s,s+p,cmp);
memset(pre,-1,sizeof(pre));
int ans=0,num=0;
scanf("%d",&n);
while(n--)
{
scanf("%d %d",&a,&b);
if(find(a)!=find(b))//坑点:有可能在之前已连接了;
{
pre[find(b)]=find(a);
num++;
}
}
for(i=0;i<p && num<t-1;i++)//由于前面的有部分连接了,num<t-1一定要加上;
{
int fx=find(s[i].a);
int fy=find(s[i].b);
if(fx!=fy)
{
pre[fy]=fx;
ans+=s[i].c;
}
}
printf("%d\n",ans);
}
return 0;
}