Codeforces 768E Game of Stones 博弈
2017-08-03 21:34
302 查看
E. Game of Stones
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Sam has been teaching Jon the Game of Stones to sharpen his mind and help him devise a strategy to fight the white walkers. The rules of this game are quite simple:
The game starts with n piles of stones indexed from 1 to n.
The i-th pile contains si stones.
The players make their moves alternatively. A move is considered as removal of some number of stones from a pile. Removal of 0 stones does not
count as a move.
The player who is unable to make a move loses.
Now Jon believes that he is ready for battle, but Sam does not think so. To prove his argument, Sam suggested that they play a modified version of the game.
In this modified version, no move can be made more than once on a pile. For example, if 4 stones are removed from a pile, 4 stones
cannot be removed from that pile again.
Sam sets up the game and makes the first move. Jon believes that Sam is just trying to prevent him from going to battle. Jon wants to know if he can win if both play optimally.
Input
First line consists of a single integer n (1 ≤ n ≤ 106)
— the number of piles.
Each of next n lines contains an integer si (1 ≤ si ≤ 60)
— the number of stones in i-th pile.
Output
Print a single line containing "YES" (without quotes) if Jon wins, otherwise print "NO"
(without quotes)
Examples
input
output
input
output
Note
In the first case, Sam removes all the stones and Jon loses.
In second case, the following moves are possible by Sam:
![](http://codeforces.com/predownloaded/bd/c9/bdc96d549fa2f4c9b729f8387564021e6b94744c.png)
In each of these cases, last move can be made by Jon to win the game as follows:
![](http://codeforces.com/predownloaded/86/c0/86c065ddb4214f40f1ac2daaa173d807ad092ab6.png)
博弈,直接手算找到规律,sg函数为:1,1,2,2,2,3,3,3,3......
接下来,不用再讲了。
#include <cstdio>
#include <iostream>
#include <string.h>
#include <string>
#include <map>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <bitset>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
#define N 60
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn=1000005,inf=0x3f3f3f3f;
const ll llinf=0x3f3f3f3f3f3f3f3f;
const ld pi=acos(-1.0L);
int sg[maxn];
int main() {
int n,x,ans,i,j,last=1;
ans=0;
for (i=1;i<=N;i++) {
for (j=last;j<=last+i;j++) {
sg[j]=i;
}
last=j;
}
scanf("%d",&n);
for (i=1;i<=n;i++) {
scanf("%d",&x);
ans=ans^sg[x];
}
if (ans) printf("NO"); else printf("YES");
return 0;
}
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Sam has been teaching Jon the Game of Stones to sharpen his mind and help him devise a strategy to fight the white walkers. The rules of this game are quite simple:
The game starts with n piles of stones indexed from 1 to n.
The i-th pile contains si stones.
The players make their moves alternatively. A move is considered as removal of some number of stones from a pile. Removal of 0 stones does not
count as a move.
The player who is unable to make a move loses.
Now Jon believes that he is ready for battle, but Sam does not think so. To prove his argument, Sam suggested that they play a modified version of the game.
In this modified version, no move can be made more than once on a pile. For example, if 4 stones are removed from a pile, 4 stones
cannot be removed from that pile again.
Sam sets up the game and makes the first move. Jon believes that Sam is just trying to prevent him from going to battle. Jon wants to know if he can win if both play optimally.
Input
First line consists of a single integer n (1 ≤ n ≤ 106)
— the number of piles.
Each of next n lines contains an integer si (1 ≤ si ≤ 60)
— the number of stones in i-th pile.
Output
Print a single line containing "YES" (without quotes) if Jon wins, otherwise print "NO"
(without quotes)
Examples
input
1 5
output
NO
input
2 1 2
output
YES
Note
In the first case, Sam removes all the stones and Jon loses.
In second case, the following moves are possible by Sam:
![](http://codeforces.com/predownloaded/bd/c9/bdc96d549fa2f4c9b729f8387564021e6b94744c.png)
In each of these cases, last move can be made by Jon to win the game as follows:
![](http://codeforces.com/predownloaded/86/c0/86c065ddb4214f40f1ac2daaa173d807ad092ab6.png)
博弈,直接手算找到规律,sg函数为:1,1,2,2,2,3,3,3,3......
接下来,不用再讲了。
#include <cstdio>
#include <iostream>
#include <string.h>
#include <string>
#include <map>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <bitset>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
#define N 60
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn=1000005,inf=0x3f3f3f3f;
const ll llinf=0x3f3f3f3f3f3f3f3f;
const ld pi=acos(-1.0L);
int sg[maxn];
int main() {
int n,x,ans,i,j,last=1;
ans=0;
for (i=1;i<=N;i++) {
for (j=last;j<=last+i;j++) {
sg[j]=i;
}
last=j;
}
scanf("%d",&n);
for (i=1;i<=n;i++) {
scanf("%d",&x);
ans=ans^sg[x];
}
if (ans) printf("NO"); else printf("YES");
return 0;
}
相关文章推荐
- Codeforces 768E Game of Stones 博弈SG(打表)
- Codeforces 768E Game of Stones
- codeforces 768 E Game of Stones(博弈)
- codeforces 768E Game of Stones
- codeforces 399 E. Game of Stones 博弈 思维题
- Codeforces 768 E. Game of Stones 博弈DP
- codeforces 768E Game of Stones
- CodeForces 768E Game of Stones 打表找规律
- Codeforces Round #399 E Game of Stones 博弈
- HDU 5953 Game of Taking Stones(威佐夫博弈+高精度+二分)——The 2016 ACM-ICPC Asia Dalian Regional Contest
- Codeforces 69D Dot (博弈)
- Yet Another Game of Stones ZOJ - 3964 (博弈)
- Codeforces 266A Stones on the Table
- ZOJ 3964 Yet Another Game of Stones (博弈)
- Codeforces Round #399 E Game of Stones 博弈
- codeforces 266A(Stones on the Table) Java
- Codeforces_841_B Godsend(思路|简单博弈)
- 【CodeForces】Plate Game(博弈)
- codeforces 595C Warrior and Archer(博弈)
- CodeForces 266A Stones on the Table