MemSQL start[c]up Round 2 - online version C. More Reclamation

学习tourist的代码，自己编写了一个，基本一样，思路显然是SG函数，类似刘汝佳书本上的例题UVaoj 10561

题目链接：http://codeforces.com/contest/335/problem/C

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1502

就直接贴代码了：

#include<iostream>#include<cstring>using namespace std;#define LL long longint g[111][111];int SG(int a, int b, int c, int d, int l){int tem = (a << 3) + (b << 2) + (c << 1) + d, i, j, k, n, st, en, s[111][3], re;if (g[tem][l] != -1)return g[tem][l];bool alive[111], vis[400];for (i = 0; i < 111; ++i) alive[i] = true;for (i = 0; i < 400; ++i) vis[i] = false;memset(s, 0, sizeof(s));for (i = 1; i <= l; ++i) s[i][1] = s[i][2] = 0;s[1][1] = a, s[1][2] = b, s[l][1] = c, s[l][2] = d;for (i = 1; i <= l; ++i)for (j = 1; j <= 2; ++j){if (s[i][j] == 0){re = 0;s[i][j]++;s[i - 1][3 - j]++;s[i + 1][3 - j]++;s[i][3 - j]++;for (k = 1;k <= l; ++k) alive[k] = (s[k][1] * s[k][2] == 0);st = 1;while (st <= l){while (!alive[st] && st <= l) st++;if (st > l)break;a = s[st][1], b = s[st][2];en  = st + 1; while (en <= l && alive[en]) en++;c = s[en - 1][1], d = s[en - 1][2];re ^= SG(a, b, c, d, en - st);st = en;}vis[re] = true;s[i][j]--;s[i - 1][3 - j]--;s[i+ 1][3 - j]--;s[i][3 - j]--;}}int &ans = g[tem][l];ans = 0;while (vis[ans]) ans++;return ans;}int main(){int n, t, x, y, i, j, k, st, en, s[111][3] = {0}, a, b, c, d, re = 0;bool alive[111];memset(g, -1, sizeof(g));cin >> n >> t;for (i = 0; i < t; ++i){cin >> x >> y;s[x][y] = 1;s[x- 1][3 - y] = 1;s[x][3 - y] = 1;s[x + 1][3 - y] = 1;}for (i = 1; i <= n; ++i) alive[i] = (s[i][1] * s[i][2] == 0);st = 1;while (st <= n){while (!alive[st] && st <= n) st++;if (st > n)break;a = s[st][1], b = s[st][2];en  = st + 1; while (en <= n && alive[en]) en++;c = s[en - 1][1], d = s[en - 1][2];re ^= SG(a, b, c, d, en - st);st = en;}puts(re != 0 ? "WIN" : "LOSE");}