Submission #1133515

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133515		xjonwang	Klasika (COCI20_klasika)	C++20	0 / 110	359 ms	98772 KiB

klasika

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

#define ll long long
#define ld long double
#define ar array

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;

template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define s second

#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)

template<class T> bool umin(T& a, const T& b) {
	return b<a?a=b, 1:0;
}
template<class T> bool umax(T& a, const T& b) { 
	return a<b?a=b, 1:0;
} 

ll FIRSTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb)/2;
		f(mb)?rb=mb:lb=mb+1; 
	} 
	return lb;
}
ll LASTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb+1)/2;
		f(mb)?lb=mb:rb=mb-1; 
	} 
	return lb;
}

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class A, class B> void read(pair<A, B>& x);
template<class T> void read(T& x) {
	cin >> x;
}
void read(double& d) {
	string t;
	read(t);
	d=stod(t);
}
void read(long double& d) {
	string t;
	read(t);
	d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
	read(h);
	read(t...);
}
template<class A> void read(vt<A>& x) {
	EACH(a, x)
		read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
	EACH(a, x)
		read(a);
}
template<class A, class B> void read(pair<A, B>& x) {
	cin >> x.first >> x.second;
}


string to_string(char c) {
	return string(1, c);
}
string to_string(bool b) {
	return b?"true":"false";
}
string to_string(const char* s) {
	return string(s);
}
string to_string(string s) {
	return s;
}
string to_string(vt<bool> v) {
	string res;
	FOR(sz(v))
		res+=char('0'+v[i]);
	return res;
}

template<size_t S> string to_string(bitset<S> b) {
	string res;
	FOR(S)
		res+=char('0'+b[i]);
	return res;
}
template<class T> string to_string(T v) {
    bool f=1;
    string res;
    EACH(x, v) {
		if(!f)
			res+=' ';
		f=0;
		res+=to_string(x);
	}
    return res;
}
template<class A, class B> string to_string(pair<A, B>& x) {
	return to_string(x.first) + ' ' + to_string(x.second);
}

template<class A> void write(A x) {
	cout << to_string(x);
}
template<class H, class... T> void write(const H& h, const T&... t) { 
	write(h);
	write(t...);
}
void print() {
	write("\n");
}
template<class H, class... T> void print(const H& h, const T&... t) { 
	write(h);
	if(sizeof...(t))
		write(' ');
	print(t...);
}

#define MX 600001
#define NMX 200000
#define AL 2

struct qu {
	int t, x, y;
};

int tr[MX][AL], ti[NMX], to[NMX], xo[NMX];
set<int> mp[MX];
int e, t;

void add(int x, int y) {
	int v=0;
	FOR(i, 29, -1, -1) {
		int u=(x&(1<<i))>>i;
		if (tr[v][u]==0) tr[v][u]=++t;
		v=tr[v][u];
		mp[v].insert(y);
	}
}

bool check(int v, int l, int r) {
	auto it=mp[v].lower_bound(l);
	return it!=mp[v].end() && *it<r;
}

int query(int x, int l, int r) {
	int v=0, ret=0;
	FOR(i, 29, -1, -1) {
		int u=(x&(1<<i))>>i;
		if (tr[v][u^1] && check(tr[v][u^1], l, r)) {
			ret+=1<<i;
			v=tr[v][u^1];
		} else {
			v=tr[v][u];
		}
	}
	return ret;
}

vt<pii> adj[NMX];

void dfs(int v, int x) {
	ti[v]=e++;
	xo[v]=x;
	for (auto &[u, w] : adj[v]) dfs(u, x^w);
	to[v]=e;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n; read(n);
	string a; int x, y;
	vt<qu> v(n);
	int id=1;
	FOR(n) {
		read(a, x, y);
		if (a=="Add") {
			adj[--x].pb({id++, y});
			v[i]={0, x, y};
		} else {
			v[i]={1, --x, --y};
		}
	}
	dfs(0, 0);
	int idx=1;
	for (auto &[a, b, c] : v) {
		switch (a) {
		case 0:
			add(xo[idx], ti[idx]);
			idx++;
			break;
		case 1:
			print(query(xo[b], ti[c], to[c]));
			break;
		}
	}
}

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