Submission #1281228

#	Time	Username	Problem	Language	Result	Execution time	Memory
1281228		arman.khachatryan	Klasika (COCI20_klasika)	C++20	33 / 110	2987 ms	4556 KiB

klasika

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

int main() {
    ll Q;
    cin >> Q;

    vector<ll> xorToRoot(Q + 2);
    xorToRoot[1] = 0;
    vector<ll> nodes;
    nodes.push_back(0);

    ll nodeCount = 1;

    while (Q--) {
        string type;
        cin >> type;
        if (type == "Add") {
            ll x, y;
            cin >> x >> y;
            nodeCount++;
            xorToRoot[nodeCount] = xorToRoot[x] ^ y;
            nodes.push_back(xorToRoot[nodeCount]);
        } else {
            ll a, b;
            cin >> a >> b;
            ll ans = 0;
            for (ll val : nodes) {
                ans = max(ans, xorToRoot[a] ^ val);
            }
            cout << ans << "\n";
        }
    }
}

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