HDU-5724 Chess(Nim)
来源:互联网 发布:电信cdma是什么网络 编辑:程序博客网 时间:2024/05/16 07:04
原题链接
Chess
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 896 Accepted Submission(s): 382
Problem Description
Alice and Bob are playing a special chess game on an n × 20 chessboard. There are several chesses on the chessboard. They can move one chess in one turn. If there are no other chesses on the right adjacent block of the moved chess, move the chess to its right adjacent block. Otherwise, skip over these chesses and move to the right adjacent block of them. Two chesses can’t be placed at one block and no chess can be placed out of the chessboard. When someone can’t move any chess during his/her turn, he/she will lose the game. Alice always take the first turn. Both Alice and Bob will play the game with the best strategy. Alice wants to know if she can win the game.
Input
Multiple test cases.
The first line contains an integerT(T≤100) , indicates the number of test cases.
For each test case, the first line contains a single integern(n≤1000) , the number of lines of chessboard.
Thenn lines, the first integer of ith line is m(m≤20) , indicates the number of chesses on the ith line of the chessboard. Then m integers pj(1≤pj≤20) followed, the position of each chess.
The first line contains an integer
For each test case, the first line contains a single integer
Then
Output
For each test case, output one line of “YES” if Alice can win the game, “NO” otherwise.
Sample Input
212 19 2021 191 18
Sample Output
NOYES
算出每一行的SG值,在进行异或即可
#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <vector>#include <map>#define maxn 20#define INF 1000000000using namespace std;typedef long long ll;int h[25], sg[2000000];int main(){//freopen("in.txt", "r", stdin);sg[0] = sg[1] = 0;for(int i = 2; i < (1<<20); i++){int pre = -1;memset(h, 0, sizeof(h));for(int j = 0; j < 20; j++){if(i & (1<<j)){if(pre == -1) continue;int p = i - (1<<j) + (1<<pre);h[sg[p]] = 1;}else pre = j;}for(int k = 0;; k++){if(h[k] == 0){ sg[i] = k; break; }}}int t;scanf("%d", &t);while(t--){int n;int m, s ,a, ans = 0;scanf("%d", &n);while(n--){scanf("%d", &m);s = 0;while(m--){scanf("%d", &a);s += (1<<(20-a));}ans ^= sg[s];}if(ans == 0) puts("NO");else puts("YES"); }return 0;}
0 0
- HDU-5724 Chess(Nim)
- HDU 5724 Chess(SG函数 Nim博弈)
- HDU 5724 Chess
- 多校&&HDU.5724 Chess
- HDU 5724 Chess (博弈)
- HDU 5724 Chess
- 【HDU】5724 Chess
- hdu 5724chess 博弈
- HDU 5724 Chess
- HDU 5724 - Chess
- hdu 5724 - chess (sg函数)
- HDU 5724 Chess(博弈论)
- hdu 5724 Chess(sg函数)
- hdu 5724 Chess SG函数
- HDU 5724 Chess (状压+sg)
- Chess HDU
- Chess HDU
- Chess HDU
- logging模块
- boost 时间与日期处理
- 野指针的定义和避免
- Facebook rebound库编译之后,安装时出现的bug
- POJ2828 Buy Tickets(线段树)
- HDU-5724 Chess(Nim)
- DataGridView如何快速导出Excel
- 多线程卖火车票的问题
- 关于okhttp和volley
- [HDU 5731] Solid Dominoes Tilings (轮廓线DP+容斥定理)
- [bzoj4443][Scoi2015]小凸玩矩阵(二分答案+二分图最大匹配)
- Android 仿qq侧拉菜单
- 【CF 578D】LCS again
- presentViewController 、pushViewController和presentModalViewController