hdu5724 Chess（博弈）

思路：对位运算不太熟..显然这里是一个组合游戏，只需要将一行的情况用sg函数求出来，那么组合就是随便异或了，由于一行只有20个位置，所以考虑用状态压缩一下，将所有可行的后续状态枚举出来即可

#include<bits/stdc++.h>
using namespace std;
int n,m,sg[1<<21],vis[21];
int dfs(int x)
{
	 memset(vis,0,sizeof(vis));
     for(int i = 20;i>=0;i--)
	 {
		 if(x & (1<<i))
		 {
			 int temp = x;
			 for(int j = i-1;j>=0;j--)
			 {
				 if(!(x&(1<<j)))
				 {
					 temp ^= (1<<j)^(1<<i);
					 vis[sg[temp]]=1;
					 break;
				 }
			 }
		 }
	 }
	 for(int i = 0;i<=20;i++)
		 if(!vis[i])
			 return i;
	 return 0;
}
int main()
{
     memset(sg,0,sizeof(sg));
	 for(int i = 0;i<(1<<20);i++)
		 sg[i]=dfs(i);
	 int T;
	 scanf("%d",&T);
	 while(T--)
	 {
		 int n;
		 scanf("%d",&n);
		 int ans = 0;
		 for(int i = 0;i<n;i++)
		 {
			 int res = 0,temp;
			 int q;
			 scanf("%d",&q);
			 while(q--)
                scanf("%d",&temp),res|=1<<(20-temp);
			 ans^=sg[res];
		 }
	     if(ans)
			 printf("YES\n");
		 else
			 printf("NO\n");
	 }

}

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 integer  T(T≤100) , indicates the number of test cases.

For each test case, the first line contains a single integer  n(n≤1000) , the number of lines of chessboard.

Then  n  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.

Output

For each test case, output one line of “YES” if Alice can win the game, “NO” otherwise.

Sample Input

2
1
2 19 20
2
1 19
1 18

Sample Output

NO
YES

Author

HIT

Source

2016 Multi-University Training Contest 1