oj.uz

Submission #223351

# Submission time Handle Problem Language Result Execution time Memory
223351 2020-04-15T07:40:29 Z oolimry Klasika (COCI20_klasika) C++14
33 / 110
 5000 ms 424360 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int n = 1;
int cnt = 0;
static vector<int> adj[200005];
static int low[200005];
static int high[200005];
static int XOR[200005];
 
void dfs(int u){
	low[u] = cnt;
	high[u] = cnt;
	cnt++;
	for(int v : adj[u]){
		dfs(v);
		high[u] = max(high[u], high[v]);
	}
}
 
typedef pair<int,int> ii;
vector<ii> queries;

struct seg{
	vector<int> dis;
	vector<bool> tree;
	
	int N;
	
	void get(int l){
		dis.push_back(l);
	}
	
	void getReady(){
		N = dis.size();
		tree.assign(2*N,0);
		//cout << tree.size() << endl;
		sort(dis.begin(),dis.end());
	}
	
	void update(int i){
		i = lower_bound(dis.begin(),dis.end(), i) - dis.begin();
		for(i += N;i > 0;i >>= 1) tree[i] = 1;
	}
	
	int query(int l, int r){
		int res = 0;
		l = lower_bound(dis.begin(),dis.end(), l) - dis.begin();
		r = upper_bound(dis.begin(),dis.end(), r) - dis.begin();
		for(l += N, r += N;l < r;l >>= 1, r >>= 1){
			if(l&1) res |= tree[l++];
			if(r&1) res |= tree[--r];
		}
		return res;
	}
};

static unordered_map<int, seg> m[33];



int main(){
	//freopen("i.txt","r",stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int Q; cin >> Q;
	queries.push_back(ii(-1,0));
	
	while(Q--){
		string s; int a, b; 
		cin >> s >> a >> b;
		if(s[0] == 'A' || s[0] == 'a'){
			a--;
			assert(a < n);
			adj[a].push_back(n);
			XOR[n] = XOR[a] ^ b;
			queries.push_back(ii(-1,n));
			n++;
		}
		else{
			assert(a-1 < n);
			assert(b-1 < n);
			queries.push_back(ii(a-1,b-1));
		}
	}
	
	
	dfs(0);
	
	for(ii q : queries){
		//cout << q.first << " " << q.second << "\n";
		
		if(q.first == -1){
			int pos = low[q.second];
			int x = XOR[q.second];
			
			for(int b = 0;b <= 30;b++){
				m[b][x].get(pos);
				x ^= ((x & (1<<b)));
			}
			
			continue;
		}
	}
	
	unordered_map<int,seg> k;
	for(int b = 0;b <= 30;b++){
		for(auto &x : m[b]){
			(x.second).getReady();
		}
	}
		
	for(ii q : queries){
		//cout << q.first << " " << q.second << "\n";
		
		if(q.first == -1){
			int pos = low[q.second];
			int x = XOR[q.second];
			
			for(int b = 0;b <= 30;b++){
				m[b][x].update(pos);
				x ^= ((x & (1<<b)));
			}
			
			continue;
		}
		
		int other = XOR[q.first];
		int L = low[q.second], R = high[q.second];
		int cur = 0;
		for(int b = 30;b >= 0;b--){
			if((other & (1<<b)) == 0) cur ^= (1 << b);
			
			if(m[b][cur].query(L,R) == 0) cur ^= (1 << b);
		}
		
		cout << (cur ^ other) << "\n";
		
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5376 KB Output is correct
2 Correct 10 ms 5504 KB Output is correct
3 Correct 9 ms 5632 KB Output is correct
4 Correct 9 ms 5772 KB Output is correct
5 Correct 8 ms 5248 KB Output is correct
6 Correct 8 ms 5504 KB Output is correct
7 Correct 8 ms 5632 KB Output is correct
8 Correct 9 ms 5760 KB Output is correct
9 Correct 8 ms 5376 KB Output is correct
10 Correct 9 ms 5504 KB Output is correct
11 Correct 9 ms 5632 KB Output is correct
12 Correct 9 ms 5760 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5376 KB Output is correct
2 Correct 10 ms 5504 KB Output is correct
3 Correct 9 ms 5632 KB Output is correct
4 Correct 9 ms 5772 KB Output is correct
5 Correct 8 ms 5248 KB Output is correct
6 Correct 8 ms 5504 KB Output is correct
7 Correct 8 ms 5632 KB Output is correct
8 Correct 9 ms 5760 KB Output is correct
9 Correct 8 ms 5376 KB Output is correct
10 Correct 9 ms 5504 KB Output is correct
11 Correct 9 ms 5632 KB Output is correct
12 Correct 9 ms 5760 KB Output is correct
13 Correct 17 ms 7296 KB Output is correct
14 Correct 22 ms 8832 KB Output is correct
15 Correct 28 ms 10360 KB Output is correct
16 Correct 29 ms 11264 KB Output is correct
17 Correct 17 ms 7168 KB Output is correct
18 Correct 21 ms 8832 KB Output is correct
19 Correct 34 ms 10300 KB Output is correct
20 Correct 31 ms 11128 KB Output is correct
21 Correct 17 ms 7168 KB Output is correct
22 Correct 21 ms 8704 KB Output is correct
23 Correct 26 ms 10104 KB Output is correct
24 Correct 33 ms 11128 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2915 ms 148084 KB Output is correct
2 Correct 4056 ms 251032 KB Output is correct
3 Correct 4987 ms 346848 KB Output is correct
4 Execution timed out 5075 ms 424360 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5376 KB Output is correct
2 Correct 10 ms 5504 KB Output is correct
3 Correct 9 ms 5632 KB Output is correct
4 Correct 9 ms 5772 KB Output is correct
5 Correct 8 ms 5248 KB Output is correct
6 Correct 8 ms 5504 KB Output is correct
7 Correct 8 ms 5632 KB Output is correct
8 Correct 9 ms 5760 KB Output is correct
9 Correct 8 ms 5376 KB Output is correct
10 Correct 9 ms 5504 KB Output is correct
11 Correct 9 ms 5632 KB Output is correct
12 Correct 9 ms 5760 KB Output is correct
13 Correct 17 ms 7296 KB Output is correct
14 Correct 22 ms 8832 KB Output is correct
15 Correct 28 ms 10360 KB Output is correct
16 Correct 29 ms 11264 KB Output is correct
17 Correct 17 ms 7168 KB Output is correct
18 Correct 21 ms 8832 KB Output is correct
19 Correct 34 ms 10300 KB Output is correct
20 Correct 31 ms 11128 KB Output is correct
21 Correct 17 ms 7168 KB Output is correct
22 Correct 21 ms 8704 KB Output is correct
23 Correct 26 ms 10104 KB Output is correct
24 Correct 33 ms 11128 KB Output is correct
25 Correct 2915 ms 148084 KB Output is correct
26 Correct 4056 ms 251032 KB Output is correct
27 Correct 4987 ms 346848 KB Output is correct
28 Execution timed out 5075 ms 424360 KB Time limit exceeded
29 Halted 0 ms 0 KB -