Codeforces Round #258 (Div. 2) C. Predict Outcome of the Game

C. Predict Outcome of the Game

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are n games in a football tournament. Three teams are participating in it. Currently k games had already been played.

You are an avid football fan, but recently you missed the whole k games. Fortunately, you remember a guess of your friend for these kgames. Your friend did not tell exact number of wins of each team, instead he thought that absolute difference between number of wins of first and second team will be d1 and that of between second and third team will be d2.

You don't want any of team win the tournament, that is each team should have the same number of wins after n games. That's why you want to know: does there exist a valid tournament satisfying the friend's guess such that no team will win this tournament?

Note that outcome of a match can not be a draw, it has to be either win or loss.

Input

The first line of the input contains a single integer corresponding to number of test cases t (1 ≤ t ≤ 105).

Each of the next t lines will contain four space-separated integers n, k, d1, d2 (1 ≤ n ≤ 1012; 0 ≤ k ≤ n; 0 ≤ d1, d2 ≤ k) — data for the current test case.

Output

For each test case, output a single line containing either "yes" if it is possible to have no winner of tournament, or "no" otherwise (without quotes).

Sample test(s)

input

5
3 0 0 0
3 3 0 0
6 4 1 0
6 3 3 0
3 3 3 2

output

yes
yes
yes
no
no

Note

Sample 1. There has not been any match up to now (k = 0, d1 = 0, d2 = 0). If there will be three matches (1-2, 2-3, 3-1) and each team wins once, then at the end each team will have 1 win.

Sample 2. You missed all the games (k = 3). As d1 = 0 and d2 = 0, and there is a way to play three games with no winner of tournament (described in the previous sample), the answer is "yes".

Sample 3. You missed 4 matches, and d1 = 1, d2 = 0. These four matches can be: 1-2 (win 2), 1-3 (win 3), 1-2 (win 1), 1-3 (win 1). Currently the first team has 2 wins, the second team has 1 win, the third team has 1 win. Two remaining matches can be: 1-2 (win 2), 1-3 (win 3). In the end all the teams have equal number of wins (2 wins).

题意：3个人n次比赛，已经比了k次了，三个人赢得次数分别为h1,h2,h3，abs(h1-h2)=d1,abs(h2-h3)=d2，问是否可以使得三个人赢得次数一样多

思路：直接分情况讨论：1.h1>h2,h2>h3   2.h1>h2,h2<=h3  3. h1<=h2,h2>h3  4.h1<=h2,h2<=h3，然后就可以列式子了，判断一下就好了

ac代码：

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<set>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 1010000
#define LL long long
#define ll __int64
#define INF 0xfffffff
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
#define eps 1e-8
using namespace std;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll powmod(ll a,ll b,ll MOD){ll ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
//head
ll n,k,d1,d2;
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%I64d%I64d%I64d%I64d",&n,&k,&d1,&d2);
		if(n%3)
		{
			printf("no\n");
			continue;
		}
		ll num=n/3;
		ll bz=0;
		ll h1,h2,h3;
		h1=(k-d1+d2)/3+d1;
		h2=(k-d1+d2)/3;
		h3=(k-d1+d2)/3-d2;
		//printf("h1=%d h2=%d h3=%d\n",h1,h2,h3);
		if(h1+h2+h3==k)
		{
			if(h1<=num&&h2<=num&&h3<=num&&h1>=0&&h2>=0&&h3>=0)
			{
				bz=1;
				//printf("11111\n");
			}
		}
		h1=(k-d1-d2)/3+d1;
		h2=(k-d1-d2)/3;
		h3=(k-d1-d2)/3+d2;
		//printf("h1=%d h2=%d h3=%d\n",h1,h2,h3);
		if(h1+h2+h3==k)
		{
			if(h1<=num&&h2<=num&&h3<=num&&h1>=0&&h2>=0&&h3>=0)
			{
				bz=1;
				//printf("22222\n");
			}
		}
		h1=(k+d1+d2)/3-d1;
		h2=(k+d1+d2)/3;
		h3=(k+d1+d2)/3-d2;
		//printf("h1=%d h2=%d h3=%d\n",h1,h2,h3);
		if(h1+h2+h3==k)
		{
			if(h1<=num&&h2<=num&&h3<=num&&h1>=0&&h2>=0&&h3>=0)
			{
				bz=1;
				//printf("33333\n");
			}
		}
		h1=(k+d1-d2)/3-d1;
		h2=(k+d1-d2)/3;
		h3=(k+d1-d2)/3+d2;
		//printf("h1=%d h2=%d h3=%d\n",h1,h2,h3);
		if(h1+h2+h3==k)
		{
			if(h1<=num&&h2<=num&&h3<=num&&h1>=0&&h2>=0&&h3>=0)
			{
				bz=1;
				//printf("44444\n");
			}
		}
		if(bz)
		printf("yes\n");
		else
		printf("no\n");
	}
	return 0;
}