HDU6152-Friend-Graph
来源:互联网 发布:淘宝上回收手机可靠吗 编辑:程序博客网 时间:2024/06/03 19:42
Friend-Graph
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1093 Accepted Submission(s): 569
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!
Source
2017中国大学生程序设计竞赛 - 网络选拔赛
解题思路:其实大于等于6个人的团队必然不是一个好团队,那么小于6个人的团队暴力跑即可,所有总体跑大暴力也是可以过得,只是数据要用bool来记录
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int n, a, x[10][10];int main(){ int t; scanf("%d", &t); while (t--) { scanf("%d", &n); if (n >= 6) { for (int i = 1; i < n; i++) for (int j = i + 1; j <= n; j++) scanf("%d", &a); printf("Bad Team!\n"); continue; } memset(x, 0, sizeof x); for (int i = 1; i < n; i++) { x[i][i] = 0; for (int j = i + 1; j <= n; j++) scanf("%d", &a), x[i][j] = x[j][i] = a; } int flag = 1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (i == j) continue; for (int k = 1; k <= n; k++) { if (k == i || k == j) continue; if ((x[i][j] && x[i][k] && x[j][k]) || (!x[i][j] && !x[i][k] && !x[j][k])) flag = 0; } } } if (flag) printf("Great Team!\n"); else printf("Bad Team!\n"); } return 0;}
阅读全文
0 0
- HDU6152 Friend-Graph【模拟】
- hdu6152 Friend-Graph
- HDU6152-Friend-Graph
- HDU6152 Friend-Graph(拉姆齐定理)
- hdu6152(拉姆齐(Ramsey)定理) Friend-Graph
- HDU6152 Friend-Graph 数学|签到|Ramsey定理
- hdu6152 Friend-Graph CCPC网赛1003 Ramsey定理
- hdu6152-CCPC网络赛&思维&拉姆齐定理-Friend-Graph
- HDU6152 Friend-Graph(拉姆齐定理,2017中国大学生程序设计竞赛
- hdu6152 Friend-Graph (2017 ccpc 网络赛 (暴力 + 一个神奇的定理)
- Friend-Graph
- Friend-Graph
- Friend-Graph
- Friend-Graph
- Friend-Graph
- Friend-Graph
- hdu6152
- HDU_6152 Friend-Graph 【暴力】
- HashMap
- 决策树的算法的使用
- Android使用Http访问并解析服务器XML数据
- C学习笔记20170820
- Python网络数据采集——BeautifulSoup
- HDU6152-Friend-Graph
- c++类的简单实现
- Codeforces 780G Andryusha and Nervous Barriers
- 编程之美
- es6
- 网络爬虫浅析
- Tesseract-OCR 从编译到集成
- HDU 6153 A Secret(扩展kmp模板题)
- JEESZ RestFul服务介绍