oj.uz

답안 #846018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
846018 2023-09-07T06:15:36 Z efedmrlr Klasika (COCI20_klasika) C++17
110 / 110
 2376 ms 446020 KB 
#include <bits/stdc++.h>

#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

using namespace std;

struct TrieNode {
    TrieNode *c[2];
    set<int> st;

    TrieNode() {
        st.clear();
        c[0] = NULL;
        c[1] = NULL;
    }
    bool checkRange(int l, int r) {
        auto lb = st.lower_bound(l), ub = st.upper_bound(r);
        if(ub == st.begin()) return 0;
        if(lb == st.end()) return 0;
        if(ub == st.end() && st.size() < 1) return 0;
        ub--;
        if((*lb) <= (*ub)) {
            //cout<<"l:"<<l<<" r:"<<r<<"\n";
            return 1;
        }
        return 0;
    }

    void insert(int num, int disc, int index) {
        st.insert(disc);
        if(index == -1) return;
        bool f = (1 << index) & num;
        if(c[f] == NULL) {
            c[f] = new TrieNode();
        }
        c[f]->insert(num, disc, index-1);

    }
    int query(int num, int l, int r, int index) {
        if(!checkRange(l,r)) {
            return -1;
        } 
        if(index == -1) return 0;
        bool f = (1 << index) & num;
        if(c[f] != NULL) {
            int res = c[f]->query(num,l,r, index-1);
            
            if(res != -1) {
                //cout<<((1 << index) & num) + res<<"\n"; 
                return ((1 << index) & num) + res; 
            }

        }
        assert(c[!f] != NULL);
        int res = ((num ^ INT_MAX) & (1 << index) ) + c[!f]->query(num, l, r, index-1);
        //cout<<res<<"\n";
        return res;
    }


};

const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 2e5+5;
const int MX = 31;

int n,m,q;
vector<array<int,3> > quer;
int timer = 0;
vector<int> tout(N),tin(N);
vector<vector<int> > adj(N);
vector<int> w(N,0), pathw(N,0);

void dfs(int node, int par) {
    tin[node] = timer++;
    pathw[node] = pathw[par] ^ w[node];
    //cout<<"pathw[par]:"<<pathw[par]<<" w[node]:"<<w[node]<<" path[node]:"<< pathw[node]<<"\n";
    for(auto c : adj[node]) {
        if(c == par) continue;
        dfs(c, node);
    }
    tout[node] = timer++;
}

void solve() {
    cin>>q;
    quer.resize(q);
    int cnt = 2;
    for(int i = 0; i<q; i++) {
        string op;
        cin>>op;
        int a,b;
        if(op == "Query") {
            cin>>a>>b;
            quer[i] = {0, a, b};

        }
        else if(op == "Add") {
            cin>>a>>b;
            adj[cnt].pb(a);
            adj[a].pb(cnt);
            //cout<<b<<"?\n";
            w[cnt] = b;
            quer[i] = {1, a, cnt};
            cnt++;
            
        }   
    }
    dfs(1,0);
    TrieNode *root = new TrieNode();
    int ans = 0;
    root->insert(0, tin[1], MX-1);
    
    
    for(int i = 0; i<q; i++) {
        //cout<<"patlamadı:"<<i<<"\n";
        auto cur = quer[i];
        if(cur[0]) {
            root->insert(pathw[cur[2]], tin[cur[2]], MX-1);
        }
        else {
            int x = pathw[cur[1]];
            x = x ^ INT_MAX;
            int tmp = root->query(x, tin[cur[2]], tout[cur[2]], MX-1);
            ans = tmp ^ pathw[cur[1]];
            cout<<ans<<"\n";
        }
    }
    

}
 
signed main() {
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11352 KB Output is correct
2 Correct 4 ms 11608 KB Output is correct
3 Correct 5 ms 11608 KB Output is correct
4 Correct 5 ms 11868 KB Output is correct
5 Correct 5 ms 11352 KB Output is correct
6 Correct 4 ms 11864 KB Output is correct
7 Correct 5 ms 11608 KB Output is correct
8 Correct 5 ms 11868 KB Output is correct
9 Correct 4 ms 11352 KB Output is correct
10 Correct 4 ms 11608 KB Output is correct
11 Correct 4 ms 11608 KB Output is correct
12 Correct 5 ms 11868 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11352 KB Output is correct
2 Correct 4 ms 11608 KB Output is correct
3 Correct 5 ms 11608 KB Output is correct
4 Correct 5 ms 11868 KB Output is correct
5 Correct 5 ms 11352 KB Output is correct
6 Correct 4 ms 11864 KB Output is correct
7 Correct 5 ms 11608 KB Output is correct
8 Correct 5 ms 11868 KB Output is correct
9 Correct 4 ms 11352 KB Output is correct
10 Correct 4 ms 11608 KB Output is correct
11 Correct 4 ms 11608 KB Output is correct
12 Correct 5 ms 11868 KB Output is correct
13 Correct 8 ms 12888 KB Output is correct
14 Correct 9 ms 14168 KB Output is correct
15 Correct 10 ms 15448 KB Output is correct
16 Correct 11 ms 16472 KB Output is correct
17 Correct 8 ms 12632 KB Output is correct
18 Correct 10 ms 13912 KB Output is correct
19 Correct 11 ms 15192 KB Output is correct
20 Correct 11 ms 16472 KB Output is correct
21 Correct 8 ms 12632 KB Output is correct
22 Correct 10 ms 13916 KB Output is correct
23 Correct 11 ms 15192 KB Output is correct
24 Correct 13 ms 16472 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 797 ms 130144 KB Output is correct
2 Correct 1219 ms 236524 KB Output is correct
3 Correct 1545 ms 338952 KB Output is correct
4 Correct 1839 ms 442244 KB Output is correct
5 Correct 712 ms 128592 KB Output is correct
6 Correct 1226 ms 234072 KB Output is correct
7 Correct 1641 ms 335092 KB Output is correct
8 Correct 2118 ms 436012 KB Output is correct
9 Correct 803 ms 128080 KB Output is correct
10 Correct 1132 ms 234732 KB Output is correct
11 Correct 1547 ms 337044 KB Output is correct
12 Correct 1889 ms 437584 KB Output is correct

Subtask #4
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11352 KB Output is correct
2 Correct 4 ms 11608 KB Output is correct
3 Correct 5 ms 11608 KB Output is correct
4 Correct 5 ms 11868 KB Output is correct
5 Correct 5 ms 11352 KB Output is correct
6 Correct 4 ms 11864 KB Output is correct
7 Correct 5 ms 11608 KB Output is correct
8 Correct 5 ms 11868 KB Output is correct
9 Correct 4 ms 11352 KB Output is correct
10 Correct 4 ms 11608 KB Output is correct
11 Correct 4 ms 11608 KB Output is correct
12 Correct 5 ms 11868 KB Output is correct
13 Correct 8 ms 12888 KB Output is correct
14 Correct 9 ms 14168 KB Output is correct
15 Correct 10 ms 15448 KB Output is correct
16 Correct 11 ms 16472 KB Output is correct
17 Correct 8 ms 12632 KB Output is correct
18 Correct 10 ms 13912 KB Output is correct
19 Correct 11 ms 15192 KB Output is correct
20 Correct 11 ms 16472 KB Output is correct
21 Correct 8 ms 12632 KB Output is correct
22 Correct 10 ms 13916 KB Output is correct
23 Correct 11 ms 15192 KB Output is correct
24 Correct 13 ms 16472 KB Output is correct
25 Correct 797 ms 130144 KB Output is correct
26 Correct 1219 ms 236524 KB Output is correct
27 Correct 1545 ms 338952 KB Output is correct
28 Correct 1839 ms 442244 KB Output is correct
29 Correct 712 ms 128592 KB Output is correct
30 Correct 1226 ms 234072 KB Output is correct
31 Correct 1641 ms 335092 KB Output is correct
32 Correct 2118 ms 436012 KB Output is correct
33 Correct 803 ms 128080 KB Output is correct
34 Correct 1132 ms 234732 KB Output is correct
35 Correct 1547 ms 337044 KB Output is correct
36 Correct 1889 ms 437584 KB Output is correct
37 Correct 1386 ms 134000 KB Output is correct
38 Correct 1832 ms 240224 KB Output is correct
39 Correct 2088 ms 345084 KB Output is correct
40 Correct 2132 ms 446020 KB Output is correct
41 Correct 1402 ms 132004 KB Output is correct
42 Correct 1985 ms 236972 KB Output is correct
43 Correct 2205 ms 338468 KB Output is correct
44 Correct 2376 ms 439088 KB Output is correct
45 Correct 1583 ms 131396 KB Output is correct
46 Correct 2120 ms 237760 KB Output is correct
47 Correct 2353 ms 339496 KB Output is correct
48 Correct 2355 ms 441056 KB Output is correct