Luogu 2575 高手过招-SG函数

Solution

SG函数跑一遍就过了ouo

Code

 #include<cstring>
 #include<cstdio>
 #include<algorithm>
 #define rd read()
 #define cl(a) memset(a, 0, sizeof(a));
 using namespace std;

 const int N =  << ;

 int SG[N], S[];
 int T, n;

 int read() {
     int X = , p = ; char c = getchar();
     for(; c > '' ||  c < ''; c = getchar()) if(c == '-') p = -;
     for(; c >= '' && c <= ''; c = getchar()) X = X *  + c - '';
     return X * p;
 }

 void mkSG() {
     for(int i = ; i < ; ++i) SG[i] = ;
     for(int i = ; i < ( << ); ++i) {
         cl(S);
         int last = -, nt;
         for(int j = ; j < ; ++j) if((i >> j) & ) {
             if(~last) {
                 nt = i | ( << last);
                 nt ^=  << j;
                 S[SG[nt]] = ;
             }
         } else last = j;
         int j = ;
         for(; S[j]; ++j);
         SG[i] = j;
     }
 }

 int main()
 {
     mkSG();
     T = rd;
     for(; T; T--) {
         n = rd;
         int ans = ;
         for(int i = ; i <= n; ++i) {
             int m = rd, tmp = ;
             for(int j = ; j <= m; ++j) {
                 int x = rd;
                 tmp |=  << ( - x);
             }
             ans ^= SG[tmp];
         }
         if(ans) puts("YES");
         else puts("NO");
     }
 }