Sleepy Game CodeForces - 937D（判环）

Petya and Vasya arranged a game. The game runs by the following rules. Players have a directed graph consisting of n vertices and m edges. One of the vertices contains a chip. Initially the chip is located at vertex s. Players take turns moving the chip along some edge of the graph. Petya goes first. Player who can’t move the chip loses. If the game lasts for 106 turns the draw is announced.

Vasya was performing big laboratory work in “Spelling and parts of speech” at night before the game, so he fell asleep at the very beginning of the game. Petya decided to take the advantage of this situation and make both Petya’s and Vasya’s moves.

Your task is to help Petya find out if he can win the game or at least draw a tie.

Input
The first line of input contain two integers n and m — the number of vertices and the number of edges in the graph (2 ≤ n ≤ 105, 0 ≤ m ≤ 2·105).

The next n lines contain the information about edges of the graph. i-th line (1 ≤ i ≤ n) contains nonnegative integer ci — number of vertices such that there is an edge from i to these vertices and ci distinct integers ai, j — indices of these vertices (1 ≤ ai, j ≤ n, ai, j ≠ i).

It is guaranteed that the total sum of ci equals to m.

The next line contains index of vertex s — the initial position of the chip (1 ≤ s ≤ n).

Output
If Petya can win print «Win» in the first line. In the next line print numbers v1, v2, …, vk (1 ≤ k ≤ 106) — the sequence of vertices Petya should visit for the winning. Vertex v1 should coincide with s. For i = 1… k - 1 there should be an edge from vi to vi + 1 in the graph. There must be no possible move from vertex vk. The sequence should be such that Petya wins the game.

If Petya can’t win but can draw a tie, print «Draw» in the only line. Otherwise print «Lose».

Examples
Input
5 6
2 2 3
2 4 5
1 4
1 5
0
1
Output
Win
1 2 4 5
Input
3 2
1 3
1 1
0
2
Output
Lose
Input
2 2
1 2
1 1
1
Output
Draw
Note
In the first example the graph is the following:

Initially the chip is located at vertex 1. In the first move Petya moves the chip to vertex 2, after that he moves it to vertex 4 for Vasya. After that he moves to vertex 5. Now it is Vasya’s turn and there is no possible move, so Petya wins.

In the second example the graph is the following:

Initially the chip is located at vertex 2. The only possible Petya’s move is to go to vertex 1. After that he has to go to 3 for Vasya. Now it’s Petya’s turn but he has no possible move, so Petya loses.

In the third example the graph is the following:

Petya can’t win, but he can move along the cycle, so the players will draw a tie.

题意： 你是先手，后手在先手的基础上走，在图上一次走一步。后手不能走则胜利，循环则平局，否则失败。
思路：
1.胜利：走奇数步走到一个0度顶点。直接dfs，找到一个没有0度顶点判断一次。
2.平局：存在环，则到了环这里就平局了。这里还是有点技巧的。到了一个点先把他标记为1，如果dfs到了标记为1的点则代表回来了，dfs完了再把这个点标记为2。
3.失败：不能满足1、2情况。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>

using namespace std;

const int maxn = 2e5 + 7;
vector<int>ans;
int head[maxn],to[maxn],nex[maxn];
int tot = 0;
int vis[maxn],dp[maxn][2];

void init()
{
    memset(head,-1,sizeof(head));
    tot = 0;
}

void add(int x,int y)
{
    to[++tot] = y;
    nex[tot] = head[x];
    head[x] = tot;
}

int flag2;
bool dfs1(int s,int num)
{
    if(head[s] == -1 && (num % 2))
    {
        return 1;
    }
    
    for(int i = head[s];~i;i = nex[i])
    {
        int v = to[i];
        if(dp[v][num & 1] == 0)
        {
            dp[v][num & 1] = 1;
            ans.push_back(v);
            if(dfs1(v,num + 1)) return true;
            ans.pop_back();
        }
    }
    return 0;
}

bool dfs2(int s)
{
    vis[s] = 1;
    for(int i = head[s];~i;i = nex[i])
    {
        int v = to[i];
        if(vis[v] == 1) return true;
        else if(vis[v] == 0)
            if(dfs2(v))return true;
    }
    vis[s] = 2;//保证当vis[v] = 1时，v = u;
    return false;
}

int main()
{
    init();
    int n,m;scanf("%d%d",&n,&m);
    for(int i = 1;i <= n;i++)
    {
        int num;scanf("%d",&num);
        for(int j = 1;j <= num;j++)
        {
            int y;scanf("%d",&y);
            add(i,y);
        }
    }
    
    int s;scanf("%d",&s);
    ans.push_back(s);
    int is_win = dfs1(s,0);
    int is_loop = dfs2(s);
    if(is_win)
    {
        printf("Win\n");
        for(int i = 0;i < ans.size();i++)printf("%d ",ans[i]);
    }
    else if(is_loop) printf("Draw\n");
    else printf("Lose\n");
    return 0;
}