oj.uz

답안 #223303

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223303 2020-04-15T07:00:02 Z oolimry Klasika (COCI20_klasika) C++14
33 / 110
 5000 ms 385616 KB 
#include <bits/stdc++.h>

using namespace std;

int n = 1;
int cnt = 0;
vector<int> adj[200005];
int low[200005];
int high[200005];
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;

unordered_map<int, set<int> > 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(int i = 0;i < n;i++) cout << low[i] << " " << high[i] << "\n";
	
	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 <= 32;b++){
				m[b][x].insert(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 = 32;b >= 0;b--){
			if((other & (1<<b)) == 0) cur ^= (1 << b);
			
			set<int> &s = m[b][cur];
			auto it = s.lower_bound(L);
			if(it == s.end() || *it > R) cur ^= (1 << b);
		}
		
		cout << (cur ^ other) << "\n";
		
	}
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5376 KB Output is correct
2 Correct 8 ms 5376 KB Output is correct
3 Correct 9 ms 5632 KB Output is correct
4 Correct 10 ms 5632 KB Output is correct
5 Correct 8 ms 5248 KB Output is correct
6 Correct 8 ms 5376 KB Output is correct
7 Correct 9 ms 5632 KB Output is correct
8 Correct 9 ms 5632 KB Output is correct
9 Correct 8 ms 5248 KB Output is correct
10 Correct 8 ms 5504 KB Output is correct
11 Correct 9 ms 5632 KB Output is correct
12 Correct 9 ms 5632 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5376 KB Output is correct
2 Correct 8 ms 5376 KB Output is correct
3 Correct 9 ms 5632 KB Output is correct
4 Correct 10 ms 5632 KB Output is correct
5 Correct 8 ms 5248 KB Output is correct
6 Correct 8 ms 5376 KB Output is correct
7 Correct 9 ms 5632 KB Output is correct
8 Correct 9 ms 5632 KB Output is correct
9 Correct 8 ms 5248 KB Output is correct
10 Correct 8 ms 5504 KB Output is correct
11 Correct 9 ms 5632 KB Output is correct
12 Correct 9 ms 5632 KB Output is correct
13 Correct 15 ms 7040 KB Output is correct
14 Correct 18 ms 8576 KB Output is correct
15 Correct 25 ms 10112 KB Output is correct
16 Correct 31 ms 11128 KB Output is correct
17 Correct 15 ms 7040 KB Output is correct
18 Correct 19 ms 8576 KB Output is correct
19 Correct 24 ms 9984 KB Output is correct
20 Correct 27 ms 10880 KB Output is correct
21 Correct 16 ms 6912 KB Output is correct
22 Correct 22 ms 8448 KB Output is correct
23 Correct 23 ms 9856 KB Output is correct
24 Correct 31 ms 10880 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2562 ms 153652 KB Output is correct
2 Correct 3911 ms 270924 KB Output is correct
3 Execution timed out 5089 ms 385616 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5376 KB Output is correct
2 Correct 8 ms 5376 KB Output is correct
3 Correct 9 ms 5632 KB Output is correct
4 Correct 10 ms 5632 KB Output is correct
5 Correct 8 ms 5248 KB Output is correct
6 Correct 8 ms 5376 KB Output is correct
7 Correct 9 ms 5632 KB Output is correct
8 Correct 9 ms 5632 KB Output is correct
9 Correct 8 ms 5248 KB Output is correct
10 Correct 8 ms 5504 KB Output is correct
11 Correct 9 ms 5632 KB Output is correct
12 Correct 9 ms 5632 KB Output is correct
13 Correct 15 ms 7040 KB Output is correct
14 Correct 18 ms 8576 KB Output is correct
15 Correct 25 ms 10112 KB Output is correct
16 Correct 31 ms 11128 KB Output is correct
17 Correct 15 ms 7040 KB Output is correct
18 Correct 19 ms 8576 KB Output is correct
19 Correct 24 ms 9984 KB Output is correct
20 Correct 27 ms 10880 KB Output is correct
21 Correct 16 ms 6912 KB Output is correct
22 Correct 22 ms 8448 KB Output is correct
23 Correct 23 ms 9856 KB Output is correct
24 Correct 31 ms 10880 KB Output is correct
25 Correct 2562 ms 153652 KB Output is correct
26 Correct 3911 ms 270924 KB Output is correct
27 Execution timed out 5089 ms 385616 KB Time limit exceeded
28 Halted 0 ms 0 KB -