zoj 3204 Connect them(kruskal算法) 解题报告
来源:互联网 发布:装企叁度erp软件 编辑:程序博客网 时间:2024/05/17 04:27
Description
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 jand 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:
i1j1i1j1 ......
where ikik (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
Source
水题一枚,就是利用kruscal,然后注意排序就好
代码:
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int f[10100];#define INF 0x3f3f3fint find(int x){ return f[x]==x?(x):(f[x]=find(f[x]));}struct zc{ int a,b,c;}r[11000];struct ans//存结果{ int a,b;}an[11000];int anst;int cmp(zc a,zc b){ if(a.c!=b.c)return a.c<b.c; if(a.a!=b.a)return a.a<b.a; return a.b<b.b;}int merge(int x,int y,int i){ x=find(x); y=find(y); if(x!=y) { f[x]=y; an[anst].a=r[i].a; an[anst++].b=r[i].b; return 1; } return 0;}int cmp1(ans a,ans b){ if(a.a!=b.a)return a.a<b.a; else return a.b<b.b;}int main(){ int T,n,a,b,c; scanf("%d",&T); while(T--) { anst=0; scanf("%d",&n); for(int i=0;i<10010;i++) { f[i]=i; } int t=0; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { scanf("%d",&c); if(j<=i||c==0)continue; r[t].a=i; r[t].b=j; r[t++].c=c; } } sort(r,r+t,cmp); int sum=0; int flag=0; for(int i=0;i<t;i++) { if(merge(r[i].a,r[i].b,i)) sum++; if(sum==n-1){flag=1;break;} } if(!flag) printf("-1\n"); else { sort(an,an+anst,cmp1); for(int i=0;i<anst-1;i++) { printf("%d %d ",an[i].a,an[i].b); } printf("%d %d\n",an[anst-1].a,an[anst-1].b); } } return 0;}
- zoj 3204 Connect them(kruskal算法) 解题报告
- zoj 3204 Connect them(Kruskal)
- ZOJ 3204 Connect them【kruskal】
- zoj 3204 Connect them kruskal
- ZOJ 3204 Connect them (kruskal+二级排序)
- ZOJ 3204 Connect them(最小生成树:kruscal算法)
- zoj 3204Connect them prim算法
- ZOJ - 3204 Connect them
- ZOJ 3204 Connect them
- ZOJ 3204 Connect them
- ZOJ 3204 Connect them
- ZOJ 3204 Connect them
- ZOJ 3204 Connect them Prim
- ZOJ-3204 Connect them(最小生成树)
- ZOJ Problem Set - 3204 Connect them
- zoj 3204 Connect them//最小生成树
- ZOJ 3204 Connect them 继续MST
- Connect them - ZOJ 3204 最小生成树
- ZOJ 3279 Ants(线段树)
- 353 3D dungeon【bfs】
- uva10791 Minimum Sum LCM(唯一分解定理)
- linux 装java的两种方法
- 向VS2015添加WTL项目向导(ATL/WTL Application Wizard)
- zoj 3204 Connect them(kruskal算法) 解题报告
- 重复子串问题(四):求两个字符串的最长公共字串
- LeetCode #4 Median of Two Sorted Arrays
- N年前Nginx负载均衡在新浪播客中的应用
- js高程3笔记
- 两会最新消息:两会时间看全面深化改革“关键棋”
- java.util.Date和java.sql.Date的区别及应用
- struts2.2 Annotation 注解配置Action
- 修正 Xcode Archive后Archive Type为Generic Xcode Archive