import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.StringTokenizer; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top */ public class kar { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); GraWKarty solver = new GraWKarty(); solver.solve(1, in, out); out.close(); } static class GraWKarty { public void solve(int testNumber, InputReader in, PrintWriter out) { int T = in.nextInt(); while (T-- > 0) { int N = in.nextInt(); int M = in.nextInt(); int bitekOut[] = new int[N]; int bitekIn[] = new int[N]; for (int i = 0; i < M; i++) { int A = in.nextInt() - 1; char R = in.next().charAt(0); int B = in.nextInt() - 1; if (R == '<') { bitekOut[B]++; } else { bitekIn[B]++; } } boolean win = false; boolean lose = true; for (int i = 0; i < N; i++) { win |= bitekIn[i] == N; lose &= bitekOut[i] > 0; } if (win) { out.println("WYGRANA"); } else if (lose) { out.println("PRZEGRANA"); } else { out.println("REMIS"); } } } } static class InputReader { public BufferedReader reader; public StringTokenizer tokenizer; public InputReader(InputStream stream) { reader = new BufferedReader(new InputStreamReader(stream), 32768); tokenizer = null; } public String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public int nextInt() { return Integer.parseInt(next()); } } }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 | import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.StringTokenizer; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top */ public class kar { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); GraWKarty solver = new GraWKarty(); solver.solve(1, in, out); out.close(); } static class GraWKarty { public void solve(int testNumber, InputReader in, PrintWriter out) { int T = in.nextInt(); while (T-- > 0) { int N = in.nextInt(); int M = in.nextInt(); int bitekOut[] = new int[N]; int bitekIn[] = new int[N]; for (int i = 0; i < M; i++) { int A = in.nextInt() - 1; char R = in.next().charAt(0); int B = in.nextInt() - 1; if (R == '<') { bitekOut[B]++; } else { bitekIn[B]++; } } boolean win = false; boolean lose = true; for (int i = 0; i < N; i++) { win |= bitekIn[i] == N; lose &= bitekOut[i] > 0; } if (win) { out.println("WYGRANA"); } else if (lose) { out.println("PRZEGRANA"); } else { out.println("REMIS"); } } } } static class InputReader { public BufferedReader reader; public StringTokenizer tokenizer; public InputReader(InputStream stream) { reader = new BufferedReader(new InputStreamReader(stream), 32768); tokenizer = null; } public String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public int nextInt() { return Integer.parseInt(next()); } } } |