poj 2425 AChessGame(博弈)

A Chess Game

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 3791		Accepted: 1549

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

/*
poj 2425 AChessGame(博弈)

给你一个有向的图，上面的棋子可以移动到下一个节点，如果当前无法移动则失败

可以同dfs求出所有节点的sg值，然后进行计算即可

hhh-2016-08-02 16:50:29

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

*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <functional>
typedef long long ll;
#define lson (i<<1)
#define rson ((i<<1)|1)
using namespace std;

const int maxn = 1000+10;

int sg[maxn];
int Map[maxn][maxn];
int n;
void dfs(int now)
{
    int vis[maxn] = {0};
    for(int i = 0; i < n; i++)
    {
        if(Map[now][i])
        {
            if(sg[i] == -1)
                dfs(i);
            vis[sg[i]] = 1;
        }

    }
    for(int i = 0; i < n; i++)
    {
        if(!vis[i])
        {
            sg[now] = i;
            break;
        }
    }
}

int main()
{
    int x,m;
    while(scanf("%d",&n) != EOF && n)
    {
        memset(sg,-1,sizeof(sg));
        memset(Map,0,sizeof(Map));
        for(int i = 0; i < n; i++)
        {
            scanf("%d",&m);
            for(int j = 1; j <= m; j++)
            {
                scanf("%d",&x);
                Map[i][x] = 1;
            }
        }
        for(int i = 0; i < n; i++)
        {
            if(sg[i] == -1)
                dfs(i);
        }
        while(scanf("%d",&m)!=EOF && m)
        {
            int ans = 0;
            for(int i = 0; i < m; i++)
            {
                scanf("%d",&x);
                ans ^= sg[x];
            }
            if(ans)
                printf("WIN\n");
            else
                printf("LOSE\n");
        }
    }
    return 0;
}