Constructing Roads--hdu1102

Constructing Roads

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

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

 

 

 

 

 

看了好久才看懂，前三行的意思是，第1,2,3个村子分别距离第1,2,3个村子的距离，

 

 

最小生成树来写！

 

 

 

 

 

 

 

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int per[110],map[101][101];
struct node
{
    int b,e,w;
}s[10000];
bool cmp(node x,node y)
{
    return x.w<y.w;
}
void init()
{
    for(int i=1;i<110;i++)
    per[i]=i;
 } 
 
 int find(int x)
 {
     while(x!=per[x])
     x=per[x];
     return x;
 }
 
 bool join (int x,int y)
 {
     int fx=find(x);
     int fy=find(y);
     if(fx!=fy)
     {
         per[fx]=fy;
         return true;
     }
     return false;
 }
 int main()
 {
     int n,i,n1,a,b,j;
     while(scanf("%d",&n)!=EOF)
     {
         init();
         for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                 scanf("%d",&map[i][j]);
         scanf("%d",&n1);     
        for(i=0;i<n1;i++)
        {
            scanf("%d%d",&a,&b);
            map[a][b]=0;
        }
             int k=0;
             for(i=1;i<=n;i++)
             {
                 for(j=i;j<=n;j++)
                 {
                     s[k].b=i;
                     s[k].e=j;
                     s[k].w=map[i][j];
                     k++;
                 }
             }
        sort(s,s+k,cmp);
        int sum=0;
        for(i=0;i<k;i++)
        {
            if(join(s[i].b,s[i].e))
            sum+=s[i].w;
        }
        printf("%d
",sum);
      }     
     return 0;
 }