HDU1536 SG函数的简单应用

S-Nim

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

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
   
   

 

Source

Norgesmesterskapet 2004

 

Recommend

LL

 

【题意】：n堆石头，规定每次只能取集合S中的某个数的石头，然后问先手胜负

【思路】：简单运用SG函数，先把所有位置的SG函数值求出来，再根据输入结果从sg数组中的得到SG值，并输出结果

【有趣的事】：刚开始做这道题的时候只是刚学SG函数，好不容易看懂了一部分（大牛勿喷！），去写的时候，发现WA了...其实就是错在一开始没有对S排序，然后我在POJ上过了以后，发现HDU也有一道类似的题目 不过时间限制少了一半，只有1000ms，然后就踏上了TLE之路，最后发现和别人400+ms的就一个地方有本质的区别——他的vis是bool 我的是int 因为一开始用java写程序的时候发现int数组比boolean数组更高效！谁知道...在此也是做一个前车之鉴吧！

【代码】：

#include <iostream>
#include <stdio.h>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
int n,mk,m,l,p,s[105],sg[10010];
bool vis[10010];
void get_sg()
{
    memset(sg,0,sizeof(sg));
    for(int i=1; i<10001; ++i)
    {
        memset(vis,0,sizeof(vis));
        for(int j=1; j<=n; ++j)
        {
            if(s[j]>i)
                break;
            vis[sg[i-s[j]]]=1;
        }
        for(int j=0;; ++j)
        {
            if(!vis[j])
            {
                sg[i]=j;
                break;
            }
        }
    }


}
int main()
{

    while(scanf("%d",&n)!=EOF&&n)
    {
        memset(s,0,sizeof(s));

        for(int i=1; i<=n; ++i)
            scanf(" %d",&s[i]);
        scanf("%d",&mk);
        sort(s+1,s+n+1);
        get_sg();
        while(mk--)
        {
            scanf("%d",&m);
            p=0;
            while(m--)
            {
                scanf("%d",&l);
                p^=sg[l];
            }
            if(p)
                putchar('W');
            else
                printf("%c",'L');
        }
        printf("\n");
    }
    return 0;
}