Submission #737615

#	Time	Username	Problem	Language	Result	Execution time	Memory
737615		Sam_a17	Klasika (COCI20_klasika)	C++17	110 / 110	2698 ms	507444 KiB

klasika

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

int ka() {
	int x = 0;
	bool z = false;
	while (1)
	{
		char y = getchar();
		if (y == '-')
			z = true;
		else if ('0' <= y && y <= '9')
			x = x * 10 + y - '0';
		else
		{
			if (z)
				x *= -1;
			return x;
		}
	}
}

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 1;
vector<int> adj[N];
int q, tin[N], tout[N], timer;
int dp[N];

const int M = N * 12;
int cnt, t[M][2];
set<int> stik[M][2];

void init() {
  for(int i = 0; i < M; i++) {
    t[i][0] = t[i][1] = -1;
  }
}

void upd(int x, int tt) {
  int st = 0;
  for(int i = 30; i >= 0; i--) {
    bool flag = (x >> i) & 1;
    if(t[st][flag] == -1) {
      t[st][flag] = ++cnt;
    }
    stik[st][flag].insert(tt);
    st = t[st][flag];
  }
}

int qry(int x, int star, int en) {
  int answ = 0, st = 0;
  for(int i = 30; i >= 0; i--) {
    bool flag = (x >> i) & 1;
    auto bit = stik[st][!flag].lower_bound(star);
    if(!stik[st][!flag].empty() 
      && bit != stik[st][!flag].end() && *bit >= star && *bit <= en) {
      st = t[st][!flag];
      answ |= (1 << i);
    } else {
      st = t[st][flag];
    }
  }
  return answ;
}

struct query {
  string s;
  long long x, y;
};

vector<query> queries;

void dfs(int node) {
  tin[node] = timer++;
  for(auto i: adj[node]) {
    dfs(i);
  }
  tout[node] = timer - 1;
}

void solve_() {
  cin >> q;
  // dp[1] = 0;

  int it = 2;
  for(int i = 1; i <= q; i++) {
    string s; cin >> s;
    int x, y; cin >> x >> y;
    if(s[0] == 'A') {
      adj[x].push_back(it);
      it++;
    }
    queries.push_back({s, x, y});
  }

  dfs(1);

  init();
  upd(0, tin[1]);
  it = 2;
  for(auto i: queries) {
    string s = i.s;
    long long x = i.x, y = i.y;

    if(s[0] == 'A') {
      dp[it] = dp[x] ^ y;
      upd(dp[it], tin[it]);
      it++;
    } else {
      cout << qry(dp[x], tin[y], tout[y]) << '\n';
    } 
  }
} 
 
int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
} 

Compilation message (stderr)

klasika.cpp: In function 'void setIO(std::string)':
klasika.cpp:83:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp:84:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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