hdu1536

最新推荐文章于 2021-08-04 15:34:32 发布

oopslb

最新推荐文章于 2021-08-04 15:34:32 发布

阅读量229

点赞数 1

分类专栏：博弈

本文链接：https://blog.csdn.net/imzxww/article/details/76291319

版权

博弈专栏收录该内容

8 篇文章 0 订阅

订阅专栏

S-Nim

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

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
      
      
      
      

      
      
      
      
       
       思路：直接SG函数打表，不过前面一直TLE，后面把标记的数组改为bool型，就过了。
      
      
      
      

      
      
      
      
       
       代码：
      
      
      
      
       
       #include <map>
#include <set>
#include <queue>
#include <vector>
#include <stack>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define long long int ll
#define ma(a) memset(a,0,sizeof(a))
int SG[10005],f[105];
bool S[10005];
void getSG(int n)
{
    int i,j;
    ma(SG);
    for(i=1;i<10005;i++)
    {
       ma(S);
        for(j=0;f[j]<=i&&j<n;j++)
        {
            S[SG[i-f[j]]]=1;
        }
        for(j=0;;j++)
        {
            if(!S[j])
            {
                SG[i]=j;
                break;
            }
        }
    }
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF&&n)
    {
        int i;
        for(i=0;i<n;i++)
        {
            scanf("%d",&f[i]);
        }
        sort(f,f+n);
        getSG(n);
        int t;
        scanf("%d",&t);
        char a[1005];
        int z=0;
        while(t--)
        {
            int m;
            int sum=0;
            scanf("%d",&m);
            for(i=0;i<m;i++)
            {
                int x;
                scanf("%d",&x);
                sum^=SG[x];
            }
            if(sum==0)printf("L");
            else printf("W");
        }
        cout<<endl;
    }
    return 0;
}