2815 Connect them
来源:互联网 发布:七秀成女捏脸数据网盘 编辑:程序博客网 时间:2024/04/26 13:54
Connect them
总提交: 7 测试通过: 1
http://acm.tzc.edu.cn/acmhome/problemdetail.do?&method=showdetail&id=2815
描述
You have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is connecting computers i and j is the same as connecting computers j and i). The cost of connecting computer i and computer j is cij. You cannot connect some pairs of computers due to some particular reasons. You want to connect them so that every computer connects to any other one directly or indirectly and you also want to pay as little as possible. Given n and each cij , find the cheapest way to connect computers.
输入
There are multiple test cases. The first line of input contains an integer T (T <= 100), indicating the number of test cases. Then T test cases follow. The first line of each test case contains an integer n (1 < n <= 100). Then n lines follow, each of which contains n integers separated by a space. The j-th integer of the i-th line in these n lines is cij, indicating the cost of connecting computers i and j (cij = 0 means that you cannot connect them). 0 <= cij <= 60000, cij = cji, cii = 0, 1 <= i, j <= n.
输出
For each test case, if you can connect the computers together, output the method in in the following fomat: i1 j1 i1 j1 ...... where ik ik (k >= 1) are the identification numbers of the two computers to be connected. All the integers must be separated by a space and there must be no extra space at the end of the line. If there are multiple solutions, output the lexicographically smallest one (see hints for the definition of "lexicography small") If you cannot connect them, just output "-1" in the line.
样例输入
230 2 32 0 53 5 020 00 0
样例输出
1 2 1 3-1
提示
A solution A is a line of p integers: a1, a2, ...ap.
Another solution B different from A is a line of q integers: b1, b2, ...bq.
A is lexicographically smaller than B if and only if:
(1) there exists a positive integer r (r <= p, r <= q) such that ai = bi for all 0 < i < r and ar < br
OR
(2) p < q and ai = bi for all 0 < i <= p
- 2815 Connect them
- Connect them
- zoj3204 Connect them
- ZOJ - 3204 Connect them
- ZOJ 3204 Connect them
- ZOJ 3204 Connect them
- ZOJ 3204 Connect them
- ZOJ 3204 Connect them
- ZOJ3204-Connect them
- Connect them ZOJ
- zoj 3204 Connect them(Kruskal)
- ZOJ 3204 Connect them【kruskal】
- zoj 3204 Connect them kruskal
- ZOJ 3204 Connect them Prim
- ZOJ 3204 Connect them (kruskal+二级排序)
- zoj3204 Connect them 最小生成树 MST
- ZOJ Problem Set - 3204 Connect them
- zoj 3204 Connect them//最小生成树
- 1186 Calling Extraterrestrial Intelligence Again
- ksh read file examples
- linux telnet登陆慢问题
- 接口
- 任务管理器被管理员禁用,命令提示符被禁用,注册表被禁用,组策略被禁用的解决办法
- 2815 Connect them
- 桌面定位到D盘
- MATLAB GUI 打开/显示/处理 /保存/图象(图像)程序
- mysql 乱码
- 最近我在干啥
- Oracle DBA 的个人复习笔记——一些简单的Oracle内部简介(1)。
- 一些你需要知道的Java编程代码规范
- 解决断电后每次开机都自检
- 自己写的模拟调制与解调 matlab gui程序