题目:题目链接
就是SG的本质,mex(minimal excludant)运算,这是施加于一个集合的运算,表示最小的不属于这个集合的非负整数。
例如mex{0,1,2,4}=3、mex{2,3,5}=0、mex{}=0。
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
int k;
int m;
int t;
int index;
#define N 10010
int num[N];
int sg[N];
int mex(int v)
{
if(sg[v] != -1)
return sg[v];
bool vis[101] = {0};
for(int i = 0; i < k; ++i)
{
if(v - num[i] < 0)
break;
sg[v-num[i]] = mex(v - num[i]);
vis[sg[v-num[i]]] = true;
}
for(int i = 0;; ++i)
{
if(!vis[i])
{
sg[v] = i;
break;
}
}
return sg[v];
}
int main()
{
while(scanf("%d", &k))
{
if(k == 0)
break;
for(int i = 0; i < k; ++i)
scanf("%d", &num[i]);
sort(num, num + k);
mem(sg, -1);
sg[0] = 0;
scanf("%d", &m);
while(m--)
{
int ans = 0;
scanf("%d", &t);
while(t--)
{
scanf("%d", &index);
if(sg[index] == -1)
sg[index] = mex(index);
ans ^= sg[index];
}
if(ans)
printf("W");
else
printf("L");
}
printf("\n");
}
return 0;
}