/*** 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;
}
Compilation message
klasika.cpp: In function 'void Accept()':
klasika.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
42 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
43 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
792 ms |
287308 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
792 ms |
287308 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
768 ms |
287176 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
792 ms |
287308 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
