#include <stdio.h> #include <iostream> #include <vector> #include <array> using namespace std; typedef vector<int> VI; typedef long long LL; typedef pair<int,int> para; #define FOR(x, b, e) for(int x = b; x <= (e); ++x) #define FORD(x, b, e) for(int x = b; x >= (e); --x) #define REP(x, n) for(int x = 0; x < (n); ++x) #define VAR(v, n) __typeof(n) v = (n) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PB push_back #define ST first #define ND second #define MP make_pair int main() { int t, n, m, p, q, w, m1, i; // char w; array<int, 100000> a, b; scanf("%d", &t); REP(x,t) { a.fill(0); b.fill(0); m1=0; scanf("%d%d", &n, &m); REP(y,m) { scanf("%d %c%d", &p, &w, &q); if (w=='>') { a[--q]++; if (a[q]>m1) m1=a[q]; } else b[--q]=1; } //cout<<"n= "<<n<<" m1= "<<m1<<" m2= "<<m2<<endl; if (m1==n) { printf("%s","WYGRANA\n"); continue; } for (i=0;i<n;i++) if (b[i]==0) break; if (i==n) { printf("%s","PRZEGRANA\n"); continue; } printf("%s","REMIS\n"); } return 0; }
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 | #include <stdio.h> #include <iostream> #include <vector> #include <array> using namespace std; typedef vector<int> VI; typedef long long LL; typedef pair<int,int> para; #define FOR(x, b, e) for(int x = b; x <= (e); ++x) #define FORD(x, b, e) for(int x = b; x >= (e); --x) #define REP(x, n) for(int x = 0; x < (n); ++x) #define VAR(v, n) __typeof(n) v = (n) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PB push_back #define ST first #define ND second #define MP make_pair int main() { int t, n, m, p, q, w, m1, i; // char w; array<int, 100000> a, b; scanf("%d", &t); REP(x,t) { a.fill(0); b.fill(0); m1=0; scanf("%d%d", &n, &m); REP(y,m) { scanf("%d %c%d", &p, &w, &q); if (w=='>') { a[--q]++; if (a[q]>m1) m1=a[q]; } else b[--q]=1; } //cout<<"n= "<<n<<" m1= "<<m1<<" m2= "<<m2<<endl; if (m1==n) { printf("%s","WYGRANA\n"); continue; } for (i=0;i<n;i++) if (b[i]==0) break; if (i==n) { printf("%s","PRZEGRANA\n"); continue; } printf("%s","REMIS\n"); } return 0; } |