oj.uz

Submission #875187

# Submission time Handle Problem Language Result Execution time Memory
875187 2023-11-18T18:43:34 Z Dr_rabi3 Klasika (COCI20_klasika) C++14
110 / 110
 1875 ms 455452 KB 
/***   Coding for Fun ^^ وَمَا تَوْفِيقِي إِلَّا بِاللَّهِ ۚ عَلَيْهِ تَوَكَّلْتُ وَإِلَيْهِ أُنِيبُ    ***/
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ull unsigned ll
#define ld long double
#define ed '\n'
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fixed(x) fixed<<setprecision(x)
#define memo(dp,x) memset(dp,x,sizeof(dp))
#define sumOf(a) (ll)((-1 + sqrt(8LL * a + 1)) / 2)
#define debug cerr
#define Good_Bay return

using namespace std;
using namespace __gnu_pbds;
std::mt19937_64 rng(std::chrono::system_clock::now().time_since_epoch().count());

template < typename T > using ordered_set = tree< T, null_type, less_equal< T >, rb_tree_tag, tree_order_statistics_node_update >;

template < typename T > istream& operator >> (istream& in, vector < T >& v) {
    for (auto& x : v) in >> x;
    return in;
}

template < typename T > ostream& operator << (ostream& out, const vector < T >& v) {
    for (const T& x : v) out << x << ' ';
    return out;
}


void Accept() { // for VS code
    ios_base::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    // #ifndef ONLINE_JUDGE
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    // #else
        // freopen("darwin.in", "r", stdin);
        // freopen("visitfj.out", "w", stdout);
    // #endif
}

constexpr int mod = 1e9 + 7, oo = 0x3f3f3f3f, N = 1e6 + 5;
const double pi = acos(-1), EPS = 1e-7;
constexpr ll OO = 0x3f3f3f3f3f3f3f3f;

constexpr int dy[] = { 0 , 1 , -1 , 0  , 1 , -1 , 1  , -1 };
constexpr int dx[] = { 1 , 0 ,  0 , -1 , 1 , -1 , -1 ,  1 };

vector<int>adj[N];
vector<int>in(N), out(N), preXor(N);
int id = 1;

void dfs(int u) {
    in[u] = id++;
    for (auto v : adj[u])dfs(v);
    out[u] = id - 1;
}

class Trie {
    struct Node {
        Node* child[2];
        set<int>ids;
        Node() {
            child[0] = child[1] = NULL;
        }
    };
    Node* root;
    int LOG;
public:
    Trie(int _LOG) :LOG(_LOG) { root = new Node(); }
    void insert(int u) {
        Node* v = root;
        int x = preXor[u];
        for (int bit = LOG - 1; bit >= 0; --bit) {
            int to = ((1 << bit) & x ? 1 : 0);
            if (v->child[to] == NULL) {
                v->child[to] = new Node();
            }
            v = v->child[to];
            v->ids.insert(in[u]);
        }
    }
    int query_max(int x, int u) {
        Node* v = root;
        int sum = 0;
        for (int bit = LOG - 1; bit >= 0; bit--) {
            int to = ((1 << bit) & x ? 0 : 1);
            if (v->child[to] != NULL and
                v->child[to]->ids.lower_bound(in[u]) != v->child[to]->ids.lower_bound(out[u] + 1)) {
                v = v->child[to], sum += to * (1 << bit);
            }
            else v = v->child[1 - to], sum += (1 - to) * (1 << bit);
        }
        return x ^ sum;
    }
};


void doWork(int T) {
    int q, n = 1;
    cin >> q;
    vector<pair<string, pair<int, int>>>Q(q);
    for (auto& i : Q) {
        cin >> i.first >> i.second.first >> i.second.second;
        if (i.first == "Add") {
            adj[i.second.first].push_back(++n);
            preXor[n] = preXor[i.second.first] ^ i.second.second;
        }
    }
    dfs(1);
    Trie tr(30);
    n = 1;
    tr.insert(n++);
    for (auto i : Q) {
        if (i.first == "Add") tr.insert(n++);
        else cout << tr.query_max(preXor[i.second.first], i.second.second) << ed;
    }
}

int main() {
    debug << "M3L4 El-Code MYTFHM4\n";
    Accept();
    int _ = 1;
    // cin >> _;
    for (int __ = 1;__ <= _;__++) {
        // cout << "Case " << __ << ": ";
        doWork(__);
        if (__ < _)cout << '\n';
        // cout << '\n';
    }
    Good_Bay 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 35676 KB Output is correct
2 Correct 10 ms 35932 KB Output is correct
3 Correct 11 ms 35932 KB Output is correct
4 Correct 10 ms 36188 KB Output is correct
5 Correct 9 ms 35676 KB Output is correct
6 Correct 10 ms 35932 KB Output is correct
7 Correct 10 ms 35932 KB Output is correct
8 Correct 10 ms 36212 KB Output is correct
9 Correct 9 ms 35676 KB Output is correct
10 Correct 10 ms 35964 KB Output is correct
11 Correct 10 ms 35932 KB Output is correct
12 Correct 10 ms 36188 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 35676 KB Output is correct
2 Correct 10 ms 35932 KB Output is correct
3 Correct 11 ms 35932 KB Output is correct
4 Correct 10 ms 36188 KB Output is correct
5 Correct 9 ms 35676 KB Output is correct
6 Correct 10 ms 35932 KB Output is correct
7 Correct 10 ms 35932 KB Output is correct
8 Correct 10 ms 36212 KB Output is correct
9 Correct 9 ms 35676 KB Output is correct
10 Correct 10 ms 35964 KB Output is correct
11 Correct 10 ms 35932 KB Output is correct
12 Correct 10 ms 36188 KB Output is correct
13 Correct 13 ms 36956 KB Output is correct
14 Correct 13 ms 38264 KB Output is correct
15 Correct 14 ms 39516 KB Output is correct
16 Correct 17 ms 40540 KB Output is correct
17 Correct 13 ms 36952 KB Output is correct
18 Correct 13 ms 38236 KB Output is correct
19 Correct 14 ms 39276 KB Output is correct
20 Correct 15 ms 40540 KB Output is correct
21 Correct 12 ms 36956 KB Output is correct
22 Correct 13 ms 38236 KB Output is correct
23 Correct 15 ms 39292 KB Output is correct
24 Correct 15 ms 40540 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 630 ms 153248 KB Output is correct
2 Correct 903 ms 254944 KB Output is correct
3 Correct 1168 ms 353124 KB Output is correct
4 Correct 1507 ms 455100 KB Output is correct
5 Correct 531 ms 154348 KB Output is correct
6 Correct 991 ms 255216 KB Output is correct
7 Correct 1401 ms 352044 KB Output is correct
8 Correct 1613 ms 448616 KB Output is correct
9 Correct 526 ms 153828 KB Output is correct
10 Correct 912 ms 255892 KB Output is correct
11 Correct 1193 ms 354104 KB Output is correct
12 Correct 1536 ms 450504 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 35676 KB Output is correct
2 Correct 10 ms 35932 KB Output is correct
3 Correct 11 ms 35932 KB Output is correct
4 Correct 10 ms 36188 KB Output is correct
5 Correct 9 ms 35676 KB Output is correct
6 Correct 10 ms 35932 KB Output is correct
7 Correct 10 ms 35932 KB Output is correct
8 Correct 10 ms 36212 KB Output is correct
9 Correct 9 ms 35676 KB Output is correct
10 Correct 10 ms 35964 KB Output is correct
11 Correct 10 ms 35932 KB Output is correct
12 Correct 10 ms 36188 KB Output is correct
13 Correct 13 ms 36956 KB Output is correct
14 Correct 13 ms 38264 KB Output is correct
15 Correct 14 ms 39516 KB Output is correct
16 Correct 17 ms 40540 KB Output is correct
17 Correct 13 ms 36952 KB Output is correct
18 Correct 13 ms 38236 KB Output is correct
19 Correct 14 ms 39276 KB Output is correct
20 Correct 15 ms 40540 KB Output is correct
21 Correct 12 ms 36956 KB Output is correct
22 Correct 13 ms 38236 KB Output is correct
23 Correct 15 ms 39292 KB Output is correct
24 Correct 15 ms 40540 KB Output is correct
25 Correct 630 ms 153248 KB Output is correct
26 Correct 903 ms 254944 KB Output is correct
27 Correct 1168 ms 353124 KB Output is correct
28 Correct 1507 ms 455100 KB Output is correct
29 Correct 531 ms 154348 KB Output is correct
30 Correct 991 ms 255216 KB Output is correct
31 Correct 1401 ms 352044 KB Output is correct
32 Correct 1613 ms 448616 KB Output is correct
33 Correct 526 ms 153828 KB Output is correct
34 Correct 912 ms 255892 KB Output is correct
35 Correct 1193 ms 354104 KB Output is correct
36 Correct 1536 ms 450504 KB Output is correct
37 Correct 976 ms 156756 KB Output is correct
38 Correct 1404 ms 258284 KB Output is correct
39 Correct 1611 ms 358784 KB Output is correct
40 Correct 1720 ms 455452 KB Output is correct
41 Correct 1028 ms 154712 KB Output is correct
42 Correct 1448 ms 255244 KB Output is correct
43 Correct 1671 ms 352264 KB Output is correct
44 Correct 1875 ms 447988 KB Output is correct
45 Correct 1193 ms 154328 KB Output is correct
46 Correct 1665 ms 256232 KB Output is correct
47 Correct 1843 ms 353004 KB Output is correct
48 Correct 1860 ms 450640 KB Output is correct