HDU 5873 - Football Match【2016大连区域赛网络赛1006】

Problem Description
A mysterious country will hold a football world championships---Abnormal Cup, attracting football teams and fans from all around the world. This country is so mysterious that none of the information of the games will be open to the public till the end of all the matches. And finally only the score of each team will be announced.
 
  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

题意：在一场足球比赛中，给出几组队伍的分数，判断是否是合理的，分别输出 T 和 F。

只要满足1.最大的得分不超过 2*(n-1)

2.全部分数的和一定是 n*(n-1)

3.分数为奇数的队伍数一定是偶数个

 

#include <cstdio>

long long sco[200000 + 5];
int main()
{
    int T;
    while (scanf("%d", &T) != EOF)
    {
        while (T--)
        {
            int n;
            scanf("%d", &n);

            int flag = 1;
            long long sum = 0;
            int counts = 0;
            int zero = 0;
            long long all = (long long)n*(n-1);
            for (int i = 0; i < n; ++i)
            {
                scanf("%lld", &sco[i]);
                sum += sco[i];
                if (sco[i] % 2 == 1)
                    counts++;
                if (sco[i] == 0)
                    zero++;
                if (sco[i] > 2*(n-1))
                    flag = 0;
            }
            if (sum != all || zero > 1 || counts % 2 == 1)
                flag = 0;

            if (flag == 1)
                printf("T\n");
            else
                printf("F\n");
        }
    }
    return 0;
}