Codeforces Round #258 (Div. 2/C)/Codeforces451C_Predict Outcome of the Game (enumeration ),

Codeforces Round #258 (Div. 2/C)/Codeforces451C_Predict Outcome of the Game (enumeration ),

Solution report

Http://blog.csdn.net/juncoder/article/details/38102391

Question:

Among the n games, k won't be seen. For these k games, the relationship between the winning matches of a, B, and c is the absolute difference between a and B, the absolute value of Team B and Team c is d2, and you need to determine whether the three teams can win the same game.

Ideas:

| B-A | = d1

| C-B | = d2

A + B + C = k

In this way, there are four situations:

B> A & C <B

B> A & C> B

B <A & C <B

B <A & C> B

Calculate the number of victories that the, B, and c teams won in each of the k matches, and add the three teams to the n-k matches to see if they can be the same.

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#define LL long longusing namespace std;int main(){    int t,i,j;    while(~scanf("%d",&t))    {        while(t--)        {            LL d1,d2,n,k,a,b,c;            scanf("%lld%lld%lld%lld",&n,&k,&d1,&d2);            int f=0;            LL kk=n/3;            //1            double fa=(double)((k+d2)-2*d1)/3;            if(fa>=0&&fa==(LL )fa)            {                a=(LL)fa;                b=d1+a;                c=b-d2;                if(a>=0&&b>=0&&c>=0&&b<=kk&&c<=kk&&a<=kk&&(kk-b+kk-a+kk-c)==(n-k))                {                    f=1;                }            }            //2            fa=(double)((k-d2)-2*d1)/3;            if(fa>=0&&fa==(LL )fa)            {                a=(LL)fa;                b=d1+a;                c=b+d2;                if(a>=0&&b>=0&&c>=0&&b<=kk&&c<=kk&&a<=kk&&(kk-b+kk-a+kk-c)==(n-k))                {                    f=1;                }            }            //3            fa=(double)((k+d2)+2*d1)/3;            if(fa>=0&&fa==(LL )fa)            {                a=(LL )fa;                b=a-d1;                c=b-d2;                if(a>=0&&b>=0&&c>=0&&b<=kk&&c<=kk&&a<=kk&&(kk-b+kk-a+kk-c)==(n-k))                {                    f=1;                }            }            //4            fa=(double)((k-d2)+2*d1)/3;            if(fa>=0&&fa==(LL )fa)            {                a=(LL)fa;                b=a-d1;                c=b+d2;                if(a>=0&&b>=0&&c>=0&&b<=kk&&c<=kk&&a<=kk&&(kk-b+kk-a+kk-c)==(n-k))                {                    f=1;                }            }            if(f==1)                printf("yes\n");            else printf("no\n");        }    }    return 0;}

Predict Outcome of the Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

There areNGames in a football tournament. Three teams are participating in it. CurrentlyKGames had already been played.

You are an avid football fan, but recently you missed the wholeKGames. Fortunately, you remember a guess of your friend for theseKGames. 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 beD1 and that of between second and third team will beD2.

You don't want any of team win the tournament, that is each team shoshould have the same number of wins afterNGames. 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 casesT(1 digit ≤ DigitTLimit ≤ limit 105 ).

Each of the nextTLines will contain four space-separated integersN, Bytes,K, Bytes,D1, bytes,D2 (1 digit ≤ DigitNMemory ≤ memory 1012; 0 memory ≤ memoryKLimit ≤ limitN; 0 bytes ≤ bytesD1, bytes,D2 bytes ≤ bytesK)-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

53 0 0 03 3 0 06 4 1 06 3 3 03 3 3 2

Output

yesyesyesnono

Note

Sample 1. There has not been any match up to now (KBytes = bytes 0, bytes,D1 rows = average 0, average,D2 bytes = bytes 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 (KCapacity = capacity 3).D1 between = between 0 andD2 rows = defaults 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, andD1 rows = Second 1, second,D2 bytes = bytes 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 ).