HDU1536-S-Nim--Graph Game

S-Nim

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2709    Accepted Submission(s): 1212

Problem Description

Arthur and his sister Caroll have been playing a game called Nim for some time now. Nim is played as follows:


  The starting position has a number of heaps, all containing some, not necessarily equal, number of beads.

  The players take turns chosing a heap and removing a positive number of beads from it.

  The first player not able to make a move, loses.


Arthur and Caroll really enjoyed playing this simple game until they recently learned an easy way to always be able to find the best move:


  Xor the number of beads in the heaps in the current position (i.e. if we have 2, 4 and 7 the xor-sum will be 1 as 2 xor 4 xor 7 = 1).

  If the xor-sum is 0, too bad, you will lose.

  Otherwise, move such that the xor-sum becomes 0. This is always possible.


It is quite easy to convince oneself that this works. Consider these facts:

  The player that takes the last bead wins.

  After the winning player's last move the xor-sum will be 0.

  The xor-sum will change after every move.


Which means that if you make sure that the xor-sum always is 0 when you have made your move, your opponent will never be able to win, and, thus, you will win.

Understandibly it is no fun to play a game when both players know how to play perfectly (ignorance is bliss). Fourtunately, Arthur and Caroll soon came up with a similar game, S-Nim, that seemed to solve this problem. Each player is now only allowed to remove a number of beads in some predefined set S, e.g. if we have S =(2, 5) each player is only allowed to remove 2 or 5 beads. Now it is not always possible to make the xor-sum 0 and, thus, the strategy above is useless. Or is it?

your job is to write a program that determines if a position of S-Nim is a losing or a winning position. A position is a winning position if there is at least one move to a losing position. A position is a losing position if there are no moves to a losing position. This means, as expected, that a position with no legal moves is a losing position.

 

Input

Input consists of a number of test cases. For each test case: The first line contains a number k (0 < k ≤ 100 describing the size of S, followed by k numbers si (0 < si ≤ 10000) describing S. The second line contains a number m (0 < m ≤ 100) describing the number of positions to evaluate. The next m lines each contain a number l (0 < l ≤ 100) describing the number of heaps and l numbers hi (0 ≤ hi ≤ 10000) describing the number of beads in the heaps. The last test case is followed by a 0 on a line of its own.

 

Output

For each position: If the described position is a winning position print a 'W'.If the described position is a losing position print an 'L'. Print a newline after each test case.

 

Sample Input

  
  

   
   2 2 5
3
2 5 12
3 2 4 7
4 2 3 7 12
5 1 2 3 4 5
3
2 5 12
3 2 4 7
4 2 3 7 12
0
  
  

 

Sample Output

  
  

   
   LWW
WWL
  
  
  
  

   
    
  
  
  
  

   
    
  
  
  
  

   
   题目大意：给出操作集合S（比如s={1,2,5})，然后给出一个n堆石子的某个状态，问这个状态在此集合s约束下是先手能否取胜（也可以看做当前轮到操作的这个人）。
  
  
  
  

   
    
  
  
  
  

   
   分析：刚开始学习Graph Game，不是很懂，但是下面这个代码很好理解！分享~
  
  
  
  

   
   
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int k,s[110],f[10010];

int mex(int p) {
    int i,t,g[110];
    memset(g,0,sizeof(g));
    for(i=0;i<k;i++) {
        t=p-s[i];
        if(t<0)
		   continue;
        if(f[t]==-1)
            f[t]=mex(t);//递归地求解这一堆的各个互联局面的SG值
        g[f[t]]=1;//如果g[i]==1,表示p点的子局面t的SG值为i,通过判断g[]数组哪些值为0,就可以找出不在p子局面的SG的集合中、并且最小的非负整数，即为从后往前找的第一个g[x]==0的x
    }
    for(i=0;;i++) {
        if(g[i]==0) 
            return i;
    }
}
int main() {
    int m,n,ans,t,i;
    while(scanf("%d",&k),k!=0) {
        for(i=0;i<k;i++) {
            scanf("%d",&s[i]);
        }
        memset(f,-1,sizeof(f));
        f[0]=0;
        scanf("%d",&m);
        while(m--) {
            scanf("%d",&n);
            ans=0;
            while(n--) {
                scanf("%d",&t);
                if(f[t]==-1)//如果不知道当前点的SG值，则计算之
                    f[t]=mex(t);
                ans=ans^f[t];
            }
            if(ans==0)
                printf("L");
            else 
                printf("W");
        }
        printf("\n");
    }
    system("pause");
    return 0;
}