hdu1524 A Chess Game (博弈 dfs求sg)

Problem Description

Let’s design a new chess game. There are N positions to hold M chesses in this game. Multiple chesses can be located in the same position. The positions are constituted as a topological graph, i.e. there are directed edges connecting some positions, and no cycle exists. Two players you and I move chesses alternately. In each turn the player should move only one chess from the current position to one of its out-positions along an edge. The game does not end, until one of the players cannot move chess any more. If you cannot move any chess in your turn, you lose. Otherwise, if the misfortune falls on me… I will disturb the chesses and play it again.

Do you want to challenge me? Just write your program to show your qualification!

Input

Input contains multiple test cases. Each test case starts with a number N (1 <= N <= 1000) in one line. Then the following N lines describe the out-positions of each position. Each line starts with an integer Xi that is the number of out-positions for the position i. Then Xi integers following specify the out-positions. Positions are indexed from 0 to N-1. Then multiple queries follow. Each query occupies only one line. The line starts with a number M (1 <= M <= 10), and then come M integers, which are the initial positions of chesses. A line with number 0 ends the test case.

Output

There is one line for each query, which contains a string “WIN” or “LOSE”. “WIN” means that the player taking the first turn can win the game according to a clever strategy; otherwise “LOSE” should be printed.

Sample Input

4
2 1 2
0
1 3
0
1 0
2 0 2
0

4
1 1
1 2
0
0
2 0 1
2 1 1
3 0 1 3
0

Sample Output

WIN
WIN
WIN
LOSE
WIN

分析：

nim博弈的有向无环图模型，裸题
懂sg原理应该就能写出来
记忆化搜索求sg

mark数组放在全局无限wa，必须局部
因为如果放在全局，dfs求子游戏的sg的时候也会操作mark数组，然后就错了

code:

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<cstring>
using namespace std;
const int maxm=1e3+5;
vector<int>g[maxm];
int sg[maxm];
int dfs(int x){
    if(sg[x]!=-1)return sg[x];
    int mark[maxm]={0};//局部
    int len=g[x].size();
    for(int i=0;i<len;i++){
        mark[dfs(g[x][i])]=1;
    }
    for(int i=0;;i++){
        if(!mark[i]){
            return sg[x]=i;
        }
    }
}
signed main(){
    int n;
    while(cin>>n){
        for(int i=0;i<n;i++){
            g[i].clear();
            sg[i]=-1;
        }
        for(int i=0;i<n;i++){
            int k;
            cin>>k;
            if(!k){
                sg[i]=0;
            }else{
                while(k--){
                    int x;
                    cin>>x;
                    g[i].push_back(x);
                }
            }
        }
        int m;
        while(cin>>m,m){
            int sum=0;
            while(m--){
                int x;
                cin>>x;
                sum^=dfs(x);
            }
            if(sum){
                cout<<"WIN"<<endl;
            }else{
                cout<<"LOSE"<<endl;
            }
        }
    }
}