oj.uz

답안 #857103

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
857103 2023-10-05T11:33:52 Z Jethro Klasika (COCI20_klasika) C++17
33 / 110
 801 ms 460912 KB 
//Writed by: Jethro_
//----------------------
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second

const int N = 1e6 + 100;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 117596 KB Output is correct
2 Correct 23 ms 117592 KB Output is correct
3 Correct 24 ms 117792 KB Output is correct
4 Correct 23 ms 117852 KB Output is correct
5 Correct 22 ms 117592 KB Output is correct
6 Correct 23 ms 117596 KB Output is correct
7 Correct 23 ms 117596 KB Output is correct
8 Correct 22 ms 117852 KB Output is correct
9 Correct 22 ms 117492 KB Output is correct
10 Correct 22 ms 117720 KB Output is correct
11 Correct 23 ms 117700 KB Output is correct
12 Correct 23 ms 117596 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 117596 KB Output is correct
2 Correct 23 ms 117592 KB Output is correct
3 Correct 24 ms 117792 KB Output is correct
4 Correct 23 ms 117852 KB Output is correct
5 Correct 22 ms 117592 KB Output is correct
6 Correct 23 ms 117596 KB Output is correct
7 Correct 23 ms 117596 KB Output is correct
8 Correct 22 ms 117852 KB Output is correct
9 Correct 22 ms 117492 KB Output is correct
10 Correct 22 ms 117720 KB Output is correct
11 Correct 23 ms 117700 KB Output is correct
12 Correct 23 ms 117596 KB Output is correct
13 Correct 25 ms 118108 KB Output is correct
14 Correct 25 ms 118872 KB Output is correct
15 Correct 28 ms 119384 KB Output is correct
16 Correct 28 ms 120144 KB Output is correct
17 Correct 25 ms 118104 KB Output is correct
18 Correct 25 ms 118616 KB Output is correct
19 Correct 28 ms 119388 KB Output is correct
20 Correct 28 ms 119900 KB Output is correct
21 Correct 24 ms 118108 KB Output is correct
22 Correct 27 ms 118808 KB Output is correct
23 Correct 27 ms 119388 KB Output is correct
24 Correct 28 ms 119896 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 521 ms 185008 KB Output is correct
2 Runtime error 801 ms 460912 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 117596 KB Output is correct
2 Correct 23 ms 117592 KB Output is correct
3 Correct 24 ms 117792 KB Output is correct
4 Correct 23 ms 117852 KB Output is correct
5 Correct 22 ms 117592 KB Output is correct
6 Correct 23 ms 117596 KB Output is correct
7 Correct 23 ms 117596 KB Output is correct
8 Correct 22 ms 117852 KB Output is correct
9 Correct 22 ms 117492 KB Output is correct
10 Correct 22 ms 117720 KB Output is correct
11 Correct 23 ms 117700 KB Output is correct
12 Correct 23 ms 117596 KB Output is correct
13 Correct 25 ms 118108 KB Output is correct
14 Correct 25 ms 118872 KB Output is correct
15 Correct 28 ms 119384 KB Output is correct
16 Correct 28 ms 120144 KB Output is correct
17 Correct 25 ms 118104 KB Output is correct
18 Correct 25 ms 118616 KB Output is correct
19 Correct 28 ms 119388 KB Output is correct
20 Correct 28 ms 119900 KB Output is correct
21 Correct 24 ms 118108 KB Output is correct
22 Correct 27 ms 118808 KB Output is correct
23 Correct 27 ms 119388 KB Output is correct
24 Correct 28 ms 119896 KB Output is correct
25 Correct 521 ms 185008 KB Output is correct
26 Runtime error 801 ms 460912 KB Execution killed with signal 11
27 Halted 0 ms 0 KB -