oj.uz

Submission #857099

# Submission time Handle Problem Language Result Execution time Memory
857099 2023-10-05T11:31:54 Z Jethro Klasika (COCI20_klasika) C++17
33 / 110
 1127 ms 524288 KB 
//Writed by: Jethro_
//----------------------
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second

const int N = 3e6 + 10;
int n, node = 1, i, root, val, in[N], out[N], cnt = 0, Xor[N], LG = 31, child[N][2], cnt2 = 0;
vector<pair<int, int>> a[N];
set<int> save[N];
pair<int, int> query[N];
string type[N];

void add() {
    cin >> n;
    for(i = 1; i <= n; ++i) {
        cin >> type[i];
        if(type[i] == "Add") {
            cin >> root >> val;
            a[++node].push_back({root, val});
            a[root].push_back({node, val});
            
            query[i] = {node, node};
            
        }else {
            cin >> root >> val;
            query[i] = {root, val};
        }
    }
}
void dfs(int u, int p) {
    in[u] = ++cnt;
    for(auto [v, w] : a[u]) {
        if(v == p) continue;
        Xor[v] = Xor[u] ^ w;
        dfs(v, u);
    }

    out[u] = cnt;
}
void ADD(int s, int id) {
    int u = 0;

    for(int i = LG; i >= 0; --i) {
        int k = (s >> i) & 1;
        if(child[u][k] == -1) {
            child[u][k] = ++cnt2;
        }
        u = child[u][k];
        save[u].insert(in[id]);
    }
}
void get(int s, int l, int r) {
    int u = 0, res = 0;
    for(int i = LG; i >= 0; --i) {
        int k = (s >> i) & 1, t = child[u][k ^ 1];
        if(t != -1){
            auto x = save[t].lower_bound(l);
            if(x != save[t].end() && (*x) <= r) {
                u = t;
                res += (1 << i);
            }else {
               u = child[u][k];
            }
        }else {
            u = child[u][k];
        }
    }
    cout << res << '\n';
}
void solve() {

    memset(child, -1, sizeof child);
    dfs(1, 0);
    ADD(0, 1);
    
    for(i = 1; i <= n; ++i) {
        auto [x, y] = query[i];
        if(type[i] == "Add") {
            ADD(Xor[x], y);
        }else {
            int now = Xor[x];
            get(now, in[y], out[y]);
        }
    }
}
int main() {

    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    add();
    solve();

}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 332932 KB Output is correct
2 Correct 64 ms 333040 KB Output is correct
3 Correct 62 ms 333140 KB Output is correct
4 Correct 62 ms 333140 KB Output is correct
5 Correct 64 ms 332884 KB Output is correct
6 Correct 64 ms 333048 KB Output is correct
7 Correct 73 ms 333140 KB Output is correct
8 Correct 63 ms 333136 KB Output is correct
9 Correct 62 ms 333116 KB Output is correct
10 Correct 62 ms 333140 KB Output is correct
11 Correct 62 ms 333240 KB Output is correct
12 Correct 64 ms 333140 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 332932 KB Output is correct
2 Correct 64 ms 333040 KB Output is correct
3 Correct 62 ms 333140 KB Output is correct
4 Correct 62 ms 333140 KB Output is correct
5 Correct 64 ms 332884 KB Output is correct
6 Correct 64 ms 333048 KB Output is correct
7 Correct 73 ms 333140 KB Output is correct
8 Correct 63 ms 333136 KB Output is correct
9 Correct 62 ms 333116 KB Output is correct
10 Correct 62 ms 333140 KB Output is correct
11 Correct 62 ms 333240 KB Output is correct
12 Correct 64 ms 333140 KB Output is correct
13 Correct 65 ms 333576 KB Output is correct
14 Correct 65 ms 334400 KB Output is correct
15 Correct 70 ms 335184 KB Output is correct
16 Correct 76 ms 335640 KB Output is correct
17 Correct 66 ms 333696 KB Output is correct
18 Correct 66 ms 334276 KB Output is correct
19 Correct 67 ms 334928 KB Output is correct
20 Correct 69 ms 335416 KB Output is correct
21 Correct 70 ms 333704 KB Output is correct
22 Correct 66 ms 334160 KB Output is correct
23 Correct 67 ms 334928 KB Output is correct
24 Correct 68 ms 335444 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 542 ms 400500 KB Output is correct
2 Correct 957 ms 464444 KB Output is correct
3 Runtime error 1127 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 332932 KB Output is correct
2 Correct 64 ms 333040 KB Output is correct
3 Correct 62 ms 333140 KB Output is correct
4 Correct 62 ms 333140 KB Output is correct
5 Correct 64 ms 332884 KB Output is correct
6 Correct 64 ms 333048 KB Output is correct
7 Correct 73 ms 333140 KB Output is correct
8 Correct 63 ms 333136 KB Output is correct
9 Correct 62 ms 333116 KB Output is correct
10 Correct 62 ms 333140 KB Output is correct
11 Correct 62 ms 333240 KB Output is correct
12 Correct 64 ms 333140 KB Output is correct
13 Correct 65 ms 333576 KB Output is correct
14 Correct 65 ms 334400 KB Output is correct
15 Correct 70 ms 335184 KB Output is correct
16 Correct 76 ms 335640 KB Output is correct
17 Correct 66 ms 333696 KB Output is correct
18 Correct 66 ms 334276 KB Output is correct
19 Correct 67 ms 334928 KB Output is correct
20 Correct 69 ms 335416 KB Output is correct
21 Correct 70 ms 333704 KB Output is correct
22 Correct 66 ms 334160 KB Output is correct
23 Correct 67 ms 334928 KB Output is correct
24 Correct 68 ms 335444 KB Output is correct
25 Correct 542 ms 400500 KB Output is correct
26 Correct 957 ms 464444 KB Output is correct
27 Runtime error 1127 ms 524288 KB Execution killed with signal 9
28 Halted 0 ms 0 KB -