poj 1861 Network (kruskal)
来源:互联网 发布:淘宝长款短袖 编辑:程序博客网 时间:2024/05/01 21:55
Network
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13633 Accepted: 5288 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
Source
Northeastern Europe 2001, Northern Subregion
样例没有错误,因为,只要连通图中最长边最小就行了, 至于边的个数则没有限制,但感觉这题还是很坑!
#include"stdio.h"#include"string.h"#include"queue"#include"algorithm"using namespace std;#define N 1005#define inf 0x7fffffffint pre[N],ans[N];struct node{ int u,v,d;}e[N*15];bool cmp(node a,node b){ return a.d<b.d;}int find(int x){ if(x!=pre[x]) pre[x]=find(pre[x]); return pre[x];}void kruskal(int n,int m){ int i,f1,f2,j,cnt=0; for(i=1;i<=n;i++) pre[i]=i; for(i=0;i<m;i++) { f1=find(e[i].u); f2=find(e[i].v); if(f1!=f2) { pre[f1]=f2; cnt++; if(cnt>=n-1) break; } } printf("%d\n",e[i].d); printf("%d\n",i+1); for(j=0;j<=i;j++) printf("%d %d\n",e[j].u,e[j].v);}int main(){ int n,m,i; while(~scanf("%d%d",&n,&m)){ for(i=0;i<m;i++) { scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].d); } sort(e,e+m,cmp); kruskal(n,m);} return 0;}
0 0
- poj 1861 Network (kruskal)
- POJ 1861 Network(Kruskal)
- POJ 1861 Network(Kruskal)
- POJ 1861 Network (Kruskal)
- POJ 1861 Network(Kruskal)
- POJ 1861 NetWork (Kruskal算法)
- Poj 1861 Network (模版kruskal)
- POJ 1861 Network (Kruskal算法)
- zoj 1542 || poj 1861 Network(MST = = Kruskal~)
- poj 1861 network (kruskal)
- POJ 1861:Network(最小生成树&&kruskal)
- POJ 1861-Network(最小生成树-Kruskal)
- ZOJ 1542 / POJ 1861 Network (kruskal )
- poj 1861 Network (kruskal 最小生成树)
- POJ 1861 Network Kruskal优化模板
- POJ 1861 Network (Kruskal+并查集)
- POJ 2349 Arctic Network(Prim/Kruskal)
- poj 2349 Arctic Network (kruskal)
- ASP.NET 页面之间传递值的几种方式
- js返回上一页并刷新 代码整理
- android 自动匹配文本 AutoCompleteTextView /MultiAutoCompleteTextView
- 在 ASP.NET MVC 中使用 HTTPS (SSL/TLS)
- 弱校ACM奋斗史
- poj 1861 Network (kruskal)
- 修改已经完成的项目的默认类前缀
- 关于epoll的ET模式
- char *和String的区别
- Xcelsius 使用XML做为数据源 ----利用ASP与数据库进行交互,即时刷新
- IOS学习笔记-Protocol(协议-委托)
- jquery圆环
- li行间距大(IE中多了5个像素)的解决方法
- JavaScript中With 语句使用方法实例