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
#include <cstdio>
#include <vector>

using namespace std;

int degin[100010];
int degout[100010];

int output(int n)
{
    for (int i = 1; i <= n; i++)
        if (degout[i] == n) return 1;
    for (int i = 1; i <= n; i++)
        if (degin[i] == 0) return 0;
    return -1;
}

int main()
{
    int t;
    scanf("%d", &t);
    for (int $ = 0; $ < t; $++)
    {
        int n, m;
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; i++)
            degin[i] = 0, degout[i] = 0;
        for (int i = 0; i < m; i++)
        {
            int a, b;
            char c;
            scanf("%d", &a); scanf(" %c", &c); scanf("%d", &b);
            if (c == '>') degout[b]++;
            else degin[b]++;
        }
        int o = output(n);
        if (o == 1) printf("WYGRANA\n");
        else if (o == 0) printf("REMIS\n");
        else printf("PRZEGRANA\n");
    }
}