【百题留念】hdoj 1524 A Chess Game（dfs + SG函数应用）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1524

 #include<stdio.h>
 #include<cstring>
 using namespace std;
 ;//
 ;
 int sg[N], head[N];
 int cnt;

 struct node{
     int from;
     int to;
     int next;
 }edge[M];

 void addedge( int from, int to){
     edge[cnt].from = from;
     edge[cnt].to = to;
     edge[cnt].next = head[from];//同一个父节点引出的边
     head[from] = cnt++;
 }

 void init(){
     cnt = ;//总边数
     memset(head,-,sizeof(head));
     memset(sg,-,sizeof(sg));
 }

 int mex(int n){
     bool g[N];
     memset(g,false,sizeof(g));
      )
         return sg[n];
     ; i = edge[i].next){
          )
             sg[edge[i].to] = mex(edge[i].to);
         g[sg[edge[i].to]] = true;
     }
     ; i < N; ++i)
         if(!g[i])
             return i;
 }

 int main(){
     int n, m, tmp;
     while(~scanf("%d",&n)){
         init();
         ; i < n; ++i){
             scanf("%d",&m);
             ; j < m; ++j){
                 scanf("%d",&tmp);
                 addedge(i,tmp);//建图
             }
         }
         while(~scanf("%d",&m)&&m){
             ;
             ; i < m; ++i){
                 scanf("%d",&tmp);
                 ans = ans ^ mex(tmp);
             }
             puts(ans?"WIN":"LOSE");
         }
     }
     ;
 }

百题留念