#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, v[N], c[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), v[x]--;
else
b.pb(x), r=max(r, x), v[x]++;
int asd=0;
for(int j=n; j>=1; j--){
c[j]=c[j+1]+v[j];
if((c[j]>0 and l>r) or (c[j]<0 and l<r)){
cout<<"?\n", asd=1;
break;
}
}
if(asd==0){
if(l>r)
cout<<">\n";
else
cout<<"<\n";
}
for(int j=1; j<=n; j++)
c[j]=0;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
3 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
4 ms |
376 KB |
Output is correct |
6 |
Correct |
4 ms |
380 KB |
Output is correct |
7 |
Correct |
6 ms |
376 KB |
Output is correct |
8 |
Correct |
7 ms |
380 KB |
Output is correct |
9 |
Correct |
7 ms |
380 KB |
Output is correct |
10 |
Correct |
108 ms |
632 KB |
Output is correct |
11 |
Execution timed out |
1074 ms |
1608 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |