2017ccpc网赛-1003-Friend-Graph
来源:互联网 发布:mac如何设置手机铃声 编辑:程序博客网 时间:2024/06/07 09:18
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.
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. The ith 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.
Output
Please output ”Great Team!” if this team is a good team, otherwise please output “Bad Team!”.
Sample Input
1
4
1 1 0
0 0
1
Sample Output
Great Team!
哈希过的,官方题解更简单 n>=6时直接是bad 、<6暴力
#include"iostream"#include<vector>using namespace std;int sign[1100][1100];int main(){ int T; int c=977; cin>>T; while(T--) { bool check=false; int num=0; int n; cin>>n; for(int i=1;i<n;i++) { for(int j=i+1;j<=n;j++) { int rel; scanf("%d",&rel); if(rel) num++; sign[i%c][j%c]=rel; sign[j%c][i%c]=rel; } } if(num<=n-3) { cout<<"Bad Team!"<<endl; check=true; } if(check) continue; for(int i=1;i<=n;i++) { for(int j=i+1;j<=n;j++) { for(int k=j+1;k<=n;k++) { if((sign[i%c][j%c]&&sign[i%c][k%c]&&sign[j%c][k%c])||(!sign[i%c][j%c]&&!sign[i%c][k%c]&&!sign[j%c][k%c])) { cout<<"Bad Team!"<<endl; goto end; } } } } cout<<"Great Team!"<<endl; end:; } return 0;}
- 2017ccpc网赛-1003-Friend-Graph
- 2017CCPC网络选拔赛1003Friend-Graph
- 2017CCPC 网络选拔赛 1003 Friend-Graph
- 2017CCPC网络选拔赛 1003-Friend-Graph
- 2017ccpc网络赛 1003Friend-Graph
- ccpc预选赛-1003Friend-Graph
- hdu6152 Friend-Graph CCPC网赛1003 Ramsey定理
- 2017 ccpc 网络赛 Friend-Graph
- ccpc网络赛Friend-Graph
- [ccpc网络赛]Friend-Graph
- CCPC网赛 Friend-Graph(图论+模拟+输入外挂)
- 2017ccpc网络赛——Friend-Graph
- HDU 6152-Friend-Graph(ccpc)
- hdu5152.Friend-Graph(CCPC网络赛)
- hdu 6152 Friend-Graph(ccpc)
- hdu6152 Friend-Graph (2017 ccpc 网络赛 (暴力 + 一个神奇的定理)
- 2017CCPC网络赛 Friend-Graph(暴力、拉姆齐(Ramsey)定理)
- HDU 6152 Friend-Graph(2017CCPC网络选拔赛)【Floyed求传递闭包】
- Java——Java集合Queue
- JDK下载安装以及环境变量配置图文详解【转】
- SVM--深入学习1
- 八皇后问题详细解法
- 读《程序员必读的职业规划书》
- 2017ccpc网赛-1003-Friend-Graph
- QT treeview实现类似tableview的效果
- com.opensymphony.xwork2.interceptor.ParametersInterceptor error(未完成)
- SVN学习(1)—SCM的介绍
- 【快搭】安装JAVA-JDK配置-JDK环境变量
- Karma-jasmine前端测试工具的配置(windows环境下)
- 代理模式
- Mysql更改密码
- 安装Eclipse、tomcat、umlet的过程中遇到的问题及解决措施