poj 1861 Network
来源:互联网 发布:软件开发团队名称 编辑:程序博客网 时间:2024/05/01 21:24
Network
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 17382 Accepted: 6990 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
拿到题看了一下用最小生成树应该没毛病啊,为啥还要输出几根线啊而且样例居然是4根??? 虽然是special judge 还是胆战心惊的敲了个prime算法,果断WA,又读了一遍题发现还是最小生成树没毛病,最后发现自己边的两个顶点写错了,唉。。。
#include <stdio.h>#include <algorithm>#include <math.h>#include <string.h>#define maxn 1100#define INF 999999999int edge[maxn][maxn];bool vis[maxn];int maxx,p,n,m;using namespace std;struct A{ int x,y; int val;}lowcost[maxn];;struct node{ int x,y;}ans[4*maxn];void prim(int num){ maxx = -2; int pos = num; p = 0; vis[pos] = 1; for(int i = 1; i <= n; i++) { lowcost[i].val = edge[pos][i]; lowcost[i].x = pos; lowcost[i].y = i; } for(int i = 1; i < n; i++) { int minn = INF; int temp; int xx,yy; for(int j = 1; j <= n; j++) { if(vis[j] == 0 && lowcost[j].val < minn) { minn = lowcost[j].val; xx = lowcost[j].x; yy = lowcost[j].y; temp = j; } } if(minn > maxx) maxx = minn; ans[p].x = xx; ans[p].y = yy; p++; pos = temp; vis[temp] = 1; for(int j = 1; j <= n; j++) { if(vis[j] == 0 && lowcost[j].val > edge[j][temp]) { lowcost[j].val = edge[j][temp]; lowcost[j].x = j; lowcost[j].y = temp; } } }}int main(){ while(~scanf("%d%d",&n,&m)) { memset(vis,0,sizeof(vis)); for(int i = 1; i <= n; i++) { for(int j = 1; j <= n ;j++) { edge[i][j] = INF; } } int minn = INF; for(int i = 0; i < m; i++) { int u,v,w; scanf("%d%d%d",&u,&v,&w); if(w < edge[u][v]) edge[u][v] = edge[v][u] = w; if(w < minn) minn = u; } prim(minn); printf("%d\n%d\n",maxx,n-1); for(int i = 0; i < p; i++) { printf("%d %d\n",ans[i].x,ans[i].y); } }}
- 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
- POJ:1861 Network
- 《Effective C++》条款03总结
- Android软件性能检测工具讲解
- 内置对象 response
- Array、List和ArrayList的区别与
- 初探计算机视觉的三个源头、兼谈人工智能|正本清源
- poj 1861 Network
- 快速搭建一个Hyperledger Fabric 1.0的环境(目前很多环境搭建方法都会中途挂掉,这个亲测有效!)
- pyspark-快速开始
- 函数指针数组
- android文件管理器源码、斗鱼直播源码、企业级erp源码等
- 连上 Linux 服务器首先要运行的前 5 个命令
- windows7系统下配置python环境和scrapy
- 【云栖大会】阿里巴巴五大平台联合发布创业扶持计划 大生态力量助力创新创业
- pandas 计算指标/哑变量