POJ1861 Network

Time Limit: 1000MS

Memory Limit: 30000KB

64bit IO Format: %lld & %llu

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 10 ⁶. 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

样例输出明显错了。

1

3

1 2

1 3

3 4

这样可行。有Special Judge

 

Source

Northeastern Europe 2001, Northern Subregion

 

 

裸最小生成树。要求输出生成树中最大边数，连接的点数（肯定是n-1），使用的每条边。

 

/*by SilverN*/
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
const int mxn=16000;
int n,m;
struct node{
    int x,y;
    int dis;
}e[mxn];
int cnt=0;
int cmp(node a,node b){
    return a.dis<b.dis;
}
int fa[mxn];
void init(){
    for(int i=1;i<=n;i++)fa[i]=i;
}
int find(int x){
    if(fa[x]==x)return x;
    return fa[x]=find(fa[x]);
}
queue<int>aw;
int ans=0;
void Kruskal(){
    int i,j;
    ans=0;
    int now=0;
    for(i=1;i<=m;i++){
        int u=find(e[i].x),v=find(e[i].y);
        if(u==v)continue;
        aw.push(i);
        fa[u]=v;
        now++;
        ans=max(ans,e[i].dis);
        if(now==n-1)break;
    }
}
int main(){
    while(scanf("%d",&n)!=EOF){
        init();
        int u,v,dis;
        m=read();
        int i,j;
        for(i=1;i<=m;i++){
            e[i].x=read();e[i].y=read();e[i].dis=read();
        }
        sort(e+1,e+m+1,cmp);
        Kruskal();
        printf("%d
",ans);
        printf("%d
",n-1);
        while(!aw.empty()){
            int tmp=aw.front();
            aw.pop();
            printf("%d %d
",e[tmp].x,e[tmp].y);
        }
    }
    return 0;
}