CodeForces 451C Predict Outcome of the Game
2015-08-30 20:23
239 查看
Predict Outcome of the Game
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status Practice CodeForces 451C
Description
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 Input
Input
Output
Hint
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).
View Code
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status Practice CodeForces 451C
Description
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 Input
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
Hint
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).
#include <stdio.h> #include <string.h> #include <algorithm> using namespace std; int main() { int T; long long n,k,d1,d2; long long i,j; scanf("%d",&T); while(T--) { scanf("%I64d %I64d %I64d %I64d",&n,&k,&d1,&d2); long long x,y,z,c,v,ma; int flg=0; v=k-d1-2*d2; if(v>=0 && v%3==0 && flg==0) { x=v/3+d1+d2,y=v/3+d2,z=v/3; if((n-k-(x-y+x-z))>=0 && (n-k-(x-y+x-z))%3==0) flg=1; //if(flg==1) //printf("%d\n",1); } v=k-d1+2*d2; if(v>=0 && v%3==0 && flg==0) { x=v/3+d1-d2,y=v/3-d2,z=v/3; if(x>=0 && y>=0 && z>=0) { ma=max(x,y); ma=max(ma,z); if((n-k-(ma-x+ma-y+ma-z))>=0 && (n-k-(ma-x+ma-y+ma-z))%3==0) flg=1; } //if(flg==1) //printf("%d\n",2); } v=k+d1-2*d2; if(v>=0 && v%3==0 && flg==0) { x=v/3-d1+d2,y=v/3+d2,z=v/3; if(x>=0 && y>=0 && z>=0) { ma=max(x,y); ma=max(ma,z); if((n-k-(ma-x+ma-y+ma-z))>=0 && (n-k-(ma-x+ma-y+ma-z))%3==0) flg=1; } //if(flg==1) //printf("%d\n",3); } v=k+d1+2*d2; if(v>=0 && v%3==0 && flg==0) { x=v/3-d1-d2,y=v/3-d2,z=v/3; if(x>=0 && y>=0 && z>=0) { ma=max(x,y); ma=max(ma,z); if((n-k-(ma-x+ma-y+ma-z))>=0 && (n-k-(ma-x+ma-y+ma-z))%3==0) flg=1; } //if(flg==1) //printf("%d\n",4); } if(flg==1) printf("yes\n"); else printf("no\n"); } }
View Code
相关文章推荐
- Linux计划任务
- BackboneJs入门学习[05]—Sync
- Linux计划任务
- 面试技巧
- 人际关系——诚信定位
- static详解
- 第6周工作周报
- CodeForces 567C Geometric Progression
- CodeForces #318 (div1) C.Bear and Drawing
- Python2.7获取QQ空间好友头像
- noj1057
- Android线程的相关使用
- CodeForces 527B Error Correct System
- CodeForces 552C Vanya and Scales
- HDU1162-Eddy's picture-最小生成树(prim算法模板)
- 项目开发计划——机房收费系统
- 哈夫曼树 C语言实现 原创下改正
- CodeForces 471C MUH and House of Cards
- 关于数组的实验
- 新的班级,新的生活