2017中国大学生程序设计竞赛
来源:互联网 发布:潮汕话输入法软件 编辑:程序博客网 时间:2024/06/01 20:26
点击打开链接
Friend-Graph
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3254 Accepted Submission(s): 523
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!
注意这不是并查集,没有传递性。
ac的代码
#include<cstdio>#include<iostream>#include<cstring>using namespace std;int main(){ int t,n,a[3005],b[3005]; scanf("%d",&t); int i,j,x,k; while(t--) { scanf("%d",&n); memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for(i=1; i<=n-1; i++) { k=1; for(j=1; j<=n-i; j++) { scanf("%d",&x); if(x==1) { a[i]++; a[i+k]++; } else { b[i]++; b[i+k]++; } k++; } } bool flag=false; for(i=1; i<=n; i++) { if(a[i]>=3||b[i]>=3) { flag=true; break; } } if(flag) printf("Bad Team!\n"); else printf("Great Team!\n"); } return 0;}
阅读全文
0 0
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 2017中国大学生程序设计竞赛
- 【HDU6150 2017中国大学生程序设计竞赛
- 【HDU6152 2017中国大学生程序设计竞赛
- 【HDU6153 2017中国大学生程序设计竞赛
- 关注民生民情
- 传智java完整教学视频
- Android多窗口模式下Activity生命周期详解
- 敌兵布阵 树状数组模板
- zzuli 2181 GJJ的日常之暴富梦 (思维,水题)
- 2017中国大学生程序设计竞赛
- 2048小游戏
- Android启动过程
- 【Java多线程与并发库】06 多个线程之间共享数据的方式探讨
- 每天编程一点点,代码提升大一点(致敬Java之父)
- windows系统中向python中插入numpy和scipy包
- git (5) -- git commit --amend问题
- Mongodb(一)
- HDU 6153 A Secret