# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24404 | Extazy | Weighting stones (IZhO11_stones) | C++14 | 0 ms | 2156 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>
using namespace std;
const int N = 1<<17;
int n;
set < int, greater < int > > s[2];
set < int, greater < int > >::iterator it0,it1;
int cnt;
int main() {
int i,x,y;
scanf("%d", &n);
for(i=1;i<=n;i++) {
scanf("%d %d", &x, &y);
s[y-1].insert(x);
if(s[0].empty()) printf("<\n");
else if(s[1].empty()) printf(">\n");
else if(*s[0].begin()>*s[1].begin()) {
cnt=0;
for(it0=s[0].begin(),it1=s[1].begin();it0!=s[0].end() && it1!=s[1].end();it0++,it1++) {
if(*it0>*it1) ++cnt;
else break;
if(cnt>200) {
cnt=s[1].size();
break;
}
}
if(cnt==(int)(s[1].size())) printf(">\n");
else printf("?\n");
}
else {
cnt=0;
for(it0=s[0].begin(),it1=s[1].begin();it0!=s[0].end() && it1!=s[1].end();it0++,it1++) {
if(*it0<*it1) ++cnt;
else break;
if(cnt>200) {
cnt=s[0].size();
break;
}
}
if(cnt==(int)(s[0].size())) printf("<\n");
else printf("?\n");
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |