题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1536
思路:求sg函数就好了。
打表版:
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%I64d",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod int(1e9+7)
#define pb push_back
#define lc (d<<1)
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
int k,n,m,sg[10008],f[108];
bool vis[108];
void get_sg(int *f,int k)
{
REW(sg,0);
FOR(i,1,10000)
{
memset(vis,0,sizeof(vis));
FOR(j,1,k)
{
if(i>=f[j]) vis[sg[i-f[j]]]=1;
}
FOR(j,0,10000)
{
if(!vis[j])
{
sg[i]=j;
break;
}
}
}
}
int main()
{
cin.tie(0);
cout.tie(0);
while(si(k)!=EOF&&k)
{
FOR(i,1,k) si(f[i]);
get_sg(f,k);
cin>>n;
int z,s;
while(n--)
{
si(m);
s=0;
FOR(i,1,m)
{
si(z);
s^=sg[z];
}
if(s) printf("W");
else printf("L");
}
puts("");
}
return 0;
}
dfs版:sg初始化为-1,f[]数组排序
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%I64d",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod int(1e9+7)
#define pb push_back
#define lc (d<<1)
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
int k,n,m,sg[10008],f[108];
int get_sg(int x)
{
if(sg[x]!=-1) return sg[x];
bool vis[108];
REW(vis,0);
FOR(i,1,k)
{
if(x>=f[i]) vis[get_sg(x-f[i])]=1;
}
FOR(i,0,10000)
{
if(!vis[i])
{
sg[x]=i;
break;
}
}
return sg[x];
}
int main()
{
cin.tie(0);
cout.tie(0);
while(si(k)!=EOF&&k)
{
FOR(i,1,k) si(f[i]);
sort(f+1,f+k+1);
REW(sg,-1);
cin>>n;
int z,s;
while(n--)
{
si(m);
s=0;
FOR(i,1,m)
{
si(z);
s^=get_sg(z);
}
if(s) printf("W");
else printf("L");
}
puts("");
}
return 0;
}