zoukankan      html  css  js  c++  java
  • POJ 2421--Constructing Roads【水题 && 最小生成树 && kruskal】

    Constructing Roads
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 20889   Accepted: 8817

    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

    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <queue>
    #include <cmath>
    using namespace std;
    
    int per[110];
    int map[110][110];
    int N, Q;
    struct node{
        int u, v, w;
    };
    node edge[20000];
    
    int cmp(node a, node b){
        return a.w < b.w;
    }
    
    void init(){
        for(int i = 1; i <= N; ++i)
            per[i] = i;
    }
    
    int find(int x){
        if(x == per[x])
            return x;
        return per[x] = find(per[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 (){
        while(scanf("%d", &N) != EOF){
            int k = 0;
            for(int i = 1; i <= N; ++i)
            for(int j = 1; j <= N; ++j)
                scanf("%d", &map[i][j]);
            scanf("%d", &Q);
            while(Q--){
                int u, v;
                scanf("%d%d", &u, &v);
                map[u][v] = 0;
            }
            for(int i = 1; i <= N; ++i)
            for(int j = 1; j <= N; ++j){
                edge[k].u = i;
                edge[k].v = j;
                edge[k].w = map[i][j];
                k++;
            }
            sort(edge, edge + k, cmp);
            int sum = 0;
            init();
            for(int i = 0; i < k; ++i){
                //printf("---%d %d %d
    ", edge[i].u, edge[i].v, edge[i].w);
                if(join(edge[i].u, edge[i].v))
                    sum += edge[i].w;
            }
            printf("%d
    ", sum);
        }
        return 0;
    }
    


  • 相关阅读:
    Linux下安装jdk
    hadoop下载
    Java:xxx is not an enclosing class
    Android:Gradle报错——No resource found that matches the given name (at 'dialogCornerRadius' with value '?android:attr/dialogCornerRadius')
    TensorFlow:在PyCharm中配置TensorFlow
    Android:屏幕旋转
    Android:onActivityResult详解
    Android:Bundle类
    Android:ConstraintLayout完全解析
    Android:Android Studio生成签名文件,自动签名,以及获取SHA1和MD5值
  • 原文地址:https://www.cnblogs.com/slgkaifa/p/6936509.html
Copyright © 2011-2022 走看看