| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 328463 | 2020-11-16T16:51:44 Z | BeanZ | Klasika (COCI20_klasika) | C++14 | 973 ms | 280332 KB |
// I_Love_LPL
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define endl '\n'
const int N = 2e5 + 5;
const int mod = 123456789;
const long long oo = 1e18;
ll timer = 1, timer2 = 0, timer3 = 1;
ll cost[N], tin[N], tout[N], dp[N * 4][2];
vector<ll> node[N];
set<ll> mem[N * 4];
void dfs(ll u){
timer2++;
tin[u] = timer2;
for (auto j : node[u]){
dfs(j);
}
tout[u] = timer2;
}
void add(ll u, ll p){
ll now = 1;
for (int i = 30; i >= 0; i--){
ll a = ((u & (1 << i)) > 0);
if (dp[now][a] == 0){
timer3++;
dp[now][a] = timer3;
}
now = dp[now][a];
mem[now].insert(p);
}
}
ll get(ll u, ll l, ll r){
ll now = 1;
ll res = 0;
for (int i = 30; i >= 0; i--){
ll a = ((u & (1 << i)) > 0);
ll id = dp[now][1 - a];
bool flag = true;
auto it = mem[id].lower_bound(l);
if (it == mem[id].end() || (*it) > r) flag = false;
if (flag){
res = res + (1 << i);
now = id;
} else {
now = dp[now][a];
}
/*
if (u == 0){
if (it == mem[id].end()) cout << -1 << " ";
else cout << (*it) << " ";
cout << id << " ";
}*/
}
//cout << now << " " << res << endl;
return res;
}
string task[N];
ll x[N], y[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("A.inp", "r")){
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
ll q;
cin >> q;
for (int i = 1; i <= q; i++){
cin >> task[i];
if (task[i] == "Add"){
cin >> x[i] >> y[i];
timer++;
cost[timer] = cost[x[i]] ^ y[i];
node[x[i]].push_back(timer);
x[i] = timer;
} else {
cin >> x[i] >> y[i];
}
}
dfs(1);
add(0, tin[1]);
for (int i = 1; i <= q; i++){
if (task[i] == "Add"){
add(cost[x[i]], tin[x[i]]);
} else {
cout << get(cost[x[i]], tin[y[i]], tout[y[i]]) << endl;
}
}
//cout << dp[1][0] << endl;
}
/*
3
Add 1 9
Add 2 3
Query 1 2
*/
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 33 ms | 49004 KB | Output is correct |
| 2 | Correct | 33 ms | 49004 KB | Output is correct |
| 3 | Correct | 33 ms | 49132 KB | Output is correct |
| 4 | Correct | 33 ms | 49132 KB | Output is correct |
| 5 | Correct | 34 ms | 49004 KB | Output is correct |
| 6 | Correct | 33 ms | 49004 KB | Output is correct |
| 7 | Correct | 33 ms | 49132 KB | Output is correct |
| 8 | Correct | 33 ms | 49132 KB | Output is correct |
| 9 | Correct | 33 ms | 49004 KB | Output is correct |
| 10 | Correct | 33 ms | 49004 KB | Output is correct |
| 11 | Correct | 34 ms | 49176 KB | Output is correct |
| 12 | Correct | 35 ms | 49184 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 33 ms | 49004 KB | Output is correct |
| 2 | Correct | 33 ms | 49004 KB | Output is correct |
| 3 | Correct | 33 ms | 49132 KB | Output is correct |
| 4 | Correct | 33 ms | 49132 KB | Output is correct |
| 5 | Correct | 34 ms | 49004 KB | Output is correct |
| 6 | Correct | 33 ms | 49004 KB | Output is correct |
| 7 | Correct | 33 ms | 49132 KB | Output is correct |
| 8 | Correct | 33 ms | 49132 KB | Output is correct |
| 9 | Correct | 33 ms | 49004 KB | Output is correct |
| 10 | Correct | 33 ms | 49004 KB | Output is correct |
| 11 | Correct | 34 ms | 49176 KB | Output is correct |
| 12 | Correct | 35 ms | 49184 KB | Output is correct |
| 13 | Correct | 37 ms | 49704 KB | Output is correct |
| 14 | Correct | 38 ms | 50284 KB | Output is correct |
| 15 | Correct | 40 ms | 51052 KB | Output is correct |
| 16 | Correct | 42 ms | 51692 KB | Output is correct |
| 17 | Correct | 36 ms | 49772 KB | Output is correct |
| 18 | Correct | 38 ms | 50284 KB | Output is correct |
| 19 | Correct | 39 ms | 50924 KB | Output is correct |
| 20 | Correct | 41 ms | 51564 KB | Output is correct |
| 21 | Correct | 36 ms | 49644 KB | Output is correct |
| 22 | Correct | 38 ms | 50284 KB | Output is correct |
| 23 | Correct | 40 ms | 50924 KB | Output is correct |
| 24 | Correct | 42 ms | 51564 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 896 ms | 118144 KB | Output is correct |
| 2 | Runtime error | 973 ms | 280332 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 3 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 33 ms | 49004 KB | Output is correct |
| 2 | Correct | 33 ms | 49004 KB | Output is correct |
| 3 | Correct | 33 ms | 49132 KB | Output is correct |
| 4 | Correct | 33 ms | 49132 KB | Output is correct |
| 5 | Correct | 34 ms | 49004 KB | Output is correct |
| 6 | Correct | 33 ms | 49004 KB | Output is correct |
| 7 | Correct | 33 ms | 49132 KB | Output is correct |
| 8 | Correct | 33 ms | 49132 KB | Output is correct |
| 9 | Correct | 33 ms | 49004 KB | Output is correct |
| 10 | Correct | 33 ms | 49004 KB | Output is correct |
| 11 | Correct | 34 ms | 49176 KB | Output is correct |
| 12 | Correct | 35 ms | 49184 KB | Output is correct |
| 13 | Correct | 37 ms | 49704 KB | Output is correct |
| 14 | Correct | 38 ms | 50284 KB | Output is correct |
| 15 | Correct | 40 ms | 51052 KB | Output is correct |
| 16 | Correct | 42 ms | 51692 KB | Output is correct |
| 17 | Correct | 36 ms | 49772 KB | Output is correct |
| 18 | Correct | 38 ms | 50284 KB | Output is correct |
| 19 | Correct | 39 ms | 50924 KB | Output is correct |
| 20 | Correct | 41 ms | 51564 KB | Output is correct |
| 21 | Correct | 36 ms | 49644 KB | Output is correct |
| 22 | Correct | 38 ms | 50284 KB | Output is correct |
| 23 | Correct | 40 ms | 50924 KB | Output is correct |
| 24 | Correct | 42 ms | 51564 KB | Output is correct |
| 25 | Correct | 896 ms | 118144 KB | Output is correct |
| 26 | Runtime error | 973 ms | 280332 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 27 | Halted | 0 ms | 0 KB | - |