Submission #1281971

#	Time	Username	Problem	Language	Result	Execution time	Memory
1281971		paronmanukyan	Klasika (COCI20_klasika)	C++20	33 / 110	659 ms	1804 KiB

klasika

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;

#define pb push_back

int n = 1;
const int N = 5003;
vector <int> adj[N];
int a[N], p[N];
int dist[N], st[N];

int ans;

void dfs(int node, int p, int cur) {
	ans = max(ans, cur);
	for (auto i : adj[node]) if (i != p) {
		dfs(i, node, cur ^ a[i]);
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);

	int q; cin >> q;
	while (q--) {
		string s; cin >> s;
		int x, b; cin >> x >> b;
		if (s[0] == 'A') {
			++n;
			a[n] = b;
			st[n] = st[x] ^ a[n];
			p[n] = x;
			adj[x].pb(n);
			adj[n].pb(x);
		}
		else {
			int st_d = st[x] ^ st[b];
			for (int i = 1; i <= n; ++i) {
				dist[i] = 0;
			}
			ans = st_d;
			dfs(b, p[b], st_d);
			cout << ans << "\n";
		}
	}
}

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