poj 1861 平生第一次Validator Error
来源:互联网 发布:淘宝联盟鹊桥官网 编辑:程序博客网 时间:2024/05/01 23:41
Network
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11041 Accepted: 4200 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
程序输出让验证程序挂了,真是难以置信。
Validator Error The checker program has exhibited abnormal behavior while validating the output produced by the solution.这样情况就得再交,直到出现其他情况,我第二遍就AC了
- poj 1861 平生第一次Validator Error
- 庆祝平生第一次中奖
- 平生第一次写博客
- 子曾经曰过,我平生第一次讨厌下雨。
- 明天去温州瑞安出差,平生第一次出差,祝自己一路顺风!
- 天生缘分 一、三、五 —— 记平生第一次远行
- [转]平生
- hibernate-validator 源码导入 IDEA Compile error!
- validator
- VALIDATOR
- validator
- Validator
- Validator
- validator
- Validator
- validator
- Validator
- VALIDATOR
- ASP.NET使用GridView控件、DetailsView控件
- linux下Mongodb安装和启动
- 相机帧率和曝光时间的关系
- ZOJ 2172 Symmetric Order
- zoj 1755 Clay Bully
- poj 1861 平生第一次Validator Error
- Union的巧妙运用,判断系统大小端
- 天勤OJ 题目1385: 反序相等
- Video Graphics Array
- js数组的操作
- CSS编码规范【整理】
- zoj 1760 Doubles
- [SSP]HTTP权威指南——连接管理
- spring mvc3中的addFlashAttribute方法