#include <bits/stdc++.h> #define MAX 200007 #define LL long long using namespace std; int n,m,t,a,b; char w; bitset <MAX> por; int in[MAX]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin>>t; for (int ii=1; ii<=t; ++ii) { int res = 0; for (int i=0; i<=n; ++i) { por[i] = 0; in[i] = 0; } cin>>n>>m; for (int i=0; i<m; ++i) { cin>>a>>w>>b; if (w == '>') { ++in[b]; } if (w == '<') { por[b] = 1; } } int y; for (y=1; por[y] && y<=n ; ++y); if (y == n+1) { cout<<"PRZEGRANA\n"; continue; } //cout<<"n: "<<n<<endl; //cout<<por[1]<<por[2]; sort(in,in+n+1, greater<int>()); if (in[0] == n) { cout<<"WYGRANA\n"; continue; } cout<<"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 70 | #include <bits/stdc++.h> #define MAX 200007 #define LL long long using namespace std; int n,m,t,a,b; char w; bitset <MAX> por; int in[MAX]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin>>t; for (int ii=1; ii<=t; ++ii) { int res = 0; for (int i=0; i<=n; ++i) { por[i] = 0; in[i] = 0; } cin>>n>>m; for (int i=0; i<m; ++i) { cin>>a>>w>>b; if (w == '>') { ++in[b]; } if (w == '<') { por[b] = 1; } } int y; for (y=1; por[y] && y<=n ; ++y); if (y == n+1) { cout<<"PRZEGRANA\n"; continue; } //cout<<"n: "<<n<<endl; //cout<<por[1]<<por[2]; sort(in,in+n+1, greater<int>()); if (in[0] == n) { cout<<"WYGRANA\n"; continue; } cout<<"REMIS\n"; } return 0; } |