POJ 1861 Network【最小生成树】

原创 2016年06月01日 12:25:34

Network

Time Limit: 1000MS

 

Memory Limit: 30000K

Total Submissions: 15829

 

Accepted: 6255

 

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

 

题目大意:给出n个节点,给出m条边,输出最小生成树中的最大边权值,然后输出一个可行生成树的解。


思路:直接克鲁斯卡尔算法水之。。。。


AC代码:

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int f[100000];
int ans[100000][2];
struct zuobiao
{
    int x,y,w;
}a[121212];
int find(int x)
{
    return f[x] == x ? x : (f[x] = find(f[x]));
}
void merge(int a,int b)
{
    int A,B;
    A=find(a);
    B=find(b);
    if(A!=B)
    f[B]=A;
}
int cmp(zuobiao a,zuobiao b)
{
    return a.w<b.w;
}
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)f[i]=i;
    for(int i=0;i<m;i++)
    {
        scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].w);
    }
    sort(a,a+m,cmp);
    int output;
    int k=0;
    for(int i=0;i<m;i++)
    {
        if(find(a[i].x)!=find(a[i].y))
        {
            ans[k][0]=a[i].x;
            ans[k][1]=a[i].y;
            merge(a[i].x,a[i].y);
            k++;
            if(k==n-1)output=a[i].w;
        }
    }
    printf("%d\n%d\n",output,k);
    for(int i=0;i<k;i++)
    {
        printf("%d %d\n",ans[i][0],ans[i][1]);
    }
}





版权声明:0.0小白有写的不好不对的地方请指出~

POJ1287-最小生成树

题目:题目链接   题意:给你一个图,然后求最小花费的图使得所有的点都有被连到   分析:最小生成树,需要注意的是这里的边是更新的,每次都需要判断一下是不是边的权值被更新了。Prime竟然不超...
  • u010057864
  • u010057864
  • 2013年10月03日 20:55
  • 588

POJ 1861 Network(最小瓶颈生成树)

POJ 1861 Network(最小瓶颈生成树) http://poj.org/problem?id=1861 题意:        给你一个N个点和M条边的图,现在要你从这M条边中选一些边的...
  • u013480600
  • u013480600
  • 2014年07月20日 20:26
  • 1145

poj 1861 Network(最小生成树)

Network Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 13680   A...
  • u012860428
  • u012860428
  • 2014年09月01日 21:11
  • 381

POJ 题目1861 Network(最小生成树)

Network Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 14062   Accep...
  • yu_ch_sh
  • yu_ch_sh
  • 2015年03月01日 21:05
  • 284

poj2253 最小生成树中的最大边 prim

Frogger Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 30620   Accepted: 9875 ...
  • became_a_wolf
  • became_a_wolf
  • 2015年08月19日 09:15
  • 692

最小生成树-两种算法复杂度比较 poj-1258,2485

1.Prim算法 时间是复杂度O(n2),适合稠密图。 例:Poj–1258 题目大意:n个城市建造光缆,要使这些城市直接通信,并且光缆费用最小。 #include #include #de...
  • jichangzhen
  • jichangzhen
  • 2016年08月20日 11:37
  • 1135

poj 1861(最小生成树)

poj 1861(最小生成树)
  • u014737310
  • u014737310
  • 2014年08月01日 15:46
  • 668

POJ1287Networking(最小生成树,裸题)

Description You are assigned to design network connections between certain points in a wide area....
  • z1192277815
  • z1192277815
  • 2016年08月03日 21:32
  • 434

poj_1639 Picnic Planning(度限制最小生成树)

Picnic Planning Time Limit: 5000MS   Memory Limit: 10000K Total Submissions: 10431   Accepted:...
  • christry_stool
  • christry_stool
  • 2017年02月07日 00:40
  • 354

最小k限度生成树 +poj(1639)代码

算法引入: 最小k度限制生成树,就是指有特殊的某一点的度不能超过k时的最小生成树; 如果T是G的一个生成树且dT(v0)=k,则称T为G的k度限制生成树; G中权值和最小的k度限制生成树称为G的...
  • sinat_36215255
  • sinat_36215255
  • 2017年08月07日 14:08
  • 135
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 1861 Network【最小生成树】
举报原因:
原因补充:

(最多只允许输入30个字)