# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
844569 | 2023-09-05T14:11:56 Z | vjudge1 | Klasika (COCI20_klasika) | C++17 | 2 ms | 856 KB |
#include <bits/stdc++.h> using namespace std; #define int long long #define endl "\n" #define all(c) (c).begin(), (c).end() const int N = 2e3 + 5; vector<int> adj[N],xr(N); int res; void dfs(int node,int val){ res = max(res,val ^ xr[node]); for(int go : adj[node]){ dfs(go,val); } } void solve(){ int q; cin >> q; int cnt = 1; for(int i = 0; i < q; i++){ string s; cin >> s; int x,y; cin >> x >> y; if(s[0] == 'A'){ adj[x].push_back(++cnt); xr[cnt] = xr[x] ^ y; } else{ res = 0; dfs(y,xr[x]); cout << res << endl; } } } signed main(){ #ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); freopen("out.txt","w",stdout); #endif ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; // cin >> t; while(t--){ solve(); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 856 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 856 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 856 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 856 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |