hdu1102 kruscal最小生成树

Constructing Roads

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

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

30 990 692990 0 179692 179 011 2

 

 

Sample Output

179

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxx=50010;
const int maxn=105;
int ans;
int pa[maxx],rank1[maxx];
struct edge{
    int u,v,cost;
}e[maxx];
bool cmp(const edge& e1,const edge& e2){
    return e1.cost<e2.cost;
}
int findset(int x){
    if(x!=pa[x])
        pa[x]=findset(pa[x]);
    return pa[x];
}
void unionset(int x,int y,int w){
    x=findset(x);
    y=findset(y);
    if(x==y)
    return ;
    ans+=w;
    if(rank1[x]>rank1[y]){
        pa[y]=x;
    }
    else{
        pa[x]=y;
        if(rank1[x]==rank1[y])
            rank1[y]++;
    }
}
int main(){
    int n,t,x,y;
    int k;
    int dis[maxn][maxn];
    while(~scanf("%d",&n)){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                scanf("%d",&dis[i][j]);
            }
        }
        scanf("%d",&t);
        for(int i=0;i<t;i++){
            scanf("%d%d",&x,&y);
            dis[x][y]=0;
        }
        k=0;
        ans=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                e[k].cost=dis[i][j];
                e[k].u=i;
                e[k].v=j;
                k++;
            }
        }
        sort(e,e+k,cmp);
        for(int i=1;i<=n;i++){
            pa[i]=i;
    rank1[i]=0;
        }
        for(int i=0;i<k;i++){
            x=findset(e[i].u);
            y=findset(e[i].v);
            if(x!=y)
            unionset(x,y,e[i].cost);
        }
        printf("%d\n",ans);
    }
}