Network 1861
来源:互联网 发布:中国流动儿童数据报告 编辑:程序博客网 时间:2024/04/25 12:04
Network
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 14976 Accepted: 5875 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.
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 61 2 11 3 11 4 22 3 13 4 12 4 1
Sample Output
141 21 32 33 4#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int n,m;int mx,s;int c[1010];struct zz{int x,y,l;}q[15010],a[15010];int cmp(zz x,zz y){return x.l<y.l;}int find(int x){while(x!=c[x])x=c[x];return x;}void marge(int x,int y,int z){int fx,fy;fx=find(x);fy=find(y);if(fx!=fy){c[fx]=fy;a[s].x=x;a[s++].y=y;if(z>mx)mx=z;}}int main(){while(scanf("%d%d",&n,&m)!=EOF){int i,j;for(i=1;i<=n;i++)c[i]=i;for(i=0;i<m;i++){scanf("%d%d%d",&q[i].x,&q[i].y,&q[i].l);}sort(q,q+m,cmp);s=0;mx=-1;for(i=0;i<m;i++){marge(q[i].x,q[i].y,q[i].l);}printf("%d\n",mx);printf("%d\n",s);for(i=0;i<s;i++){printf("%d %d\n",a[i].x,a[i].y);}}return 0;}
0 0
- Network 1861
- POJ 1861 Network
- poj 1861 Network
- POJ 1861 Network
- poj 1861 network
- poj 1861 network
- poj 1861 network
- POJ 1861 Network(Kruskal)
- poj 1861 Network MST
- POJ 1861 Network
- POJ 1861 Network
- POJ 1861 Network
- poj 1861 Network
- POJ-1861-Network
- POJ 1861 Network
- POJ 1861 Network(Kruskal)
- POJ 1861 Network
- poj 1861 Network
- cocos2-d-x之runAction与clone的不解之缘
- memset及memcpy实现
- 菜鸟学前端之初入江湖
- 推荐系统——利用用户标签数据
- POJ 1228 Grandpa's Estate
- Network 1861
- LeetCode解题报告--Roman to Integer
- 代码手写UI,xib和StoryBoard间的博弈
- 【汇总】资源下载网址
- 深入JavaScript(15)JavaScript核心(晋级高手必读篇)
- HDU 5389 Zero Escape
- cell的自适应高度
- 用@property声明的NSString(或NSArray,NSDictionary)经常使用copy关键字,为什么?如果改用strong关键字,可能造成什么问题?
- 求指导pat的1003题,改了二三十遍都同通不过,求各位看看到底错哪了