Submission #1282599

#	Time	Username	Problem	Language	Result	Execution time	Memory
1282599		vahagng	Klasika (COCI20_klasika)	C++20	33 / 110	101 ms	72800 KiB

klasika

//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;

// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }

#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'

const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;

void SetIO(string str = "") {
    if (str != "") {
        freopen((str + ".in").c_str(), "r", stdin);
        freopen((str + ".out").c_str(), "w", stdout);
    }
    else {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
}

void FastIO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

const int N = 2e5 + 10, M = 1e7 + 10;

mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());

ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1) {
            res = (res * a) % mod;
        }
        b >>= 1;
        a = (a * a) % mod;
    }
    return res;
}

vector<int>adj[N];
int tin[N], tout[N], timer, dist[N], par[N], val[N];

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

struct Trie{
    int t[30*N][2], qn[30*N], cnt = 0;
 
    void init(){
        cnt = 0;
        for(int i = 0; i < 30*N; i++){
            t[i][0] = t[i][1] = -1;
            qn[i] = 0;
        }
    }
 
    void upd(ll x){
        int st = 0;
        for(int i = 30; i >= 0; i--) {
            bool flag = (x >> i) & 1;
            qn[st]++;
            if(t[st][flag] == -1){
                t[st][flag] = ++cnt;
            }
            st = t[st][flag];
        }
        qn[st]++;
    }
 
    void del(ll x){
        int st = 0;
        for(int i = 30; i >= 0; i--){
            bool flag = (x >> i) & 1;
            qn[st]--, st = t[st][flag];
        }
        qn[st]--;
    }
 
    int qry(ll x){
        ll answ = 0, st = 0;
        for(int i = 30; i >= 0; i--) {
            bool flag = (x >> i) & 1;
            if(t[st][!flag] != -1 && qn[t[st][!flag]]){
                st = t[st][!flag];
                answ |= (1 << i);
            } else {
                st = t[st][flag];
            }
        }
        return answ;
    }
} tr;

void solve(int tc) {
    int q;
    cin >> q;
    int c = 1;
    tin[1] = 1;
    tout[1] = 1;
    timer = 1;
    dist[1] = 0;
    tr.init();
    tr.upd(0);
    while(q--){
        string type;
        cin >> type;
        if(type == "Add"){
            int x, y;
            cin >> x >> y;
            dist[++c] = dist[x]^y;
            tr.upd(dist[c]);
        }else{
            int a, b;
            cin >> a >> b;
            cout << tr.qry(dist[a]) << endl;
        }
    }
}


void precalc() {

}

int main() {
    // SetIO("teamwork");
    FastIO();
    int test_case = 1;
    // cin >> test_case;
    precalc();
    int cnt = 1;
    while (test_case--) {
        solve(cnt++);
    }
    return 0;
}

Compilation message (stderr)

klasika.cpp: In function 'void SetIO(std::string)':
klasika.cpp:47:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         freopen((str + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen((str + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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