/*
* Author: Tenjin
* Created: 10.01.2022 15:51
* Why am I so stupid? :c
* Slishkom slab
*/
#include <bits/stdc++.h>
// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)
#define dbg(x) cout << "DEBUG " << #x << " : " << x << "\n";
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
template<typename T> T get_rand(T l, T r) {
random_device rd;
mt19937 gen(rd());
return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }
string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }
template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }
void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }
void freop(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int N = 3e6 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/
void precalc() {
}
int n;
int mx[N], mn[N], add[N];
int a[N], b[N];
void push(int tl, int tr, int v) {
if(!add[v]) return;
if(tl != tr) add[v * 2] += add[v], add[v * 2 + 1] += add[v];
mx[v] += add[v];
mn[v] += add[v];
add[v] = 0;
}
void upd(int l, int r, int ind, int tl = 1, int tr = n, int v = 1) {
push(tl, tr, v);
if(tl > r || tr < l) return;
if(tl >= l && tr <= r) {
add[v] += ind;
push(tl, tr, v);
return;
}
int mid = (tl + tr) >> 1;
upd(l, r, ind, tl, mid, v * 2); upd(l, r, ind, mid + 1, tr, v * 2 + 1);
mx[v] = max(mx[v * 2], mx[v * 2 + 1]);
mn[v] = min(mn[v * 2], mn[v * 2 + 1]);
}
void solve() {
read(n);
rep(i, 1, n + 1) read(a[i], b[i]);
rep(i, 1, n + 1) {
upd(1, a[i], 3 - b[i] * 2);
if(mx[1] >= 0 && mn[1] >= 0) print(">");
else if(mx[1] <= 0 && mn[1] <= 0) print("<");
else print("?");
//dbg(mx[1], mn[1]);
}
}
int main() {
//freop("");
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
//read(t);
precalc();
for (int i = 1; i <= t; ++i) {
//write("Case #" + to_string(i) + ": ");
solve();
}
return 0;
}
Compilation message
stones.cpp: In function 'void freop(std::string)':
stones.cpp:75:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
75 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stones.cpp:76:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
76 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
Output is correct |
| 2 |
Correct |
0 ms |
332 KB |
Output is correct |
| 3 |
Correct |
0 ms |
332 KB |
Output is correct |
| 4 |
Correct |
0 ms |
332 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
324 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
1 ms |
328 KB |
Output is correct |
| 9 |
Correct |
1 ms |
332 KB |
Output is correct |
| 10 |
Correct |
5 ms |
804 KB |
Output is correct |
| 11 |
Correct |
27 ms |
2752 KB |
Output is correct |
| 12 |
Correct |
47 ms |
4944 KB |
Output is correct |
| 13 |
Correct |
59 ms |
5144 KB |
Output is correct |
| 14 |
Correct |
48 ms |
5120 KB |
Output is correct |
| 15 |
Correct |
51 ms |
5144 KB |
Output is correct |
| 16 |
Correct |
52 ms |
5164 KB |
Output is correct |
| 17 |
Correct |
62 ms |
5104 KB |
Output is correct |
| 18 |
Correct |
52 ms |
5160 KB |
Output is correct |
| 19 |
Correct |
41 ms |
5092 KB |
Output is correct |
| 20 |
Correct |
70 ms |
5152 KB |
Output is correct |
| 21 |
Correct |
54 ms |
5136 KB |
Output is correct |
| 22 |
Correct |
49 ms |
5148 KB |
Output is correct |
| 23 |
Correct |
43 ms |
5064 KB |
Output is correct |
| 24 |
Correct |
57 ms |
5132 KB |
Output is correct |
| 25 |
Correct |
63 ms |
5252 KB |
Output is correct |
