ZOJ 3204 (C)
来源:互联网 发布:photoshop mac版下载 编辑:程序博客网 时间:2024/06/05 07:00
#include<iostream>#include<cstdio>#include<list>#include<algorithm>#include<cstring>#include<string>#include<queue>#include<stack>#include<map>#include<vector>#include<cmath>#include<set>#define ll long longusing namespace std;#define N 200int g[N][N],a[N],vis[N],ok;struct point{int x,y,va;point(int _x,int _y, int _va) :x(_x),y(_y) ,va(_va){}point(){}bool operator <(const point &x1)const{if (this->va != x1.va)return this->va < x1.va;if (this->x != x1.x)return this->x < x1.x;return this->y < x1.y;}};struct Answer{int xx, yy;Answer(int _xx, int _yy) :xx(_xx), yy(_yy){}Answer(){}bool operator < (const Answer &x1)const{if (this->xx != x1.xx)return this->xx < x1.xx;return this->yy < x1.yy;}};vector<point>eg;set<Answer>ans;int find(int x){return x == a[x] ? x : a[x] = find(a[x]);}void unio(int x, int y){x = find(x);y = find(y);if (a[x] != y)a[x] = y;}inline bool judge_same(int x, int y){return find(x) == find(y);}void kruskal(int n){for (int i = 1; i <= n; i++)a[i] = i;for (int i = 0; i < eg.size(); i++){if (!judge_same(eg[i].x, eg[i].y)){ok++;unio(eg[i].x, eg[i].y);ans.insert(Answer(eg[i].x, eg[i].y));}}}int main(){#ifdef CDZSCfreopen("i.txt", "r", stdin);#endifint t, n,x;scanf("%d", &t);while (t--){ok = 0;ans.clear();eg.clear();scanf("%d", &n);for (int i = 1; i <= n; i++){for (int j = 1; j <= n; j++){scanf("%d", &x);if (x == 0)continue;elseeg.push_back(point(i, j, x));}}sort(eg.begin(), eg.end());kruskal(n);if (ok==n-1){int f = 1;set<Answer>::iterator it;for (it = ans.begin(); it != ans.end(); it++){if (f){f = 0;printf("%d %d", (*it).xx, (*it).yy);}elseprintf(" %d %d", (*it).xx, (*it).yy);}puts("");}elseputs("-1");}return 0;}
最小生成树+字典序最小输出,注意在边权值相同的时候进行字典序排序,字典序小的先建边,如何判断这个树是否建好了呢?合并次数==点的个数-1,就证明这棵树建好了.
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 iand 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.
Input
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.
Output
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.
Sample Input
230 2 32 0 53 5 020 00 0
Sample Output
1 2 1 3-1
Hints:
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
Author: CAO, Peng
Source: The 6th Zhejiang Provincial Collegiate Programming Contest
- ZOJ 3204 (C)
- ZOJ 3689 Digging(C语言版)
- ZOJ 3758 — Singles' Day(C++)
- ZOJ 1879 — Jolly Jumpers(C++)
- C ZOJ(九度OJ 1032)
- zoj 2339 Hyperhuffman 哈夫曼编码 (4-C)
- ZOJ 2886 — Look and Say(C++)
- 周末小测——C(ZOJ 1061)
- ZOJ 1101 Gamblers (A=B+C+D)
- C语言中的求图像周长问题(ZOJ 1047)
- zoj 3204
- zoj 3204
- ZOJ-3204
- zoj 3204
- ZOJ 2967-C - Colorful Rainbows
- 2013长沙区域赛——C.Collision(ZOJ 3728)
- zoj 3728 Collision(2013亚洲区域赛 长沙站 C)
- ZOJ 3811 —— Untrusted Patrol(2014牡丹江网络赛C题)
- 第六周--数据结构之自建算法库之迷宫问题(用栈结构)
- 中文分词器IKAnalyzer——IKQueryParser主类分析
- 织梦 dede:channelartlist标签获取项目总数的方法
- Oracle pl/sql编程 5---plsql中的%type
- Android Studio 使用日志:3. Android Studio 完全删除项目的方法
- ZOJ 3204 (C)
- Android目录
- java冒泡排序法
- Centos安装Ruby2.2.3
- 九度OJ 1050:完数 (数字特性)
- 为Mac配置服务器nginx
- win32命名管道/完成端口用法练习
- 基于 Open vSwitch 的 OpenFlow 实践
- 高中生活-第9篇-开学之初的“失足”囧事,"刻舟求剑"导致腿折了