# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
74961 | Vardanyan | Weighting stones (IZhO11_stones) | C++14 | 1084 ms | 2856 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.
//#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
int main(){
set<int,greater<int> > a,b;
int n;
scanf("%d",&n);
for(int i = 1;i<=n;i++){
int r,s;
scanf("%d%d",&r,&s);
if(s == 1) a.insert(r);
else b.insert(r);
bool f1 = false,f2 = false;
if(a.size()>=b.size()){
f1 = true;
set<int,greater<int> >::iterator it1 = a.begin(),it2 = b.begin();
for(;it2!=b.end();it1++,it2++){
if(*(it1)>*(it2)) continue;
f1 = false;
break;
}
}
if(b.size()>=a.size()){
f2 = true;
set<int,greater<int> >::iterator it1 = a.begin(),it2 = b.begin();
for(;it1!=a.end();it1++,it2++){
if(*(it2)>*(it1)) continue;
f2 = false;
break;
}
}
if(f1){
printf(">\n");
}
else if(f2){
printf("<\n");
}
else printf("?\n");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |