# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166052 | Dovran | Weighting stones (IZhO11_stones) | C++11 | 2 ms | 376 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 N 100009
#define pii pair <int, int>
#define ff first
#define ss second
#define pb push_back
#define ll long long
using namespace std;
int n;
vector<int>a, b;
int r, l;
int main(){
cin>>n;
for(int i=1; i<=n; i++){
int x, y;
cin>>x>>y;
if(y==1)
a.pb(x), l=max(l, x);
else
b.pb(x), r=max(r, x);
if(l > r and a.size()>b.size()){
cout<<">\n";
continue;
}
else if(l < r and a.size()<b.size()){
cout<<"<\n";
continue;
}
if((l < r and a.size()>b.size()) or (l > r and a.size()<b.size())){
cout<<"?\n";
continue;
}
if(l>r){
int in=0, asd=0;
for(auto i:a){
if(i < b[in]){
asd=1;
break;
}
in++;
}
if(asd==1)
cout<<"?\n";
else
cout<<">\n";
}
else{
int in=0, asd=0;
for(auto i:a){
if(i > b[in]){
asd=1;
break;
}
in++;
}
if(asd==1)
cout<<"?\n";
else
cout<<"<\n";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |