hdu 5724 Chess 博弈

#include <bits/stdc++.h>

using namespace std;
#define pb(x) push_back(x)
#define ll long long
#define mk(x, y) make_pair(x, y)
#define lson l, m, rt<<1
#define mem(a) memset(a, 0, sizeof(a))
#define rson m+1, r, rt<<11
#define mem1(a) memset(a, -1, sizeof(a))
#define mem2(a) memset(a, 0x3f, sizeof(a))
#define rep(i, n, a) for(int i = a; i<n; i++)
#define fi first
#define se second
typedef pair<int, int> pll;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int mod = 1e9+7;
const int inf = 1061109567;
const int dir[][2] = { {-1, 0}, {1, 0}, {0, -1}, {0, 1} };
int sg[1<<22];
int mex(int x)
{
    if(~sg[x])
        return x;
    bool vis[20];
    memset(vis, false, sizeof(vis));
    for(int i = 0; i < 20; i++) {
        if(((1<<i)&x)==0 && ((1<<(i+1))&x)) {
            int j;
            for(j = i + 2; j < 20; j++) {
                if(!(1<<j&x))
                    break;
            }
            for(int k = i+1; k <= j; k++) {
                int sta = x^(1<<i)^(1<<k);
                if(sta>=(1<<20))
                    break;
                mex(sta);
                vis[sg[sta]] = 1;
            }
        }
    }
    for(int i = 0; i < 20; i++)
        if(!vis[i])
            return sg[x] = i;
}
void init()
{
    mem1(sg);
    sg[(1<<20)-1] = 0;
    for(int i = 0; i < (1<<20); i++) {
        if(sg[i] == -1) {
            mex(i);
        }
    }
}
int main()
{
    init();
    int t, n, m, x;
    cin>>t;
    while(t--) {
        cin>>n;
        int ans = 0;
        for(int i = 0; i < n; i++) {
            scanf("%d", &m);
            int sta = 0;
            while(m--) {
                scanf("%d", &x);
                sta |= (1<<(20-x));
            }
            ans ^= sg[sta];
        }
        if(ans) {
            puts("YES");
        } else {
            puts("NO");
        }
    }
}