zoj 3204Connect them prim算法
来源:互联网 发布:秦国为何灭亡 知乎 编辑:程序博客网 时间:2024/05/19 19:57
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.
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
代码:prim
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<cmath>using namespace std;#define maxN 105#define INF 0x7fffffffint mat[maxN][maxN];int mark[maxN];int n;struct node{ int x,y; int dd;} d[105];struct node2{ int a,b;} q[105*105];int cmp(struct node2 c,struct node2 e){ if(c.a!=e.a) return c.a<e.a; else return c.b<e.b;}int prim(int s){ int i,j; memset(mark,0,sizeof(mark)); for(i=1; i<n; i++) { d[i].dd=mat[i][s]; d[i].x=s; d[i].y=i; } mark[s]=1; int ans=0; for(i=1; i<n; i++) { int flag=0; int min=INF; int now=1; for(j=1; j<n; j++) { if(!mark[j] && d[j].dd<=min && d[j].dd<INF) { min=d[j].dd; now=j; flag=1; } } if(flag==0) return -1; mark[now]=1; q[ans].a=d[now].x+1; q[ans++].b=d[now].y+1; for(j=1; j<n; j++) { if(!mark[j] && mat[now][j]<=d[j].dd && mat[now][j]<INF) { if(mat[now][j]==d[j].dd) { if(now<d[j].x) { d[j].x=now; } } else { d[j].dd=mat[now][j]; int ma,mi; if(now>j) { ma=now; mi=j; } else { ma=j; mi=now; } d[j].x=mi; d[j].y=ma; } } } } return ans;}int main(){ int T; scanf("%d",&T); while(T--) { scanf("%d",&n); for(int i=0; i<n; i++) { for(int j=0; j<n; j++) { scanf("%d",&mat[i][j]); if(mat[i][j]==0) mat[i][j]=INF; } } int ans=prim(0); if(ans!=-1) { sort(q,q+ans,cmp); for(int i=0; i<ans; i++) { if(i==0) printf("%d %d",q[i].a,q[i].b); else printf(" %d %d",q[i].a,q[i].b); } printf("\n"); } else printf("-1\n"); } return 0;}/*0 2 72 0 57 5 0*/
- zoj 3204Connect them prim算法
- ZOJ 3204 Connect 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(Kruskal)
- ZOJ 3204 Connect them【kruskal】
- zoj 3204 Connect them kruskal
- zoj 3204 Connect them(kruskal算法) 解题报告
- ZOJ 3204 Connect them(最小生成树:kruscal算法)
- ZOJ 3204 Connect them (kruskal+二级排序)
- ZOJ Problem Set - 3204 Connect them
- zoj 3204 Connect them//最小生成树
- ZOJ 3204 Connect them 继续MST
- Connect them - ZOJ 3204 最小生成树
- ZOJ——3204 Connect them
- Spring + Struts +Hibernate
- To kernel driver monitoring process developed in Windows8 create using Visual studio2012
- CareerCup 1.6
- centos6.3 eclipse c/c++ launch failed no binaries
- Linux ssh无密钥登录
- zoj 3204Connect them prim算法
- 常见缩写及意义
- Android native crash log分析
- 用STL中的vector动态开辟二维数组
- 黑马程序员 面试技巧<一>--->面向对象的思想示例
- Android连AppFog,响应不更新
- [黑马程序员]--交通等系统
- 求解三角形(一)
- [MYSQL] 取 Insert 数据后的 Id