Submission #223305

#	Time	Username	Problem	Language	Result	Execution time	Memory
223305		tqbfjotld	Klasika (COCI20_klasika)	C++14	110 / 110	3704 ms	182688 KiB

klasika

#include <bits/stdc++.h>
using namespace std;

struct node{
int s,e;
set<int> v;
node *l,*r;
node(int _s, int _e){
    s = _s;
    e = _e;
    if (s!=e){
        l = new node(s,(s+e)/2);
        r = new node((s+e)/2+1,e);
    }
}
void addVal(int pos, int val){
    v.insert(val);
    if (s==e) return;
    if (pos>(s+e)/2){
        r->addVal(pos,val);
    }
    else{
        l->addVal(pos,val);
    }
}
int query(int a, int b, int val){
    if (a<=s && e<=b){
        if (v.empty()) return -1;
        int lb = 0;
        for (int x = 30; x>=0; x--){
            int bitmask = ((1<<30)-1+(1<<30)-((1<<(x+1))-1));
            int pref = (lb&bitmask);
            if ((val&(1<<x))==0){
                auto it = v.lower_bound(pref+(1<<x));
                if (it==v.end()){
                    continue;
                }
                int res = *(it);
                if ((res&(1<<x))!=0 && (pref==(res&bitmask))){
                    lb += (1<<x);
                }
            }
            else{
                auto it = v.lower_bound(pref);
                if (it==v.end()){
                    return 1/0;
                }
                int res = *(it);
                if ((res&(1<<x))!=0){
                    lb += (1<<x);
                }
            }
        }
/*
        printf("node %d to %d: ",s,e);
        for (auto x : v){
            printf("%d ",x);
        }
        printf("\n");
        printf("chose %d for val %d\n",lb,val);
*/
        return lb^val;
    }
    else if (b<=(s+e)/2){
        return l->query(a,b,val);
    }
    else if (a>(s+e)/2){
        return r->query(a,b,val);
    }
    else{
        return max(l->query(a,b,val),r->query(a,b,val));
    }
}
}*root;

int order[200005];
int subtree[200005];///subtree size
int dist[200005];///length of path to root
vector<pair<bool,pair<int,int> > > queries; ///offline lol
vector<pair<int,int> > adjl[200005];
int q;
int n = 1;
int cur = 1;

int dfs(int node){
    order[node] = cur;
    cur++;
    subtree[node] = 1;
    for (auto x : adjl[node]){
        dist[x.first] = dist[node]^x.second;
        subtree[node] += dfs(x.first);
    }
    return subtree[node];
}

int main(){
    cin>>q;
    for (int x = 0; x<q; x++){
        string str;
        cin>>str;
        int a,b;
        cin>>a;
        cin>>b;
        if (str=="Add"){
            n++;
            queries.push_back({true,{n,b}});
            adjl[a].push_back({n,b});
        }
        else{
            queries.push_back({false,{a,b}});
        }
    }
    root = new node(1,n);
    dfs(1);/*
    for (int x = 1; x<=n; x++){
        printf("%d ",dist[x]);
    }
    printf("\n");*/
    root->addVal(1,0);
    for (auto x : queries){
        if (x.first){
            //printf("adding %d %d\n",order[x.second.first],dist[x.second.first]);
            root->addVal(order[x.second.first],dist[x.second.first]);
        }
        else{
            int xr = dist[x.second.first];
            printf("%d\n",root->query(order[x.second.second],order[x.second.second]+subtree[x.second.second]-1,xr));
        }
    }
}
/*
10
Add 1 4
Add 1 0
Add 3 1

Add 3 2
Add 3 3
Add 3 4
Query 2 3
Add 3 7
Add 3 9
Query 4 1
*/

Compilation message (stderr)

klasika.cpp: In member function 'int node::query(int, int, int)':
klasika.cpp:46:29: warning: division by zero [-Wdiv-by-zero]
                     return 1/0;
                            ~^~

• Subtask 1: 11 / 11
• Subtask 2: 22 / 22
• Subtask 3: 33 / 33
• Subtask 4: 44 / 44