思路:就是将选好的边一条条的删了在看能不能找出相同的答案
提供两种方法
1.用数组储存找出的边
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 |
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int jh[310],m,n,shumu,del[310],k; struct aa { int x,y,s; } ma[6000]; int cmp(const aa &a,const aa &b) { return a.s<b.s; } int fin(int a) { while(a!=jh[a]) a=jh[a]; return a; } void reset() { int a; for(a=1; a<=n; a++) jh[a]=a; } int kru(int de,int flag) { int a,b,c,ans=0; shumu=n; reset(); for(a=1; a<=m&&shumu>1; a++) if(a!=de) { b=fin(ma[a].x); c=fin(ma[a].y); if(b!=c) { jh[b]=jh[ma[a].x]=jh[ma[a].y]=c; ans+=ma[a].s; shumu--; if(flag==1) del[++k]=a; } } return ans; } int main () { int a,nn,ans,flag,b; scanf("%d",&nn); while(nn--) { scanf("%d%d",&n,&m); flag=1; k=0; for(a=1; a<=m; a++) scanf("%d%d%d",&ma[a].x,&ma[a].y,&ma[a].s); sort(&ma[1],&ma[m+1],cmp); ans=kru(-1,1); if(shumu>1) { printf("0\n"); continue; } for(a=1; a<=k; a++) { b=kru(del[a],0); if(shumu>1) continue; if(b==ans) { flag=0; break; } } if(flag==0) printf("Not Unique!\n"); else printf("%d\n",ans); } return 0; } |
2.以忽视第几条边为判断条件
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 |
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int jh[310],m,n,shumu,mark[6000]; struct aa { int x,y,s; } ma[6000]; int cmp(const aa &a,const aa &b) { return a.s<b.s; } int fin(int a) { while(a!=jh[a]) a=jh[a]; return a; } void reset() { int a; for(a=1; a<=n; a++) jh[a]=a; } int kru(int de,int flag) { int a,b,c,ans=0,num=0; shumu=n; reset(); for(a=1; a<=m&&shumu>1; a++) { if(mark[a]!=0) num++; if(num!=de) { b=fin(ma[a].x); c=fin(ma[a].y); if(b!=c) { jh[b]=jh[ma[a].x]=jh[ma[a].y]=c; ans+=ma[a].s; shumu--; if(flag==1) mark[a]=1; } } else num++;//这里小心,不加的话之后会影响之后的判断 } return ans; } int main () { int a,nn,ans,flag,b; scanf("%d",&nn); while(nn--) { scanf("%d%d",&n,&m); flag=1; for(a=1; a<=m; a++) scanf("%d%d%d",&ma[a].x,&ma[a].y,&ma[a].s); sort(&ma[1],&ma[m+1],cmp); memset(mark,0,sizeof(mark)); ans=kru(100000,1); if(shumu>1) { printf("0\n"); continue; } for(a=1; a<=n-1; a++) { b=kru(a,0); if(shumu>1) continue; if(b==ans) { flag=0; break; } } if(flag==0) printf("Not Unique!\n"); else printf("%d\n",ans); } return 0; } |