# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673600 | smartmonky | Weighting stones (IZhO11_stones) | C++14 | 1 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
const int N = 501 * 500;
int cnt[3], mx[3],mn[3];
int chotam[N];
main(){
//fp("stones");
int q;
cin >> q;
mn[1] = 1e9;
mn[2] = 1e9;
while(q--){
int r, s;
cin >> r >> s;
cnt[s]++;
mx[s] = max(mx[s], r);
mn[s] = min(mn[s], r);
if((cnt[1] == cnt[2] && mn[1] > mn[2] && mx[1] > mx[2]) || mn[2] == 1e9 || (cnt[1] > cnt[2] && mx[1] > mx[2])){
cout <<">" << endl;
continue;
}
if((cnt[1] == cnt[2] && mn[1] < mn[2] && mx[1] < mx[2]) || mn[1] == 1e9 || (cnt[1] < cnt[2] && mx[1] < mx[2])){
cout <<"<" << endl;
continue;
}
cout <<"?" << endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |