POJ_1659 Frogs' Neighborhood
2010-10-26 19:15
489 查看
http://poj.org/problem?id=1659
#include<iostream> #include<algorithm> using namespace std; struct node{ int i,x; }map[10]; int cmp(const void *a,const void *b) { return ((*(node*)b).x -(*(node*)a).x); } int main() { // freopen("in.txt","r",stdin); int t,n,i,k,j; int visit[10][10]; cin>>t; bool flag; while(t--) { flag=true; memset(visit,0,sizeof(visit)); cin>>n; for(i=0;i<n;i++) { cin>>map[i].x; map[i].i=i; } for(i=0;i<n;i++) { qsort(map,n,sizeof(node),cmp); k=map[0].x; map[0].x=0; if(k<=0) break; for(j=1;j<=k;j++) { map[j].x--; if(map[j].x<0) { flag=false; break; } else { visit[map[0].i][map[j].i]=visit[map[j].i][map[0].i]=1; } } if(flag==false) break; } if(flag) { printf("YES/n"); for(i=0;i<n;i++) { for(j=0;j<n;j++) printf("%d ",visit[i][j]); printf("/n"); } } else printf("NO/n"); printf("/n"); } return 0; }
相关文章推荐
- poj 1659 Frogs' Neighborhood(Heal定理)
- POJ:1659 Frogs' Neighborhood (Havel-Hakimi定理)
- POJ1659 Frogs' Neighborhood
- poj1659 Frogs' Neighborhood 根据度数列构造图,havel_hakimi算法
- POJ 1659 Frogs' Neighborhood(度序列组成)
- POJ 1659 Frogs' Neighborhood
- POJ 1659 Frogs' Neighborhood 可图性判断-Havel定理
- POJ:1659Frogs' Neighborhood
- poj 1659 Frogs' Neighborhood 度序列可图化 贪心
- poj 1659 Frogs' Neighborhood
- POJ 1659 Frogs' Neighborhood(Havel方法)
- POJ 1659 Frogs' Neighborhood
- poj 1659 Frogs' Neighborhood(判断序列可图)
- Havel-Hakimi 度序列判断无向图是否可图 Poj 1659 Frogs' Neighborhood
- poj1659 Frogs' Neighborhood
- poj 1659 Frogs' Neighborhood (Havel-Hakimi定理,判断序列是否可图)
- poj Frogs' Neighborhood(1659)
- POJ_1659_Frogs' Neighborhood
- poj 1659 Frogs' Neighborhood
- poj 1659 Frogs' Neighborhood 图论基础 可图性