#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (100005)
ll N, adjsame = 0;
set<ll> side1, side2;
bool side[MAXN];
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);
cin>>N;
for(ll i = 0;i < N;i++){
ll R,S;
cin>>R>>S;
if(S == 1){
side[R] = 0;
side1.insert(R);
auto it = side2.upper_bound(R);
if(!side2.empty() && it != side2.begin()){
it--;
side2.erase(it);
}
}else{
side[R] = 1;
side2.insert(R);
auto it = side1.upper_bound(R);
if(!side1.empty() && it != side1.begin()){
it--;
side1.erase(it);
}
}
if(!side1.empty() && !side2.empty()) cout<<'?'<<'\n';
else if(!side1.empty()) cout<<'>'<<'\n';
else cout<<'<'<<'\n';
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
