|
| 1 | +import java.io.*; |
| 2 | +import java.util.Arrays; |
| 3 | + |
| 4 | +public class Main { |
| 5 | + private StreamTokenizer in; |
| 6 | + private PrintWriter out; |
| 7 | + |
| 8 | + private String playground[][]; |
| 9 | + private int n; |
| 10 | + private int sets[][]; |
| 11 | + |
| 12 | + int nextInt() throws IOException { |
| 13 | + in.nextToken(); |
| 14 | + return (int)in.nval; |
| 15 | + } |
| 16 | + |
| 17 | + public static void main(String[] args) throws IOException { |
| 18 | + new Main().run(); |
| 19 | + } |
| 20 | + |
| 21 | + void run() throws IOException { |
| 22 | + in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in))); |
| 23 | + out = new PrintWriter(new OutputStreamWriter(System.out)); |
| 24 | + solve(); |
| 25 | + out.flush(); |
| 26 | + } |
| 27 | + |
| 28 | + void simulate_all() { |
| 29 | + final String WIN = "Win "; |
| 30 | + final String LOSE = "Lose "; |
| 31 | + final String LOOP = "Loop "; |
| 32 | + boolean changed = true; |
| 33 | + int i,j; |
| 34 | + |
| 35 | + Arrays.fill(playground[0], LOOP); |
| 36 | + Arrays.fill(playground[1], LOOP); |
| 37 | + |
| 38 | + for (i = 0; i < 2; i++) { |
| 39 | + for (int e : sets[i]) { |
| 40 | + playground[i][n - e] = WIN; |
| 41 | + } |
| 42 | + } |
| 43 | + while (changed) { |
| 44 | + changed = false; |
| 45 | + for (i = n - 1; i > 0; i--) { |
| 46 | + for (j = 0; j < 2; j++) { |
| 47 | + if (playground[j][i] == LOOP) { |
| 48 | + boolean win = false; |
| 49 | + boolean loop = false; |
| 50 | + for (int e : sets[j]) { |
| 51 | + int idx = (i + e) % n; |
| 52 | + if (playground[1-j][idx] == LOSE) { |
| 53 | + win = true; |
| 54 | + break; |
| 55 | + } else if (playground[1-j][idx] != WIN) { |
| 56 | + loop = true; |
| 57 | + } |
| 58 | + } |
| 59 | + |
| 60 | + if (win) { |
| 61 | + changed = true; |
| 62 | + playground[j][i] = WIN; |
| 63 | + } else if (!loop) { |
| 64 | + changed = true; |
| 65 | + playground[j][i] = LOSE; |
| 66 | + } |
| 67 | + } |
| 68 | + } |
| 69 | + } |
| 70 | + } |
| 71 | + } |
| 72 | + |
| 73 | + void solve() throws IOException { |
| 74 | + int i; |
| 75 | + n = nextInt(); |
| 76 | + int k1 = nextInt(); |
| 77 | + sets = new int[2][]; |
| 78 | + sets[0] = new int[k1]; |
| 79 | + for (i = 0; i < k1; i++) { |
| 80 | + sets[0][i] = nextInt(); |
| 81 | + } |
| 82 | + int k2 = nextInt(); |
| 83 | + sets[1] = new int[k2]; |
| 84 | + for (i = 0; i < k2; i++) { |
| 85 | + sets[1][i] = nextInt(); |
| 86 | + } |
| 87 | + playground = new String[2][]; |
| 88 | + playground[0] = new String[n]; |
| 89 | + playground[1] = new String[n]; |
| 90 | + |
| 91 | + simulate_all(); |
| 92 | + |
| 93 | + StringBuilder b1 = new StringBuilder(); |
| 94 | + StringBuilder b2 = new StringBuilder(); |
| 95 | + |
| 96 | + for (i = 1; i < n; i++) { |
| 97 | + b1.append(playground[0][i]); |
| 98 | + b2.append(playground[1][i]); |
| 99 | + } |
| 100 | + |
| 101 | + out.println(b1.toString()); |
| 102 | + out.println(b2.toString()); |
| 103 | + } |
| 104 | +} |
0 commit comments