oj.uz

답안 #308334

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308334 2020-09-30T23:59:40 Z ErdosSzekeres Klasika (COCI20_klasika) C++14
33 / 110
 1457 ms 348920 KB 
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pii pair<int,int>
const int MAXN = 2e5+7;
int q;
int tp[MAXN], a[MAXN], b[MAXN], d[MAXN], t=0, ent[MAXN], sai[MAXN];
int fe[4*MAXN], fd[4*MAXN], node_counter = 0;
set<int> aux[4*MAXN];//entry times
int create(){
    node_counter++;
    fe[node_counter] = -1;
    fd[node_counter] = -1;
    aux[node_counter].insert(1<<30);
    return node_counter;
}
vector<pii> G[MAXN];
void inserir(int idx, int depth, int val, int et){
    aux[idx].insert(et);
    if(depth < 0)return;
    if((val&(1<<depth))){//go right
        if(fd[idx] == -1)fd[idx] = create();
        inserir(fd[idx], depth-1, val, et);
    }else{
        if(fe[idx] == -1)fe[idx] = create();
        inserir(fe[idx], depth-1, val, et);
    }
}
void dfs(int u){
    t++; ent[u] = t;
    for(pii viz : G[u]){
        d[viz.first] = (d[u]^viz.second);
        dfs(viz.first);
    }
    sai[u] = t;
}
int query(int idx, int depth, int val, int node){
    if(depth < 0)return 0;
    if((val&(1<<depth))){//i want to go left
        if(fe[idx] == -1){//but i cant
            return query(fd[idx], depth-1, val, node);
        }else{
            int tst = *aux[fe[idx]].lower_bound(ent[node]);
            if(tst>=ent[node] && tst <= sai[node]){//go!!
                //cout<<tst<<" "<<ent[node]<<" "<<sai[node]<<"  --> "<<node<<endl;
                return (1<<depth) + query(fe[idx], depth-1, val, node);
            }
            return query(fd[idx], depth-1, val, node);
        }
    }else{//i want to go right
        if(fd[idx] == -1){//but i cant
            return query(fe[idx], depth-1, val, node);
        }else{
            int tst = *aux[fd[idx]].lower_bound(ent[node]);
            if(tst>=ent[node] && tst <= sai[node]){//go!!
                //cout<<tst<<" "<<ent[node]<<" "<<sai[node]<<"  --> "<<node<<endl;
                return (1<<depth) + query(fd[idx], depth-1, val, node);
            }
            return query(fe[idx], depth-1, val, node);
        }
    }
}
int main(){
    fastio; cin>>q;
    for(int i=0; i<q; i++){
        string ii; cin>>ii>>a[i]>>b[i];
        tp[i] = (ii=="Add") ? 0 : 1;
    }
    int raiz = create();
    int id = 1;
    for(int i=0; i<q; i++){//build tree and compute euler tour
        if(tp[i] == 1)continue;
        id++;
        G[a[i]].push_back({id, b[i]});
    }
    dfs(1);
    inserir(1, 29, 0, ent[1]);
    id = 1;
    for(int i=0; i<q; i++){
        if(tp[i] == 0){
            id++;
            inserir(1, 29, d[id], ent[id]);
        }else{
            cout << query(raiz, 29, d[a[i]], b[i]) << endl;//max xor with d[a[i]] in subtree of b[i]
        }
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 42752 KB Output is correct
2 Correct 30 ms 42880 KB Output is correct
3 Correct 29 ms 43008 KB Output is correct
4 Correct 30 ms 43136 KB Output is correct
5 Correct 30 ms 42752 KB Output is correct
6 Correct 31 ms 42880 KB Output is correct
7 Correct 29 ms 43000 KB Output is correct
8 Correct 30 ms 43128 KB Output is correct
9 Correct 29 ms 42744 KB Output is correct
10 Correct 30 ms 42880 KB Output is correct
11 Correct 30 ms 43008 KB Output is correct
12 Correct 30 ms 43128 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 42752 KB Output is correct
2 Correct 30 ms 42880 KB Output is correct
3 Correct 29 ms 43008 KB Output is correct
4 Correct 30 ms 43136 KB Output is correct
5 Correct 30 ms 42752 KB Output is correct
6 Correct 31 ms 42880 KB Output is correct
7 Correct 29 ms 43000 KB Output is correct
8 Correct 30 ms 43128 KB Output is correct
9 Correct 29 ms 42744 KB Output is correct
10 Correct 30 ms 42880 KB Output is correct
11 Correct 30 ms 43008 KB Output is correct
12 Correct 30 ms 43128 KB Output is correct
13 Correct 37 ms 43796 KB Output is correct
14 Correct 43 ms 44920 KB Output is correct
15 Correct 41 ms 46080 KB Output is correct
16 Correct 41 ms 46968 KB Output is correct
17 Correct 37 ms 43768 KB Output is correct
18 Correct 39 ms 44796 KB Output is correct
19 Correct 41 ms 45944 KB Output is correct
20 Correct 42 ms 46848 KB Output is correct
21 Correct 37 ms 43768 KB Output is correct
22 Correct 39 ms 44792 KB Output is correct
23 Correct 40 ms 45856 KB Output is correct
24 Correct 41 ms 46844 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1457 ms 142456 KB Output is correct
2 Runtime error 1382 ms 348920 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 42752 KB Output is correct
2 Correct 30 ms 42880 KB Output is correct
3 Correct 29 ms 43008 KB Output is correct
4 Correct 30 ms 43136 KB Output is correct
5 Correct 30 ms 42752 KB Output is correct
6 Correct 31 ms 42880 KB Output is correct
7 Correct 29 ms 43000 KB Output is correct
8 Correct 30 ms 43128 KB Output is correct
9 Correct 29 ms 42744 KB Output is correct
10 Correct 30 ms 42880 KB Output is correct
11 Correct 30 ms 43008 KB Output is correct
12 Correct 30 ms 43128 KB Output is correct
13 Correct 37 ms 43796 KB Output is correct
14 Correct 43 ms 44920 KB Output is correct
15 Correct 41 ms 46080 KB Output is correct
16 Correct 41 ms 46968 KB Output is correct
17 Correct 37 ms 43768 KB Output is correct
18 Correct 39 ms 44796 KB Output is correct
19 Correct 41 ms 45944 KB Output is correct
20 Correct 42 ms 46848 KB Output is correct
21 Correct 37 ms 43768 KB Output is correct
22 Correct 39 ms 44792 KB Output is correct
23 Correct 40 ms 45856 KB Output is correct
24 Correct 41 ms 46844 KB Output is correct
25 Correct 1457 ms 142456 KB Output is correct
26 Runtime error 1382 ms 348920 KB Execution killed with signal 11 (could be triggered by violating memory limits)
27 Halted 0 ms 0 KB -