codeforces 936B Sleepy Game

http://www.elijahqi.win/2018/02/26/codeforces-936b-sleepy-game/
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

Copy
5 6
2 2 3
2 4 5
1 4
1 5
0
1
Output
Win
1 2 4 5
Input

Copy
3 2
1 3
1 1
0
2
Output
Lose
Input

Copy
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.

dfs一下 设dp[x][s]表示当前处于x节点 我(s==0表示先手走 s==1后手走) 先手能否获胜 那么我直接dfs一下即可 最坏复杂度应该不超过2*n 即两种状态恰好像梳子一样交替走 我每次记录visit 当visit==2的时候表示这个点我搜索过了 visit==1的时候表示这个点我到过了 之前想的时候对于这个在环上绕来绕去怎么解决 记录这个visit 即可完美解决 如果遇到是visit==1那么判断有环 就不搜索了 如果是2 或者0 就去搜索一遍

#include<cstdio>
#include<algorithm>
#define N 110000
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9') {if (ch=='-') f=-1; ch=gc();}
    while(ch<='9'&&ch>='0') x=x*10+ch-'0',ch=gc();
    return x*f;
}
struct node{
    int y,next;
}data[N<<1];
bool dp[N][2],cir;int h[N],num,visit[N][2],out[N],next[N][2],n,m;
inline bool dfs(int x,int s){
    if (!out[x]) return s==1;
    if (visit[x][s]==2) return dp[x][s];
    visit[x][s]=1;bool t=0;
    for (int i=h[x];i;i=data[i].next){
        int y=data[i].y;if (visit[y][s^1]==1) {cir=1;continue;}
        if (dfs(y,s^1)) t=1,next[x][s]=y;
    }visit[x][s]=2;return dp[x][s]=t;
}
inline void print(int x,int s){
    printf("%d ",x);if (next[x][s]) print(next[x][s],s^1);
}
int main(){
    freopen("d.in","r",stdin);
    n=read();m=read();
    for (int i=1;i<=n;++i){
        int xx=read();
        while(xx--){
            int to=read();++out[i];
            data[++num].y=to;data[num].next=h[i];h[i]=num;
        }
    }int st=read();
    if (dfs(st,0))puts("Win"),print(st,0);else
    if (cir) puts("Draw");else puts("Lose");
    return 0;
}