hdu-Friend-Graph
来源:互联网 发布:算法精解 epub 编辑:程序博客网 时间:2024/06/01 09:12
Friend-Graph
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6514 Accepted Submission(s): 1610
Problem Description
It is well known that small groups are not conducive of the development of a team. Therefore, there shouldn’t be any small groups in a good team.
In a team with n members,if there are three or more members are not friends with each other or there are three or more members who are friends with each other. The team meeting the above conditions can be called a bad team.Otherwise,the team is a good team.
A company is going to make an assessment of each team in this company. We have known the team with n members and all the friend relationship among these n individuals. Please judge whether it is a good team.
In a team with n members,if there are three or more members are not friends with each other or there are three or more members who are friends with each other. The team meeting the above conditions can be called a bad team.Otherwise,the team is a good team.
A company is going to make an assessment of each team in this company. We have known the team with n members and all the friend relationship among these n individuals. Please judge whether it is a good team.
Input
The first line of the input gives the number of test cases T; T test cases follow.(T<=15)
The first line od each case should contain one integers n, representing the number of people of the team.(n≤3000 )
Then there are n-1 rows. Thei th row should contain n-i numbers, in which number aij represents the relationship between member i and member j+i. 0 means these two individuals are not friends. 1 means these two individuals are friends.
The first line od each case should contain one integers n, representing the number of people of the team.(
Then there are n-1 rows. The
Output
Please output ”Great Team!” if this team is a good team, otherwise please output “Bad Team!”.
Sample Input
141 1 00 01
Sample Output
Great Team!#include<cstdio>#include<cstring>int a[1500][3000],b[3010],c[3010];int main(){ int t,n,i,j,k,p,r; scanf("%d",&t); while(t--){ scanf("%d",&n);memset(a,0,sizeof(a)); for(i=1;i<=n;i++){ for(j=i+1;j<=n;j++){ if(i<1500)scanf("%d",&a[i][j]); else scanf("%d",&a[3000-i][3000-j]); } } int flag=0,x,y; if(n<=2){ printf("Great Team!\n");continue; } if(n==3)if(a[1][2]&&a[1][3]&&a[2][3]){ printf("Great Team!\n");continue; } for(i=1;i<n;i++){ k=0;p=0; if(i<1500) for(j=i+1;j<=n;j++){ if(a[i][j])b[k++]=j;else c[p++]=j; } else for(j=i+1;j<=n;j++){ if(a[3000-i][3000-j])b[k++]=j;else c[p++]=j; } for(j=0;j<k;j++){ for(r=j+1;r<k;r++){ if(b[j]<1500)x=b[j],y=b[r]; else x=3000-b[j],y=3000-b[r]; if(a[x][y]){flag++;break;} } if(flag)break; } if(flag)break; for(j=0;j<p;j++){ for(r=j+1;r<p;r++){ if(b[j]<1500)x=c[j],y=c[r]; else x=3000-c[j],y=3000-c[r]; if(a[x][y]==0){flag++;break;} } if(flag)break; } if(flag)break; } if(flag)printf("Bad Team!\n"); else printf("Great Team!\n"); }}
阅读全文
0 0
- HDU 6152 Friend-Graph
- HDU 6152 Friend-Graph
- hdu-6152 Friend-Graph
- HDU 6152 Friend-Graph
- HDU 6152 Friend-Graph
- hdu 6152 Friend-Graph
- Friend-Graph HDU
- hdu-Friend-Graph
- HDU-6152Friend-Graph
- HDU 6152 Friend-Graph
- HDU Friend-Graph(离散数学)
- Hdu 6152 Friend-Graph【暴力】
- Friend-Graph(HDU 3152)
- HDU 6152-Friend-Graph(ccpc)
- HDU Friend-Graph【暴力】【卡内存】【水题】
- HDU 6152 Friend-Graph(定理)
- Hdu 6152 Friend-Graph(Ramsey定理)
- HDU 6152 Friend-Graph (最大团)
- Android数据解析之XML数据解析
- HTML5 实现全屏效果
- 微信自定义分享
- [NOIP模拟赛]字母选择问题
- CVPR精彩论文解读:对当下主流CNN物体检测器的对比评测
- hdu-Friend-Graph
- 【程序人生】计算机界巾帼英雄简史
- java.lang.NoSuchFieldError: No field title of type I
- 打印html时设置去掉页眉页脚 简单一行代码搞定(记录一下)
- React Native实现图片文本混合显示
- 《七大排序算法》(五)之堆排序(Java实现)
- mysql5.7.18安装问题总结
- Android Studio中进行单元测试
- 中国国家创新指数升至世界第17位