Submission #339998

#	Time	Username	Problem	Language	Result	Execution time	Memory
339998		sinamhdv	Klasika (COCI20_klasika)	C++11	33 / 110	2616 ms	524288 KiB

klasika

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1000 * 1000 * 1000;
const ll LINF = (ll)INF * INF;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define msub(a, b) ((mod + ((a) - (b)) % mod) % mod)
#define mdiv(a, b) ((a) * poww((b), mod - 2) % mod)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define endl '\n'

struct QR
{
	char op;
	int x, y;
};

#define MAXN 200100
#define LOGN 31
#define MAXL (LOGN * MAXN)

int n, q;
int dp[MAXN];
vector<pii> cld[MAXN];
QR qr[MAXN];
int sttime[MAXN], fntime[MAXN], timer;

inline void getnum(int x, string &bin)
{
	FOR(i, 0, LOGN)
	{
		if (x & (1 << i))
			bin += '1';
		else
			bin += '0';
	}
	reverse(all(bin));
}

void dfs(int v, int x)
{
	sttime[v] = timer++;
	dp[v] = x;
	for (pii p : cld[v])
	{
		dfs(p.fr, x ^ p.sc);
	}
	fntime[v] = timer;
}

int trie[MAXL][2];
set<int> ts[MAXL];
int tn = 1;

inline bool hasrng(int i, int l, int r)
{
	return ts[i].lower_bound(l) != ts[i].upper_bound(r);
}

void add(int i, int x)
{
	string s;
	getnum(x, s);
	int v = 1;
	for (char c : s)
	{
		if (!trie[v][c - '0'])
		{
			tn++;
			trie[v][c - '0'] = tn;
		}
		ts[v].insert(i);
		v = trie[v][c - '0'];
	}
	ts[v].insert(i);
}

int query(int l, int r, int x)
{
	int res = 0;
	string s;
	getnum(x, s);
	int v = 1;
	int bpos = LOGN - 1;
	for (char c : s)
	{
		int b = c - '0';
		if (trie[v][1 - b] && hasrng(trie[v][1 - b], l, r))
		{
			res |= ((1 - b) << bpos);
			v = trie[v][1 - b];
		}
		else
		{
			v = trie[v][b];
			res |= (b << bpos);
		}
		bpos--;
	}
	return res ^ x;
}

int32_t main(void)
{
	fast_io;
	n = 1;
	cin >> q;
	FOR(i, 0, q)
	{
		string op;
		int x, y;
		cin >> op >> x >> y;
		qr[i] = {op[0], x, y};
		if (op[0] == 'A')
		{
			n++;
			cld[x].pb(mp(n, y));
		}
	}
	dfs(1, 0);
	
	int cnt = 1;
	add(sttime[1], dp[1]);
	FOR(i, 0, q)
	{
		if (qr[i].op == 'A')
		{
			cnt++;
			add(sttime[cnt], dp[cnt]);
		}
		else
		{
			cout << query(sttime[qr[i].y], fntime[qr[i].y] - 1, dp[qr[i].x]) << endl;
		}
	}
	return 0;
}

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