#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
struct custom_hash
{
template<class T>
unsigned long long operator()(T v) const
{
unsigned long long x = v;
x += FIXED_RANDOM;
// x += 11400714819323198485ull;
// x = (x ^ (x >> 30)) * 13787848793156543929ull;
x = (x ^ (x >> 27)) * 10723151780598845931ull;
return x ^ (x >> 31);
}
};
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;
template<class T>
T randomize(T mod)
{
return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
x = 0;
bool negative = false;
char c = ' ';
while (c < '-')
{
c = getchar();
}
if (c == '-')
{
negative = true;
c = getchar();
}
while (c >= '0')
{
x = x * 10 + (c - '0');
c = getchar();
}
if (negative)
{
x = -x;
}
}
template<class T>
void printi(T output)
{
if (output == 0)
{
putchar('0');
return;
}
if (output < 0)
{
putchar('-');
output = -output;
}
int buf[20], n = 0;
while(output)
{
buf[n] = ((output % 10));
output /= 10;
n++;
}
for (n--; n >= 0; n--)
{
putchar(buf[n] + '0');
}
return;
}
template<class T>
void ckmin(T &a, T b)
{
a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
return (b ? gcd(b, a % b) : a);
}
#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;
#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;
int N;
pii arr[MAXN];
struct segtree
{
int seg[4 * MAXN], lazy[4 * MAXN];
int DNE = INF;
int comb(int a, int b)
{
return min(a, b);
}
void push(int w, int L, int R)
{
seg[w] += lazy[w];
if (L != R)
{
lazy[w << 1] += lazy[w];
lazy[w << 1 | 1] += lazy[w];
}
lazy[w] = 0;
return;
}
void update(int w, int L, int R, int a, int b, int v)
{
push(w, L, R);
if (b < L || R < a)
{
return;
}
if (R <= b && a <= L)
{
lazy[w] += v;
push(w, L, R);
return;
}
int mid = (L + R) >> 1;
update(w << 1, L, mid, a, b, v);
update(w << 1 | 1, mid + 1, R, a, b, v);
seg[w] = comb(seg[w << 1], seg[w << 1 | 1]);
return;
}
int query(int w, int L, int R, int a, int b)
{
push(w, L, R);
if (b < L || R < a)
{
return DNE;
}
if (a <= L && R <= b)
{
return seg[w];
}
int mid = (L + R) >> 1;
return comb(query(w << 1, L, mid, a, b), query(w << 1 | 1, mid + 1, R, a, b));
}
};
segtree ok[2];
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// cout << fixed << setprecision(10);
// cerr << fixed << setprecision(10);
// if (fopen("file.in", "r"))
// {
// freopen ("file.in", "r", stdin);
// freopen ("file.out", "w", stdout);
// }
cin >> N;
FOR(i, 0, N)
{
cin >> arr[i].fi >> arr[i].se;
arr[i].fi--; arr[i].se--;
ok[arr[i].se].update(1, 0, N - 1, 0, arr[i].fi, 1);
ok[arr[i].se ^ 1].update(1, 0, N - 1, 0, arr[i].fi, -1);
if (ok[0].query(1, 0, N - 1, 0, N - 1) >= 0)
{
cout << ">\n";
}
else if (ok[1].query(1, 0, N - 1, 0, N - 1) >= 0)
{
cout << "<\n";
}
else
{
cout << "?\n";
}
}
//you insert a #, and find the smallest prefix sum!
// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
3 ms |
504 KB |
Output is correct |
| 8 |
Correct |
2 ms |
504 KB |
Output is correct |
| 9 |
Correct |
3 ms |
504 KB |
Output is correct |
| 10 |
Correct |
8 ms |
1016 KB |
Output is correct |
| 11 |
Correct |
53 ms |
3448 KB |
Output is correct |
| 12 |
Correct |
87 ms |
6052 KB |
Output is correct |
| 13 |
Correct |
69 ms |
6264 KB |
Output is correct |
| 14 |
Correct |
73 ms |
6264 KB |
Output is correct |
| 15 |
Correct |
117 ms |
6404 KB |
Output is correct |
| 16 |
Correct |
71 ms |
6264 KB |
Output is correct |
| 17 |
Correct |
70 ms |
6264 KB |
Output is correct |
| 18 |
Correct |
73 ms |
6264 KB |
Output is correct |
| 19 |
Correct |
72 ms |
6264 KB |
Output is correct |
| 20 |
Correct |
75 ms |
6264 KB |
Output is correct |
| 21 |
Correct |
71 ms |
6264 KB |
Output is correct |
| 22 |
Correct |
70 ms |
6264 KB |
Output is correct |
| 23 |
Correct |
69 ms |
6264 KB |
Output is correct |
| 24 |
Correct |
75 ms |
6264 KB |
Output is correct |
| 25 |
Correct |
74 ms |
6264 KB |
Output is correct |
