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
#include <vector>
#include <algorithm>
#include <iostream>

typedef std::vector< long int > VI;
typedef VI::iterator ITER;

VI Res;

int N = 100000;
int M = 200000;

/* 1 - wygrana, 2 - przegrana, 0 - remis */
int karty()
{
    int ret = 0; 
    long int n, m;
    std::cin >> n >> m; 
    VI W = VI(n,0); 
    VI P = VI(n,0); 

    long int a, b;
    char c;
    for( long int i = 0; i < m; ++i )
    {
    	std::cin >> a >> c >> b; 
        if (c == '>')
        {
            W[b-1]++;    
        }
        else
        {
            P[b-1]++;
        }
    }

    ITER it = find( W.begin(), W.end(), n );
    if (it != W.end() )
    {
        ret = 1; 
    }
    else
    {
        it = find( P.begin(), P.end(), 0 );
        if (it != P.end() )
        {
            ret = 0;
        }
        else
        {
            ret = 2;
        }
    }
    return ret;
}

int main()
{
    int t;
    std::cin >> t;
    for( int i=0; i<t; ++i )
    {
        Res.push_back( karty() );
    }   

    for( int i=0; i<Res.size(); ++i )
    {
        switch( Res[i] )
        {
            case 1: 
                std::cout << "WYGRANA" << std::endl;
                break;
            case 2: 
                std::cout << "PRZEGRANA" << std::endl;
                break; 
            case 0: 
                std::cout << "REMIS" << std::endl;
                break; 
            default :
                std::cout << "cos poszlo zle " << std::endl;
        }
    }    
    return 0;
}