http://acm.split.hdu.edu.cn/showproblem.php?pid=5873
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.
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
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
typedef long long LL;
const int INF=0x7ffffff;
const int M=2e4+1;
int flag[M];
int num[M];
int i,j,k,n,m;
int main()
{
int M;
while(~scanf("%d",&M))
{
while(M--){
int n;
MS(flag,0);
scanf("%d",&n);
int sum=0;
int sum1=0;
rep(i,0,n){
scanf("%d",&flag[i]);
if(flag[i]==0)sum1++;
sum+=flag[i];
}
if(sum!=n*(n-1)||sum1>1){printf("F\n");continue;}
if(n==2){printf("T\n");continue;}
int mark=1;
sort(flag,flag+n);
int k=1;
int ans=0;
if(flag[n-1]>2*(n-1))mark=0;
if(mark)printf("T\n");
else printf("F\n");
}
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
int a[1000000];
int main()
{
int t;
while(~scanf("%d",&t))
{
while(t--)
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
int flag=1;
int sum=0;
int he=2*(n-1);
sort(a+1,a+1+n);
reverse(a+1,a+1+n);
for(int i=1;i<=n;i++)
{
sum+=(he-a[i]);
if(sum<0)
{
flag=0;
break;
}
he-=2;
}
if(sum==0&&flag)
printf("T\n");
else
printf("F\n");
}
}
}
ps