zoukankan      html  css  js  c++  java
  • Poj1861--Network(最小生成树)

    Network
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 15053   Accepted: 5912   Special Judge

    Description

    Andrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since each worker of the company must have access to the whole network, each hub must be accessible by cables from any other hub (with possibly some intermediate hubs).
    Since cables of different types are available and shorter ones are cheaper, it is necessary to make such a plan of hub connection, that the maximum length of a single cable is minimal. There is another problem — not each hub can be connected to any other one because of compatibility problems and building geometry limitations. Of course, Andrew will provide you all necessary information about possible hub connections.
    You are to help Andrew to find the way to connect hubs so that all above conditions are satisfied.

    Input

    The first line of the input contains two integer numbers: N - the number of hubs in the network (2 <= N <= 1000) and M - the number of possible hub connections (1 <= M <= 15000). All hubs are numbered from 1 to N. The following M lines contain information about possible connections - the numbers of two hubs, which can be connected and the cable length required to connect them. Length is a positive integer number that does not exceed 106. There will be no more than one way to connect two hubs. A hub cannot be connected to itself. There will always be at least one way to connect all hubs.

    Output

    Output first the maximum length of a single cable in your hub connection plan (the value you should minimize). Then output your plan: first output P - the number of cables used, then output P pairs of integer numbers - numbers of hubs connected by the corresponding cable. Separate numbers by spaces and/or line breaks.

    Sample Input

    4 6
    1 2 1
    1 3 1
    1 4 2
    2 3 1
    3 4 1
    2 4 1
    

    Sample Output

    1
    4
    1 2
    1 3
    2 3
    3 4
    

    Source

    Northeastern Europe 2001, Northern Subregion

    [Submit]   [Go Back]   [Status]   [Discuss]

    1a.

    #include <cstdio>
    #include <cstring>
    #include <iostream>
    #include <algorithm>
    using namespace std;
    int n, m;
    int a[1010], b[1010], father[1010];
    struct Node
    {
        int a, b, w;
    } num[15010];
    int cmp(Node a, Node b)
    {
        return a.w < b.w;
    }
    void init()
    {
        for(int i = 1; i <= n; i++)
            father[i] = i;
    }
    int find(int a)
    {
        int r, j, k;
        r = a;
        while(r != father[r])
            r = father[r];
        j = a;
        while(j != r)
        {
            k = father[j];
            father[j] = r;
            j = k; 
        }
        return r; 
    }
    bool mercy(int a, int b)
    {
        int q = find(a);
        int p = find(b);
        if(q != p)
        {
            father[q] = p;
            return true; 
        }
        return false;
    }
    int main()
    {
        while(~scanf("%d %d", &n, &m))
        {
            init(); int Q = 0;
            for(int i = 0; i < m; i++)
                scanf("%d %d %d", &num[i].a, &num[i].b, &num[i].w); 
            sort(num, num + m, cmp);
            int total = 0, max = -1;
            for(int i = 0; i < m; i++)
                if(mercy(num[i].a, num[i].b))
                {
                    if(num[i].w > max)
                        max = num[i].w;
                    a[Q] = num[i].a; b[Q++] = num[i].b;
                }
            printf("%d
    %d
    ", max, Q);
            for(int i = 0; i < Q; i++)
                printf("%d %d
    ", a[i], b[i]); 
        }
        return 0;
    }
    /*运行结果;
    1
    3
    1 2
    1 3
    3 4*/
     

     

  • 相关阅读:
    Eclipse调试常用技巧
    12个小技巧,让你高效使用Eclipse
    Java程序生成exe可执行文件详细教程(图文说明)
    手机打开PDF文档中文英文支持(乱码问题)解决攻略
    Java修饰符public,private,protected及默认的区别
    Eclipse 各种小图标的含义
    continue break return的区别
    Android开发快速入门(环境配置、Android Studio安装)
    Struts2中的Unable to load configuration错误的分析与解决方法
    认识与入门 Markdown,Markdown教程
  • 原文地址:https://www.cnblogs.com/soTired/p/4764401.html
Copyright © 2011-2022 走看看