Frogs' Neighborhood

http://poj.org/problem?id=1659

#include <cstdio>#include <cstring>#include <cstdlib>#include <string>#include <map>#include <iostream>#include <stdexcept>#include <cstddef>#include <algorithm>#include <vector>#include <numeric>#include <cctype>#define LL long long#define Endl endl#define INF 0x7fffffff//#define WJusing namespace std;const int maxn=15;int edge[maxn][maxn];struct vertex{int degree;int index;}v[maxn];bool cmp(const vertex& a,const vertex& b){return b.degree<a.degree;}int main(int argc, char *argv[]){#ifdef WJ//freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);#endifint t,n;scanf("%d",&t);while(t--){scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d",&v[i].degree);v[i].index=i;}memset(edge,0,sizeof(edge));int flag=1;for(int k=0;k<n&&flag;k++){sort(v+k,v+n,cmp);int i=v[k].index;int d1=v[k].degree;if(d1>n-k-1){flag=0; break;}for(int r=1;r<=d1&&flag;r++){int j=v[k+r].index;if(v[k+r].degree<=0) flag=0;v[k+r].degree--;edge[i][j]=edge[j][i]=1;}}if(flag){printf("YES\n");for(int p=0;p<n;p++){for(int q=0;q<n;q++){if(q) printf(" ");printf("%d",edge[p][q]);}printf("\n");}}else printf("NO\n");if(t) printf("\n");}return 0;}