oj.uz

Submission #337753

# Submission time Handle Problem Language Result Execution time Memory
337753 2020-12-21T13:38:27 Z amunduzbaev Weighting stones (IZhO11_stones) C++14
100 / 100
 90 ms 9600 KB 
/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
const int N = 1e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll n, m, k, ans, s;
struct node{
	bool flag;
	ll mx, mn, v;
};
node def;
vector<node> tree;

void push(int x, int lx, int rx){
	if(lx == rx){
		tree[x].flag = 0, tree[x].v = 0;
		return;
	}
	if(!tree[x].flag) return;
	tree[(x<<1)].flag = tree[(x<<1)+1].flag = 1;
	tree[(x<<1)].v += tree[x].v; 
	tree[(x<<1)+1].v += tree[x].v;
	tree[(x<<1)].mn += tree[x].v;
	tree[(x<<1)].mx += tree[x].v;
	tree[(x<<1)+1].mn += tree[x].v;
	tree[(x<<1)+1].mx += tree[x].v;
	tree[x].v = tree[x].flag = 0;
	tree[x].mn = min(tree[(x<<1)].mn, tree[(x<<1)+1].mn);
	tree[x].mx = max(tree[(x<<1)].mx, tree[(x<<1)+1].mx);
}

void sett(int l, int r, ll v, int lx, int rx, int x){
	if(lx > r || rx < l) return;
	push(x, lx, rx);
	if(lx >= l && rx <= r) {
		tree[x].flag = 1;
		tree[x].mn += v;
		tree[x].mx += v;
		tree[x].v = v;
		return ;
	}
	int m = (lx + rx)>>1;
	sett(l, r, v, lx, m, (x<<1));
	sett(l, r, v, m+1, rx, (x<<1)+1);
	tree[x].mn = min(tree[(x<<1)].mn, tree[(x<<1)+1].mn);
	tree[x].mx = max(tree[(x<<1)].mx, tree[(x<<1)+1].mx);
}


void solve(){
	fastios
	cin>>n;
	s = 2;
	while(s < n) s<<=1;
	def.flag = 0, def.mn = 0, def.mx = 0, def.v = 0;
	tree.assign(s*2, def);
	for(int i=0;i<n;i++){
		cin>>m>>k;
		sett(1, m, (k == 1 ? -1 : 1), 1, s, 1);
		ll mx = tree[1].mx;
		ll mn = tree[1].mn;
		if(mn >= 0) cout<<"<\n";
		else if(mx <= 0) cout<<">\n";
		else cout<<"?\n";
	}
	
	return;
}


int main(){
	fastios
	int t = 1;
	if(t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 6 ms 1388 KB Output is correct
11 Correct 48 ms 5100 KB Output is correct
12 Correct 90 ms 9452 KB Output is correct
13 Correct 72 ms 9452 KB Output is correct
14 Correct 60 ms 9452 KB Output is correct
15 Correct 62 ms 9600 KB Output is correct
16 Correct 61 ms 9452 KB Output is correct
17 Correct 66 ms 9452 KB Output is correct
18 Correct 65 ms 9452 KB Output is correct
19 Correct 64 ms 9472 KB Output is correct
20 Correct 64 ms 9452 KB Output is correct
21 Correct 65 ms 9452 KB Output is correct
22 Correct 65 ms 9452 KB Output is correct
23 Correct 64 ms 9452 KB Output is correct
24 Correct 63 ms 9452 KB Output is correct
25 Correct 64 ms 9452 KB Output is correct