oj.uz

Submission #889416

# Submission time Handle Problem Language Result Execution time Memory
889416 2023-12-19T16:03:21 Z Alish Klasika (COCI20_klasika) C++17
33 / 110
 1738 ms 524288 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long int	ll;
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pll;


#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl;
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);


ll mod = 1e9+7 ;

const int N = 2e5+23, L=31;


ll h[N];
vector<vector<int> > ch;
vector<set<int> > ss;

set<int> emt;
int st[N], ft[N], tim=0;
vector<int> g[N];
vector<pair<int, pii> > Q;
int cnt=1;
int tr;

void dfs(int v){
    st[v]=tim++;
    for (int u: g[v]) dfs(u);
    ft[v]=tim;
}

void add(int x, int pp){
    int cur=0;
    for (int i=L-1; i>=0; i--){
        int t=(x>>i&1);
        if(!ch[cur][t]) {

            ch[cur][t]=++tr;
            ch.pb({0, 0});
            ss.pb(emt);

        }
        cur=ch[cur][t];
        ss[cur].insert(pp);
    }
}

int get(int x, int v){
    int cur=0;
    int ans=0;
    for (int i=L-1; i>=0; i--){
        int t=(x>>i&1);
        t=1-t;
        if(ch[cur][t]){
            auto x=ss[ch[cur][t]].lower_bound(st[v]);

            if(x==ss[ch[cur][t]].end() || *x>=ft[v]){
                cur=ch[cur][1-t];
            }
            else{
                ans+=(1<<i);
                cur=ch[cur][t];
            }
        }
        else{
            cur=ch[cur][1-t];
        }
    }
    return ans;
}

int main()
{
    fast_io
    ch.pb({0, 0});
    set<int> emt;
    ss.pb(emt);
    int q; cin>>q;
    for (int i=0; i<q; i++){
        string s; cin>>s;
        if(s=="Add"){
             ll u, w;
            cin>>u>>w;
            cnt++;
            h[cnt]=h[u]^w;
            g[u].pb(cnt);
            Q.pb({0, {cnt, u}});
        }
        else{
                int u, v; cin>>v>>u;
            Q.pb({1, {v, u}});
        }
    }
    dfs(1);
    add(0, st[1]);

    for (auto pp: Q){
        int t=pp.F, v=pp.S.F, u=pp.S.S;
        if(!t){
            add(h[v], st[v]);
        }
        else{
            cout<<get(h[v], u)<<endl;
        }
    }

}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7000 KB Output is correct
2 Correct 2 ms 7004 KB Output is correct
3 Correct 2 ms 7408 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 2 ms 7000 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7004 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 3 ms 7260 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7000 KB Output is correct
2 Correct 2 ms 7004 KB Output is correct
3 Correct 2 ms 7408 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 2 ms 7000 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7004 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 3 ms 7260 KB Output is correct
13 Correct 5 ms 8404 KB Output is correct
14 Correct 6 ms 10444 KB Output is correct
15 Correct 8 ms 11208 KB Output is correct
16 Correct 9 ms 14788 KB Output is correct
17 Correct 5 ms 8412 KB Output is correct
18 Correct 7 ms 10188 KB Output is correct
19 Correct 9 ms 11188 KB Output is correct
20 Correct 9 ms 12484 KB Output is correct
21 Correct 4 ms 8404 KB Output is correct
22 Correct 6 ms 10188 KB Output is correct
23 Correct 8 ms 11208 KB Output is correct
24 Correct 10 ms 12484 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 640 ms 139240 KB Output is correct
2 Correct 1136 ms 275564 KB Output is correct
3 Correct 1639 ms 367696 KB Output is correct
4 Runtime error 1738 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7000 KB Output is correct
2 Correct 2 ms 7004 KB Output is correct
3 Correct 2 ms 7408 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 2 ms 7000 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7004 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 3 ms 7260 KB Output is correct
13 Correct 5 ms 8404 KB Output is correct
14 Correct 6 ms 10444 KB Output is correct
15 Correct 8 ms 11208 KB Output is correct
16 Correct 9 ms 14788 KB Output is correct
17 Correct 5 ms 8412 KB Output is correct
18 Correct 7 ms 10188 KB Output is correct
19 Correct 9 ms 11188 KB Output is correct
20 Correct 9 ms 12484 KB Output is correct
21 Correct 4 ms 8404 KB Output is correct
22 Correct 6 ms 10188 KB Output is correct
23 Correct 8 ms 11208 KB Output is correct
24 Correct 10 ms 12484 KB Output is correct
25 Correct 640 ms 139240 KB Output is correct
26 Correct 1136 ms 275564 KB Output is correct
27 Correct 1639 ms 367696 KB Output is correct
28 Runtime error 1738 ms 524288 KB Execution killed with signal 9
29 Halted 0 ms 0 KB -