hdu5873 Football Games(数学)

本文介绍了一种用于验证足球锦标赛中各队伍得分真实性的算法。该算法基于队伍得分的累积和,通过比较特定条件下的得分总和来判断得分是否合理。适用于锦标赛第一阶段的单循环赛制。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

思路:这里是有一个定理的,当s1+s2+....si >= i(i-1) (1<=i<=n-1) && s1+s2...+sn = n*(n-1)都成立的时候那么就是符合的了


#include<bits/stdc++.h>
using namespace std;
const int maxn = 20000+6;
int n,a[maxn];
int main()
{
	int T;
    while(scanf("%d",&T)!=EOF)
	{
		while(T--)
		{
			int res = 0;
			scanf("%d",&n);
			for(int i = 1;i<=n;i++)
				scanf("%d",&a[i]),res+=a[i];
			sort(a+1,a+1+n);
			int sum = 0;
			int flag = 0;
			for(int i = 1;i<=n;i++)
			{
				sum+=a[i];
				if(sum<i*(i-1))
				{
					flag=1;
					break;
				}
			}
            if(res!=n*(n-1))
				flag=1;
			if(flag)
				printf("F\n");
			else
				printf("T\n");
		}
	}
}


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
 

Source


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值