zoukankan      html  css  js  c++  java
  • POJ

    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<iostream>
    #include<algorithm>
    using namespace std;
    int ans=0,tot=0;int f[200],a[200][200];
    const int N = 1e5;
    struct ac{
        int v,u,w;
    }edge[N];
    bool cmp(ac a,ac b){
        return a.w<b.w;
    }
    inline int find(int x){
        if(x!=f[x])f[x]=find(f[x]);return f[x];
    }
    inline int join(int x,int y,int w){
        int fx=find(x),fy=find(y);
        if(fx!=fy){
            f[fx]=fy;ans+=w;tot++;
        }
    }
    int main()
    {    
        int n;int m,w,cnt=0,u,v;
        cin>>n;
        for(int i = 1;i <= n;++i)f[i]=i;
        for(int i = 1;i <= n;++i){
            for(int j = 1;j <= n;++j)
            {
                cin>>a[i][j];
                edge[cnt].u=i,edge[cnt].v=j,edge[cnt].w=a[i][j];
                cnt++;
            }
        }
        sort(edge,edge+cnt,cmp);
        cin>>m;
        while(m--){
            cin>>u>>v;
            join(u,v,0);
        }
        for(int i = 0;i < cnt;++i){
            join(edge[i].u,edge[i].v,edge[i].w);
                if(tot==n-1)break;
        }
        cout<<ans<<endl;
        return 0;
    }
  • 相关阅读:
    vue开发中v-for在Eslint的规则检查下出现:Elements in iteration expect to have 'v-bind:key' directives
    一步步构造自己的vue2.0+webpack环境
    函数的扩展
    数值的扩展
    DB2数据库代码页和实例代码页的区别(解决DB2乱码问题)
    【翻译】探究Ext JS 5和Sencha Touch的布局系统
    【翻译】培训提示:解决常见编码问题的简单技巧
    【翻译】对于Ext JS 5,你准备好了吗?
    Git工程迁移方法总结(命令行)
    Ext JS 5初探(三)
  • 原文地址:https://www.cnblogs.com/h404nofound/p/11636648.html
Copyright © 2011-2022 走看看