• Constructing Roads


    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 <iostream>
    #include <cmath>
    #include <string>
    #include <cstring>
    #include <algorithm>
    #include <queue>
    using namespace std;
    
    #define ll long long
    const int inf = 0x3f3f3f3f;
    const int maxn = 1e8;
    int n, sum, sign[108];
    
    struct point
    {
      int u, v, len;
    }root[10008];
    void init()
    {
        for(int i = 0; i<108; i++)
            sign[i] = i;
    }
    int get(int x)
    {
        if(x != sign[x])
        {
            sign[x] = get(sign[x]);
            return sign[x];
        }
        else return x;
    }
    int bcj(int x, int y)
    {
        int a = get(x), b = get(y);
        if(a == b)return 0;
        else return 1;
    }
    bool cmp(point a, point b)
    {
        return a.len<b.len;
    }
    int main()
    {
        init();
        sum = 0;
        scanf("%d", &n);
        int j = 0;
        for(int i = 1; i <= n; i++)
        {
            for(int miao = 1; miao <= n; miao++,j++)
            {
                root[j].u = i;
                root[j].v = miao;
                scanf("%d", &root[j].len);
    //            printf("%d %d %d  j = %d
    ", root[j].u, root[j].v, root[j].len, j);
            }
        }
        int q, a, b, cnt = 0;
        scanf("%d", &q);
        for(int i = 0; i<q; i++)
        {
            scanf("%d%d", &a, &b);
            sign[get(a)] = get(b);//使a点与b点合并
        }
        sort(root, root+j, cmp);
        for(int i = 0; i<j; i++)//遍历j条边
        {
            if(bcj(root[i].u, root[i].v))
            {
                cnt++;
                sum += root[i].len;
                sign[get(root[i].u)] = get(root[i].v);//将点标记为相连的状态,避免路径加重(chong)
            }
            if(cnt == n-1)break;
        }
        printf("%d
    ", sum);
        return 0;
    }
  • 相关阅读:
    logstash 字段引用
    Filter Conditions 过滤条件
    Not found org.springframework.http.converter.json.MappingJacksonHttpMessageConve
    rsyslog Properties
    rsyslog 模板
    rsyslog 基本结构
    awk RS ORS
    elasticsearch分布式特点
    spring事物配置,声明式事务管理和基于@Transactional注解的使用
    myBatis:事务管理
  • 原文地址:https://www.cnblogs.com/RootVount/p/10519910.html
Copyright © 2020-2023  润新知