oj.uz

답안 #447630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447630 2021-07-27T07:09:33 Z Esquire Klasika (COCI20_klasika) C++17
33 / 110
 1813 ms 524292 KB 
#include<bits/stdc++.h>
using namespace std ; 
typedef long long ll ; 
typedef pair <int ,int> pii ; 
const int MAXN = 2e5 + 5; 
const int MOD = 1e9 + 7 ; 

#define F first 
#define S second 
#define debug(x) cerr << #x << " :" << x << "\n" 

int q ,n ,st[MAXN] ,ed[MAXN] ,child[MAXN * 31][2] ,newint ,a[MAXN] ,b[MAXN] ,dist[MAXN] ,tme ,idx[MAXN] ,len ,root ,x;  
vector <pii> G[MAXN] ; 
set <int> s[MAXN * 31] ; 
string sq[MAXN] ; 

void dfs(int &u){
	st[u] = tme++ ; 
	for (auto [v ,w] : G[u]){
		dist[v] = dist[u] ^ w ; 
		dfs(v) ; 
	}
	ed[u] = tme++ ; 
}

void add(int &p ,int &id){
	root = 0 ; 
	for (int i = 30; i >= 0; i--){
		x = (p >> i) & 1 ;
		if (child[root][x] == -1){
			child[root][x] = ++newint ; 
		}
		root = child[root][x] ; 
		s[root].insert(st[id]) ;
	}
}

bool check(int &id ,int &v){
	if (s[id].lower_bound(st[v]) == s[id].end()){
		return false ; 
	}
	return (*s[id].lower_bound(st[v])) <= ed[v] ; 
}

void ans(int &u ,int &v){ 
	len = dist[u] ; 
	root = 0 ; 
	for (int i = 30; i >= 0; i--){
		x = (len >> i) & 1 ; 
		if (child[root][1 - x] != -1 && check(child[root][1 - x] ,v)){
			root = child[root][1 - x] ; 
			if (!x){
				len += (1 << i) ; 
			}
		}
		else {
			if (x == 1){
				len -= (1 << i) ; 
			}
			root = child[root][x] ; 
		}
	}
	cout << len << "\n" ; 
}

int main (){
	ios::sync_with_stdio(false); cin.tie(0) ;cout.tie(0) ; 
	memset(child ,-1 ,sizeof child) ; 
	cin >> q ; 
	n = 1 ;
	for (int i = 1; i <= q; i++){
		cin >> sq[i] >> a[i] >> b[i] ; 
		if (sq[i][0] == 'A'){
			n++ ; 
			G[a[i]].push_back({n ,b[i]}) ; 
			idx[i] = n ; 
		}
	}
	int tmp = 1;
	dfs(tmp) ;
	add(dist[1] ,tmp) ; 
	for (int i = 1; i <= q; i++){
		if (sq[i][0] == 'Q'){
			ans(a[i] ,b[i]) ; 
		}
		else {
			add(dist[idx[i]] ,idx[i]) ;
		}
	}
	return 0 ; 
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 177 ms 351036 KB Output is correct
2 Correct 177 ms 351144 KB Output is correct
3 Correct 171 ms 351172 KB Output is correct
4 Correct 173 ms 351232 KB Output is correct
5 Correct 177 ms 351056 KB Output is correct
6 Correct 176 ms 351040 KB Output is correct
7 Correct 173 ms 351192 KB Output is correct
8 Correct 172 ms 351156 KB Output is correct
9 Correct 174 ms 351056 KB Output is correct
10 Correct 173 ms 351160 KB Output is correct
11 Correct 175 ms 351248 KB Output is correct
12 Correct 175 ms 351164 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 177 ms 351036 KB Output is correct
2 Correct 177 ms 351144 KB Output is correct
3 Correct 171 ms 351172 KB Output is correct
4 Correct 173 ms 351232 KB Output is correct
5 Correct 177 ms 351056 KB Output is correct
6 Correct 176 ms 351040 KB Output is correct
7 Correct 173 ms 351192 KB Output is correct
8 Correct 172 ms 351156 KB Output is correct
9 Correct 174 ms 351056 KB Output is correct
10 Correct 173 ms 351160 KB Output is correct
11 Correct 175 ms 351248 KB Output is correct
12 Correct 175 ms 351164 KB Output is correct
13 Correct 173 ms 351692 KB Output is correct
14 Correct 177 ms 352404 KB Output is correct
15 Correct 181 ms 352932 KB Output is correct
16 Correct 179 ms 353508 KB Output is correct
17 Correct 174 ms 351624 KB Output is correct
18 Correct 180 ms 352240 KB Output is correct
19 Correct 179 ms 352864 KB Output is correct
20 Correct 181 ms 353292 KB Output is correct
21 Correct 177 ms 351764 KB Output is correct
22 Correct 177 ms 352256 KB Output is correct
23 Correct 180 ms 352768 KB Output is correct
24 Correct 183 ms 353412 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1018 ms 417260 KB Output is correct
2 Correct 1587 ms 479620 KB Output is correct
3 Runtime error 1813 ms 524292 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 177 ms 351036 KB Output is correct
2 Correct 177 ms 351144 KB Output is correct
3 Correct 171 ms 351172 KB Output is correct
4 Correct 173 ms 351232 KB Output is correct
5 Correct 177 ms 351056 KB Output is correct
6 Correct 176 ms 351040 KB Output is correct
7 Correct 173 ms 351192 KB Output is correct
8 Correct 172 ms 351156 KB Output is correct
9 Correct 174 ms 351056 KB Output is correct
10 Correct 173 ms 351160 KB Output is correct
11 Correct 175 ms 351248 KB Output is correct
12 Correct 175 ms 351164 KB Output is correct
13 Correct 173 ms 351692 KB Output is correct
14 Correct 177 ms 352404 KB Output is correct
15 Correct 181 ms 352932 KB Output is correct
16 Correct 179 ms 353508 KB Output is correct
17 Correct 174 ms 351624 KB Output is correct
18 Correct 180 ms 352240 KB Output is correct
19 Correct 179 ms 352864 KB Output is correct
20 Correct 181 ms 353292 KB Output is correct
21 Correct 177 ms 351764 KB Output is correct
22 Correct 177 ms 352256 KB Output is correct
23 Correct 180 ms 352768 KB Output is correct
24 Correct 183 ms 353412 KB Output is correct
25 Correct 1018 ms 417260 KB Output is correct
26 Correct 1587 ms 479620 KB Output is correct
27 Runtime error 1813 ms 524292 KB Execution killed with signal 9
28 Halted 0 ms 0 KB -