最小生成树

link:点击打开链接

Constructing Roads

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

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

kicc

 

Recommend

Eddy   |   We have carefully selected several similar problems for you:   1233  1301  1875  1879  1863 

 

#include<iostream>
#include<algorithm>
#define N 110
using namespace std;


struct node{int u,v,w;}edge[N*N];
int parent[N];


bool cmp(node a,node b)
{
    if(a.w<=b.w) return true;
    return false;
}


int find(int a)
{
    if(a!=parent[a])
        return find(parent[a]);
    else return a;
}


int kruskal(int n,int m)
{
    sort(edge,edge+m,cmp);
    int i,x,y,ans=0;
    for(i=0;i<m;i++)
    {
        x=edge[i].u;
        y=edge[i].v;
        x=find(x);
        y=find(y);
        if(x!=y)
        {
            ans+=edge[i].w;
            parent[y]=x;
        }
    }
    return ans;
}


int main()
{
    int n,q,k,i,j,m;
    while(cin>>n)
    {
        m=0;
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {    
                cin>>k;
                if(i>=j) continue;
                edge[m].u=i;
                edge[m].v=j;
                edge[m].w=k;
                m++;
            }
        }
        for(k=1;k<=n;k++) parent[k]=k;
        cin>>q;
        for(k=1;k<=q;k++)
        {
            cin>>i>>j;
            i=find(i);//WA几次原来是这里的原因，要注意！！
            j=find(j);
            parent[j]=i;
        }
        cout<<kruskal(n,m)<<endl;
    }
    return 0;
}