zoukankan      html  css  js  c++  java
  • POJ-1287 Networking

    Networking
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 7885   Accepted: 4326

    Description

    You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of points. For each possible route between two points, you are given the length of the cable that is needed to connect the points over that route. Note that there may exist many possible routes between two given points. It is assumed that the given possible routes connect (directly or indirectly) each two points in the area. 
    Your task is to design the network for the area, so that there is a connection (direct or indirect) between every two points (i.e., all the points are interconnected, but not necessarily by a direct cable), and that the total length of the used cable is minimal.

    Input

    The input file consists of a number of data sets. Each data set defines one required network. The first line of the set contains two integers: the first defines the number P of the given points, and the second the number R of given routes between the points. The following R lines define the given routes between the points, each giving three integer numbers: the first two numbers identify the points, and the third gives the length of the route. The numbers are separated with white spaces. A data set giving only one number P=0 denotes the end of the input. The data sets are separated with an empty line. 
    The maximal number of points is 50. The maximal length of a given route is 100. The number of possible routes is unlimited. The nodes are identified with integers between 1 and P (inclusive). The routes between two points i and j may be given as i j or as j i. 

    Output

    For each data set, print one number on a separate line that gives the total length of the cable used for the entire designed network.

    Sample Input

    1 0
    
    2 3
    1 2 37
    2 1 17
    1 2 68
    
    3 7
    1 2 19
    2 3 11
    3 1 7
    1 3 5
    2 3 89
    3 1 91
    1 2 32
    
    5 7
    1 2 5
    2 3 7
    2 4 8
    4 5 11
    3 5 10
    1 5 6
    4 2 12
    
    0

    Sample Output

    0
    17
    16

    26

    #include<cstdio>
    #include<algorithm>
    #define MAXN 100000
    using namespace std;
    int per[MAXN];
    struct edge{
        int v;
        int u;
        int cost;
    }g[MAXN];
    bool cmp(edge e1,edge e2)
    {
        return e1.cost<e2.cost;
    }
    int find(int x)
    {
        if(x==per[x])    return x;
        return find(per[x]);
    }
    int main()
    {
        int m,n;
        while(scanf("%d",&n),n)
        {
            scanf("%d",&m);
            int val=0;
            for(int i=0;i<n;i++)
                per[i]=i;
            for(int i=0;i<m;i++)
                scanf("%d%d%d",&g[i].u,&g[i].v,&g[i].cost);
            sort(g,g+m,cmp);
            for(int i=0;i<m;i++)
            {
                int fx=find(g[i].u);
                int fy=find(g[i].v);
                if(fx!=fy){
                    val+=g[i].cost;
                    per[fx]=fy;
                }
            }
            printf("%d
    ",val);
        }
        return 0;
    }



  • 相关阅读:
    syslog日志格式解析
    Linux打补丁的一个简单例子
    Linux打补丁的一些问题
    安全漏洞整改解决方案(很不错网络文章)
    Linux系统启动过程
    chkconfig命令主要用来更新(启动或停止)和查询系统服务的运行级信息
    主机名/etc/hosts文件的作用
    Linux中如何配置IP相关文件
    /bin、/sbin、/usr/bin、/usr/sbin目录Linux执行文档的区别
    日志生成控制文件syslog.conf
  • 原文地址:https://www.cnblogs.com/cniwoq/p/6770986.html
Copyright © 2011-2022 走看看