Network(P1861)
来源:互联网 发布:单片机的最小系统简述 编辑:程序博客网 时间:2024/06/06 00:32
刚开始用prim,,加pre[ ]的方法一直WA,后来改用这个方法,#include<iostream>#include<stdlib.h>#include<math.h>#include<stdio.h>#include<algorithm>#include<queue>#include<string.h>#include<stack>#include<math.h>#include<string>#include<stdlib.h>#include<list>#include<vector>using namespace std;#define N 150001struct my{ int a; int b; int w;}edge[N],ans[N];int n,m;int f[N];bool cmp(my x,my y){ return x.w<y.w;}void init(){ int i,j,k; for (i=0;i<=n;i++) f[i]=i;}int find(int k){ if (f[k]!=k) f[k]=find(f[k]); return f[k];}void un(int x,int y){ int i,j; i=find(x); j=find(y); f[i]=j;}void make(){ init(); int i,j,k; k=0; for (i=0;i<m;i++) { if (find(edge[i].a)!=find(edge[i].b)) { un(edge[i].a,edge[i].b); ans[k].a=edge[i].a; ans[k++].b=edge[i].b; } if (k==n-1) { cout<<edge[i].w<<endl; cout<<n-1<<endl; break; } } for (i=0;i<n-1;i++) { cout<<ans[i].a<<' '<<ans[i].b<<endl; }}int main(){ //freopen("fuck.txt","r",stdin); int i,j,k; cin>>n>>m; for (i=0;i<m;i++) { cin>>edge[i].a>>edge[i].b>>edge[i].w; } sort(edge,edge+m,cmp); make();}
Network
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9834 Accepted: 3683 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
- Network(P1861)
- SSL P1861 提高组 无限序列
- [network]
- NETWORK
- Network
- network
- network
- Network
- NETWORK
- network
- Network
- network
- Network
- Network
- network
- Network
- Network
- Network
- 正则表达式语法 (字符匹配语法,重复匹配语法,字符定位语法,转义匹配语法)
- OP AMP - 理想运算放大器和非理想放大器(一)
- Python 2.7 字符串
- JSONObject与JSONArray的使用方法 .
- line-height 和 vertical-align 行高与行对齐精解 (图文)
- Network(P1861)
- select, poll和epoll的区别
- andorid之高级组件之不懂之详解
- stagefright与opencore对比
- AE10 运行时注册许可问题解决
- json 返回数据时间的绑定的转换 和时间的差值计算
- 9G-STM32-移植FATFS的NANDFLASH驱动
- 腾讯2012实习生笔试题
- ubuntu一些命令记录