oj.uz

Submission #1088851

# Submission time Handle Problem Language Result Execution time Memory
1088851 2024-09-15T10:17:25 Z vladilius Klasika (COCI20_klasika) C++17
33 / 110
 189 ms 185588 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
#define arr3 array<int, 3>
const int lg = 31;
const int inf = 1e7;

struct node{
    int nt[2];
};

node t[inf];
int cc = 0;

struct TR{
    int k;
    void init(){
        t[++cc] = {};
        t[++cc] = {};
        k = cc;
    }
    void add(int x){
        int v = k;
        for (int i = lg; i >= 0; i--){
            bool bit = (x >> i) & 1;
            if (!t[v].nt[bit]){
                t[v].nt[bit] = ++cc;
            }
            v = t[v].nt[bit];
        }
    }
    int get(int x){
        int out = 0, v = k;
        for (int i = lg; i >= 0; i--){
            bool bit = (x >> i) & 1;
            if (t[v].nt[!bit]){
                v = t[v].nt[!bit];
                out += (1 << i);
                continue;
            }
            v = t[v].nt[bit];
        }
        return out;
    }
};

struct ST{
    vector<TR> t;
    int n;
    ST(int ns){
        n = ns;
        t.resize(4 * n);
        for (int i = 0; i < 4 * n; i++){
            t[i].init();
        }
    }
    void add(int v, int tl, int tr, int& p, int& x){
        t[v].add(x);
        if (tl == tr) return;
        int tm = (tl + tr) / 2, vv = 2 * v;
        if (p <= tm){
            add(vv, tl, tm, p, x);
        }
        else {
            add(vv + 1, tm + 1, tr, p, x);
        }
    }
    void add(int p, int x){
        add(1, 1, n, p, x);
    }
    int get(int v, int tl, int tr, int& l, int& r, int& x){
        if (l > tr || r < tl) return 0;
        if (l <= tl && tr <= r){
            return t[v].get(x);
        }
        int tm = (tl + tr) / 2, vv = 2 * v;
        return max(get(vv, tl, tm, l, r, x), get(vv + 1, tm + 1, tr, l, r, x));
    }
    int get(int l, int r, int x){
        return get(1, 1, n, l, r, x);
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    for (int i = 0; i < inf; i++) t[i].nt[0] = t[i].nt[1] = 0;
    
    int q, cc = 1; cin>>q;
    vector<arr3> qs;
    vector<pii> g[q + 1];
    for (int i = 1; i <= q; i++){
        string type; int x, y; cin>>type>>x>>y;
        if (type[0] == 'A'){
            cc++;
            g[x].pb({cc, y});
            qs.pb({0, x, cc});
        }
        else {
            qs.pb({1, x, y});
        }
    }
    int n = cc;
    vector<int> tin(n + 1), tout(n + 1), d(n + 1);
    int timer = 0;
    function<void(int)> fill = [&](int v){
        tin[v] = ++timer;
        for (auto [i, w]: g[v]){
            d[i] = d[v] ^ w;
            fill(i);
        }
        tout[v] = timer;
    };
    fill(1);
    
    ST T(n);
    T.add(1, 0);
    for (auto [type, x, y]: qs){
        if (!type){
            T.add(tin[y], d[y]);
        }
        else {
            cout<<T.get(tin[y], tout[y], d[x])<<"\n";
        }
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 78672 KB Output is correct
2 Correct 30 ms 78684 KB Output is correct
3 Correct 29 ms 78708 KB Output is correct
4 Correct 31 ms 78588 KB Output is correct
5 Correct 31 ms 78676 KB Output is correct
6 Correct 31 ms 78936 KB Output is correct
7 Correct 30 ms 78612 KB Output is correct
8 Correct 29 ms 78664 KB Output is correct
9 Correct 31 ms 78684 KB Output is correct
10 Correct 29 ms 78676 KB Output is correct
11 Correct 31 ms 78676 KB Output is correct
12 Correct 29 ms 78672 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 78672 KB Output is correct
2 Correct 30 ms 78684 KB Output is correct
3 Correct 29 ms 78708 KB Output is correct
4 Correct 31 ms 78588 KB Output is correct
5 Correct 31 ms 78676 KB Output is correct
6 Correct 31 ms 78936 KB Output is correct
7 Correct 30 ms 78612 KB Output is correct
8 Correct 29 ms 78664 KB Output is correct
9 Correct 31 ms 78684 KB Output is correct
10 Correct 29 ms 78676 KB Output is correct
11 Correct 31 ms 78676 KB Output is correct
12 Correct 29 ms 78672 KB Output is correct
13 Correct 32 ms 78672 KB Output is correct
14 Correct 31 ms 78724 KB Output is correct
15 Correct 33 ms 78976 KB Output is correct
16 Correct 30 ms 78940 KB Output is correct
17 Correct 30 ms 78800 KB Output is correct
18 Correct 30 ms 78676 KB Output is correct
19 Correct 33 ms 78684 KB Output is correct
20 Correct 33 ms 78652 KB Output is correct
21 Correct 30 ms 78676 KB Output is correct
22 Correct 31 ms 78592 KB Output is correct
23 Correct 31 ms 78672 KB Output is correct
24 Correct 34 ms 78684 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Runtime error 189 ms 185588 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 78672 KB Output is correct
2 Correct 30 ms 78684 KB Output is correct
3 Correct 29 ms 78708 KB Output is correct
4 Correct 31 ms 78588 KB Output is correct
5 Correct 31 ms 78676 KB Output is correct
6 Correct 31 ms 78936 KB Output is correct
7 Correct 30 ms 78612 KB Output is correct
8 Correct 29 ms 78664 KB Output is correct
9 Correct 31 ms 78684 KB Output is correct
10 Correct 29 ms 78676 KB Output is correct
11 Correct 31 ms 78676 KB Output is correct
12 Correct 29 ms 78672 KB Output is correct
13 Correct 32 ms 78672 KB Output is correct
14 Correct 31 ms 78724 KB Output is correct
15 Correct 33 ms 78976 KB Output is correct
16 Correct 30 ms 78940 KB Output is correct
17 Correct 30 ms 78800 KB Output is correct
18 Correct 30 ms 78676 KB Output is correct
19 Correct 33 ms 78684 KB Output is correct
20 Correct 33 ms 78652 KB Output is correct
21 Correct 30 ms 78676 KB Output is correct
22 Correct 31 ms 78592 KB Output is correct
23 Correct 31 ms 78672 KB Output is correct
24 Correct 34 ms 78684 KB Output is correct
25 Runtime error 189 ms 185588 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -