hdu 5724 Chess(sg博弈）

Chess

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2395    Accepted Submission(s): 1012

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
  
  

 

题意：n*20的棋格，每一行放若干个棋子，每个棋子每次只能走一个（若碰到相邻的棋子便跳过），问胜负；

思路：典型的sg博弈，将一行的棋子的必胜态和必输态都列出来，最后异或一下就好。

一些小问题：1.每一行·只有20格，这种很容易想到状压（碰到小于等于20的都应该往状压的方面想一下）。
                         2.memset的用时还是挺大的，当用在循环里时容易超时。


代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn=1<<21;
int num[maxn],sg[maxn];
int  ha[21];
int make_sg(int stat)
{
    memset(ha,-1,sizeof(ha));
    for(int i=20; i>=0; i--)
        if(stat&(1<<i))
        {
            for(int j=i-1; j>=0; j--)
                if(!(stat&(1<<j)))
                {
                    int kk=stat^(1<<i)^(1<<j);
                    ha[sg[kk]]=1;
                    break;
                }
        }
    for(int i=0; i<=20; i++)
        if(ha[i]==-1)
            return i;
    return 0;
}
int main()
{
    int T;
    scanf("%d",&T);
    memset(sg,0,sizeof(sg));
    for(int i=0; i<(1<<20); i++)
        sg[i]=make_sg(i);
    while(T--)
    {
        int n;
        scanf("%d",&n);
        int ans=0;
        for(int i=0; i<n; i++)
        {
            int m;
            scanf("%d",&m);
            int state=0,a;
            for(int i=0; i<m; i++)
            {
                scanf("%d",&a);
                state|=(1<<(20-a));
            }
            ans^=sg[state];
        }
        if(ans)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}