#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define F first
#define S second
using namespace std;
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
const int inf = 1e9;
int niz[N];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int>a,b;
for(int i = 1; i <= n; i++) {
int x,y;
cin >> x >> y;
x = n - x + 1;
if(y == 1) niz[x]++;
else niz[x]--;
int s = 0,mn = inf,mx = -inf;
for(int j = 0; j < N; j++) {
s += niz[j];
mn = min(mn,s);
mx = max(mx,s);
}
if(mn >= 0) {
cout << ">\n";
}else if(mx <= 0) {
cout << "<\n";
}else {
cout << "?\n";
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
344 KB |
Output is correct |
2 |
Correct |
7 ms |
348 KB |
Output is correct |
3 |
Correct |
16 ms |
468 KB |
Output is correct |
4 |
Correct |
2 ms |
344 KB |
Output is correct |
5 |
Correct |
26 ms |
348 KB |
Output is correct |
6 |
Correct |
35 ms |
344 KB |
Output is correct |
7 |
Correct |
66 ms |
464 KB |
Output is correct |
8 |
Correct |
86 ms |
348 KB |
Output is correct |
9 |
Correct |
77 ms |
344 KB |
Output is correct |
10 |
Correct |
649 ms |
596 KB |
Output is correct |
11 |
Execution timed out |
1029 ms |
1104 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |