2016 ACM/ICPC Asia Regional Dalian Online Football Games
2016-09-11 10:40
393 查看
Football Games
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 5055 Accepted Submission(s): 904
At the first phase of the championships, teams are divided into M groups using the single round robin rule where one and only one game will be played between each pair of teams within each group. The winner of a game scores 2 points, the loser scores 0, when the game is tied both score 1 point. The schedule of these games are unknown, only the scores of each team in each group are available.
When those games finished, some insider revealed that there were some false scores in some groups. This has aroused great concern among the pubic, so the the Association of Credit Management (ACM) asks you to judge which groups' scores must be false.
Input Multiple test cases, process till end of the input.
For each case, the first line contains a positive integers M , which is the number of groups.
The i -th of the next M lines begins with a positive integer Bi representing the number of teams in the i -th group, followed by Bi nonnegative integers representing the score of each team in this group.
number of test cases <= 10
M<= 100
B[i]<= 20000
score of each team <= 20000
Output For each test case, output M lines. Output ``F" (without quotes) if the scores in the i-th group must be false, output ``T" (without quotes) otherwise. See samples for detail.
Sample Input 2 3 0 5 1 2 1 1
Sample Output F T
/* 两个队踢足球,赢了2分输了0分平了各1分。 给出你最后每个队的得分,问是否合法 瞎搞过的,总得分为场次的2倍,并且得分奇数的个数一定是成对的 */ #include<iostream> #include<stdio.h> #include<string.h> #include<string> #include<algorithm> #include<vector> #include<map> #define N 100010 #define MAXN 100010 using namespace std; int main() { //freopen("C:\\Users\\acer\\Desktop\\in.txt","r",stdin); long long m; long long n,s=0,a; while(scanf("%lld",&m)!=EOF) { while(m--) { s=0; bool f=0; long long ans=0; scanf("%lld",&n); for(int i=0;i<n;i++) { scanf("%lld",&a); if(a<0||a>2*(n-1)||a>(n*n-n)) { f=1; //cout<<a<<" 111"<<endl; } if(a%2) ans++; s+=a; } if(ans%2) f=1; if(s!=n*n-n) { f=1; //cout<<s<<" "<<"222"<<endl; } if(f) puts("F"); else puts("T"); } } return 0; }
相关文章推荐
- 2016 ACM/ICPC Asia Regional Dalian Online Football Games
- 2016 ACM/ICPC Asia Regional Dalian Online Friends and Enemies
- 2016 ACM/ICPC Asia Regional Dalian Online 1006 /HDU 5873
- 2016 ACM/ICPC Asia Regional Dalian Online
- hdu 5875 2016 ACM/ICPC Asia Regional Dalian Online 1008
- HDU 5876 Sparse Graph(bfs求解补图中的单源最短路)——2016 ACM/ICPC Asia Regional Dalian Online
- 树状数组+离散化——HDU 5877 (2016 ACM/ICPC Asia Regional Dalian Online 1010)
- HDU 5874 Friends and Enemies(二分图思想)——2016 ACM/ICPC Asia Regional Dalian Online
- HDU 5873 2016 ACM/ICPC Asia Regional Dalian Online 1006 Football Games
- HDU 5873 Football Games 【模拟】 (2016 ACM/ICPC Asia Regional Dalian Online)
- hdu 5876 Sparse Graph(补图最短路) 2016 ACM/ICPC Asia Regional Dalian Online 1009
- HDU 5873 Football Games 【模拟】 (2016 ACM/ICPC Asia Regional Dalian Online)
- HDU 5877 Weak Pair(离散化+dfs+树状数组)——2016 ACM/ICPC Asia Regional Dalian Online
- 【题解】 2016 ACM/ICPC Asia Regional Dalian Online (2+5)
- HDU 5874 2016 ACM/ICPC Asia Regional Dalian Online 1007 Friends and Enemies
- 2016 ACM/ICPC Asia Regional Dalian Online 1010 Weak Pair 离散化+树状数组
- HDU 5876 2016 ACM/ICPC Asia Regional Dalian Online BFS+set
- 2016 ACM/ICPC Asia Regional Dalian Online
- HDU 5877 2016 ACM/ICPC Asia Regional Dalian Online 1010 Weak Pair
- 补图+BFS( 邻接链表 )——HDU 5876 ( 2016 ACM/ICPC Asia Regional Dalian Online 1009 )