zoj3204 Connect them

prim版本过不了 细节多 ~~ 下面代码  后来kruskal写了 直接AC。。。

 

Connect them

时间限制(普通/Java):1000MS/3000MS     运行内存限制:65536KByte
总提交: 50            测试通过: 5

描述

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 c_ij. 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 c_ij , 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 c_ij, indicating the cost of connecting computers i and j (c_ij = 0 means that you cannot connect them). 0 <= c_ij <= 60000, c_ij = c_ji, c_ii = 0, 1 <= i, j <= n.

 

输出

For each test case, if you can connect the computers together, output the method in in the following fomat:

i₁ j₁ i₁ j₁ ......

where i_k i_k (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.

 

样例输入

 

2
3
0 2 3
2 0 5
3 5 0
2
0 0
0 0

 

样例输出

 

1 2 1 3
-1

 

提示

A solution A is a line of p integers: a₁, a₂, ...a_p.
Another solution B different from A is a line of q integers: b₁, b₂, ...b_q.
A is lexicographically smaller than B if and only if:
(1) there exists a positive integer r (r <= p, r <= q) such that a_i = b_i for all 0 < i < r and a_r < b_r
OR
(2) p < q and a_i = b_i for all 0 < i <= p

 

未过版本：

/*S集合是最小生成树的点集合 N表示未在最小生成树里的点集合*/ #include <stdio.h> #include <stdlib.h> #define max(x,y) (x)>(y)?(x):(y) #define Elemtype double //权值数据类型 #define maxn 105 //最多顶点集合 #define inf 0x7fffffff //无穷大 typedef struct{ int u,v;//边 Elemtype key;//边权值 }edge; bool s[maxn];//集合S int neig[maxn];//顶点j的近邻(在S集中的顶点) edge mst[maxn];//最小花费生成树的边集 Elemtype w[maxn];//顶点j与邻近相关联的边权值 Elemtype g[maxn][maxn];//图的邻接矩阵 int cmp(const void *a,const void *b) { int t=(*(edge *)a).u-(*(edge *)b).u; if(t==0){ return (*(edge *)a).v>(*(edge *)b).v?1:-1; } else return t; } void prim(int n,int *k)//n表示当前的顶点数目 k表示边集条数 { int i,j,u; double min=inf; s[0]=1;//prim从0顶点开始的 for(i=1;i<n;i++) { w[i]=g[0][i];//将与0顶点连通的边权值赋值给w[] neig[i]=0;//邻近保存0顶点是邻近点 s[i]=0; }//初始化 (*k)=0; for(i=1;i<n;i++) { u=inf; min=inf; //选出最小的边加入mst边集 for(j=1;j<n;j++) { /* if(!s[j]&&w[j]<min) { u=j;min=w[j]; }*/ if(!s[j]) { if(w[j]<min) {u=j;min=w[j];} else if(w[j]==min) { int t1,t2; t1=max(u,neig[u]); t2=max(j,neig[j]); if(t2<t1) { u=j; } } } } if(u==inf)break;//已经找完或没有连通的了 //登记最小生成树的边 mst[(*k)].u=neig[u];//边在S集合中的顶点 mst[(*k)].v=u;//边在N集合中的顶点 mst[(*k)++].key=w[u];//记录该边的权值 /* for(int kkk=0;kkk<n;kkk++) printf("u = %d %d/n",kkk+1,neig[kkk]+1);//test printf("===/n"); */ // s[u]=1;//将顶点加入S集合 //邻近信息更新 /* for(j=1;j<n;j++) { if(!s[j]&&g[u][j]<w[j]) { w[j]=g[u][j]; neig[j]=u;//u是邻近点 j在N集合的 } }*/ //printf("u=%d %d/n",u,neig[u]); for(int kk=0;kk<n;kk++) { if(s[kk]) {u=kk; for(j=1;j<n;j++) { if(!s[j]) { if(w[j]>g[u][j]) { w[j]=g[u][j]; neig[j]=u;//u是邻近点 j在N集合的 } else if(w[j]==g[u][j]) { if(neig[j]>u) { neig[j]=u; } } } } } } /* for(int kkk=0;kkk<n;kkk++) printf("u = %d %d/n",kkk+1,neig[kkk]+1);//test printf("==2=/n");*/ } } //初始化 prim使用前先得初始化 void init(int n) { int i,j; for(i=0;i<n;i++) for(j=0;j<n;j++) {g[i][j]=inf;} } int main(int argc, char *argv[]) { int t,n,i,j; scanf("%d",&t); while(t--) { scanf("%d",&n); init(n); for(i=0;i<n;i++) for(j=0;j<n;j++) {scanf("%lf",&g[i][j]);if(g[i][j]==0.0)g[i][j]=inf; //printf("%.0lf ",g[i][j]);//test } int k; prim(n,&k); //printf("/nk = %d/n",k);//test if(k==n-1) { for(i=0;i<k;i++) { if(mst[i].u>mst[i].v) { int tmp=mst[i].u; mst[i].u=mst[i].v; mst[i].v=tmp; } } qsort(mst,k,sizeof(mst[0]),cmp); for(i=0;i<k;i++) { if(i)printf(" "); printf("%d %d",mst[i].u+1,mst[i].v+1);} printf("/n"); } else { printf("-1/n"); } } return 0; } /* 33 4 0 2 3 0 2 0 2 3 3 2 0 3 0 3 3 0 5 0 4 0 0 1 4 0 0 0 0 0 0 0 3 2 0 0 3 0 3 1 0 2 3 0 5 0 4 0 3 1 4 0 0 0 0 0 0 0 3 2 3 0 3 0 3 1 0 2 3 0 5 0 4 0 3 1 4 0 0 0 0 0 0 0 3 3 3 0 3 0 3 1 0 3 3 0 */

 

AC的版本 kruskal

#include <stdio.h> #include <stdlib.h> #define maxn 105 //最多顶点集合 typedef struct{ int x,y; int key;//边权值 }node; int s[maxn]; node p_queue[maxn*maxn+10]; int cmp(const void *a,const void *b) { int t=(*(node *)a).key-(*(node *)b).key; if(0==t) { int kt=(*(node *)a).x-(*(node *)b).x; if(0==kt) { return (*(node *)a).y>(*(node *)b).y?1:-1; } else { return kt; } } else { return t; } } int cmpl(const void *a,const void *b) { int t=(*(node *)a).x-(*(node *)b).x; if(t==0){ return (*(node *)a).y>(*(node *)b).y?1:-1; } else return t; } int find(int x) { int r; r=x; while(r!=s[r]) { r=s[r]; } return r; } void merge(int x,int y) { s[x]=y; } void solve() { int t,n,k,tk; int i,j,key; node que[maxn]; scanf("%d",&t); while(t--) { k=0; scanf("%d",&n); for(i=0;i<n;i++) for(j=0;j<n;j++) { scanf("%d",&key); if(key!=0) { node a; if(i<j) { a.x=i;a.y=j; } else {a.x=j;a.y=i;} a.key=key; p_queue[k++]=a; } } qsort(p_queue,k,sizeof(p_queue[0]),cmp); for(i=0;i<maxn;i++)s[i]=i; tk=0; for(i=0;i<k;i++) { node a; a=p_queue[i]; int fx=find(a.x); int fy=find(a.y); if(fx!=fy) { que[tk++]=a; merge(fx,fy); } } qsort(que,tk,sizeof(que[0]),cmpl); if(tk==n-1) { for(i=0;i<tk;i++) { if(i)printf(" "); printf("%d %d",que[i].x+1,que[i].y+1); } printf("/n"); } else { printf("-1/n"); } } } int main() { solve(); return 0; } /* 4 4 0 2 3 0 2 0 2 3 3 2 0 3 0 3 3 0 5 0 4 0 0 1 4 0 0 0 0 0 0 0 3 2 0 0 3 0 3 1 0 2 3 0 5 0 4 0 3 1 4 0 0 0 0 0 0 0 3 2 3 0 3 0 3 1 0 2 3 0 5 0 4 0 3 1 4 0 0 0 0 0 0 0 3 3 3 0 3 0 3 1 0 3 3 0 */