Havel定理—Frogs’ Neighborhood

#include<stdio.h>#include<iostream>#include<algorithm>#include<cstring>using namespace std;struct node{int degree;int position;};bool cmp(node a,node b){if(a.degree>b.degree)return true;elsereturn false; }node d[11];int m[11][11];int main(){int i,n,t,j,temp;scanf("%d",&t);while(t--){memset(m,0,sizeof(m));scanf("%d",&n);for(i=0;i<n;i++){scanf("%d",&temp);d[i].degree=temp;d[i].position=i;}sort(d,d+n,cmp);bool flag=true;for(i=0;i<n;i++){sort(d,d+n,cmp);if(d[0].degree==0)break;for(j=1;j<n;j++){d[j].degree--;if(d[j].degree<0){flag=false;break;}m[d[0].position][d[j].position]=m[d[j].position][d[0].position]=1;d[0].degree--;if(d[0].degree==0)break;}if(flag==false)break;}if(flag==false)printf("NO\n");else{printf("YES\n");for(i=0;i<n;i++){printf("%d",m[i][0]);for(j=1;j<n;j++)printf(" %d",m[i][j]);printf("\n");}}printf("\n");}return 0;}