oj.uz

Submission #336733

# Submission time Handle Problem Language Result Execution time Memory
336733 2020-12-16T15:20:28 Z KarenT Klasika (COCI20_klasika) C++17
110 / 110
 3575 ms 202268 KB 
#include <bits/stdc++.h>

using namespace std;

#define F first
#define S second
#define pb push_back
#define pii pair <int, int>
#define lc (ind << 1)
#define rc (lc | 1)
#define md ((b + e) >> 1)

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double; 
using str = string; // yay python!
 
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>; 
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>; 
using vpd = vector<pd>;
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
tcT> using PR = pair<T,T>;
 
// pairs
#define mp make_pair
#define f first
#define s second
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back 
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound 
tcT> int lwb(V<T>& a, const T& b) { return int(lb(all(a),b)-bg(a)); }
 
// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
 
// bitwise ops
// also see https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { assert(x >= 0);
	return x == 0 ? 0 : 31-__builtin_clz(x); } // floor(log2(x)) 
constexpr int p2(int x) { return 1<<x; }
constexpr int msk2(int x) { return p2(x)-1; }
 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
 
tcT> bool ckmin(T& a, const T& b) {
	return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
	return a < b ? a = b, 1 : 0; }
 
tcTU> T fstTrue(T lo, T hi, U f) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo)/2;
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
	lo --; assert(lo <= hi); // assuming f is decreasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo+1)/2;
		f(mid) ? lo = mid : hi = mid-1;
	} 
	return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
	sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
	auto it = t.find(u); assert(it != end(t));
	t.erase(it); } // element that doesn't exist from (multi)set
 
// INPUT
#define tcTUU tcT, class ...U
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(V<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);
 
tcT> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }
 
tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(V<T>& x) { trav(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { trav(a,x) re(a); }
tcT> void rv(int n, V<T>& x) { x.rsz(n); re(x); }
 
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
	#ifdef LOCAL
		return b ? "true" : "false"; 
	#else 
		return ts((int)b);
	#endif
}
tcT> str ts(complex<T> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(V<bool> v) {
	str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
tcTU> str ts(pair<T,U> p);
tcT> str ts(T v) { // containers with begin(), end()
	#ifdef LOCAL
		bool fst = 1; str res = "{";
		for (const auto& x: v) {
			if (!fst) res += ", ";
			fst = 0; res += ts(x);
		}
		res += "}"; return res;
	#else
		bool fst = 1; str res = "";
		for (const auto& x: v) {
			if (!fst) res += " ";
			fst = 0; res += ts(x);
		}
		return res;
 
	#endif
}
tcTU> str ts(pair<T,U> p) {
	#ifdef LOCAL
		return "("+ts(p.f)+", "+ts(p.s)+")"; 
	#else
		return ts(p.f)+" "+ts(p.s);
	#endif
}
 
// OUTPUT
tcT> void pr(T x) { cout << ts(x); }
tcTUU> void pr(const T& t, const U&... u) { 
	pr(t); pr(u...); }
void ps() { pr("\n"); } // print w/ spaces
tcTUU> void ps(const T& t, const U&... u) { 
	pr(t); if (sizeof...(u)) pr(" "); ps(u...); }
 
// DEBUG
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
	cerr << ts(t); if (sizeof...(u)) cerr << ", ";
	DBG(u...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
	#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
	#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
		 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
	#define dbg(...) 0
	#define chk(...) 0
#endif
 
void setPrec() { cout << fixed << setprecision(15); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void setIO(str s = "") {
	unsyncIO(); setPrec();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) setIn(s+".in"), setOut(s+".out"); // for USACO
}
const ll N = 2e5 + 10;
const ll LOG = 30;

int n = 1, q;
ll pxor[N];
int L[N], R[N], _time;
vector < pair <int, ll> > adj[N];
vector < pair <bool, pii> > Q;
set <ll> s[4 * N];

void DFS(int v = 1){
    L[v] = _time ++;
    for (auto i : adj[v]){
        int u = i.F;
        ll w = i.S;
        pxor[u] = (pxor[v] ^ w);
        DFS(u);
    }
    R[v] = _time;
    return;
}
void add(int id, ll val, int b = 0, int e = n, int ind = 1){
    s[ind].insert(val);
    if (b + 1 == e) return;
    if (id < md) add(id, val, b, md, lc);
    else add(id, val, md, e, rc);
    return;
}
ll get_best(ll x, int v){
    ll best = 0;
    for (int i = LOG; i >= 0; i--){
        if ((x >> i) & 1){
            ll cur = best;
            auto it = s[v].lower_bound(cur);
            if (it == s[v].end()) continue;
            if (((*it) >> i) & 1){
                best += (1ll << i);
            }
        }
        else {
            ll cur = best + (1ll << (i + 1));
            auto it = s[v].lower_bound(cur);
            if (it == s[v].begin()) continue;
            it --;
            if (((*it) >> i) & 1){
                best += (1ll << i);
            }
        }
    }
    return best;
}
ll get(ll val, int l, int r, int b = 0, int e = n, int ind = 1){
    if (l <= b && e <= r){
        if (s[ind].size() == 0) return val;
        ll res = get_best(val, ind);
        auto j = s[ind].lower_bound(res);
        while (j == s[ind].end() || (*j) != res){
        }
        return res; 
    }
    ll res1 = -1, res2 = -1;
    if (l < md) res1 = get(val, l, r, b, md, lc);
    if (md < r) res2 = get(val, l, r, md, e, rc);
    if (res1 == -1 && res2 == -1) return val;
    if (res1 == -1) return res2;
    if (res2 == -1) return res1;
    if ((val ^ res1) < (val ^ res2)) return res2;
    return res1;
}
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> q;
    for (int i = 0; i < q; i++){
        string typ;
        int a, b;
        cin >> typ >> a >> b;
        if (typ == "Add"){
            n ++;
            adj[a].pb({n, b});
            Q.pb({1, {n, 0}});
        }
        else {
            Q.pb({0, {a, b}});
        } 
    }
    DFS(); 
    add(L[1], 0);
    for (pair <bool, pii> i : Q){
        if (i.F){
            int v = i.S.F;
            add(L[v], pxor[v]);
        }
        else {
            int a = i.S.F, b = i.S.S;
            cout << (pxor[a] ^ get(pxor[a], L[b], R[b])) << '\n';
        }
    }
    return 0;
}

/*
4
Add 1 5
Query 1 1
Add 1 7
Query 1 1
*/
/*
6
Add 1 5
Add 2 7
Add 1 4
Add 4 3
Query 1 1
Query 2 4
*/
/*
10
Add 1 4
Add 1 9
Add 1 10
Add 2 2
Add 3 3
Add 4 4
Query 4 2
Query 1 3
Add 6 7
Query 1 3
*/

Compilation message

klasika.cpp: In function 'void setIn(str)':
klasika.cpp:208:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  208 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
klasika.cpp: In function 'void setOut(str)':
klasika.cpp:209:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  209 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 42604 KB Output is correct
2 Correct 29 ms 42604 KB Output is correct
3 Correct 29 ms 42732 KB Output is correct
4 Correct 30 ms 42860 KB Output is correct
5 Correct 29 ms 42604 KB Output is correct
6 Correct 30 ms 42604 KB Output is correct
7 Correct 30 ms 42732 KB Output is correct
8 Correct 31 ms 42732 KB Output is correct
9 Correct 29 ms 42604 KB Output is correct
10 Correct 29 ms 42732 KB Output is correct
11 Correct 29 ms 42732 KB Output is correct
12 Correct 29 ms 42732 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 42604 KB Output is correct
2 Correct 29 ms 42604 KB Output is correct
3 Correct 29 ms 42732 KB Output is correct
4 Correct 30 ms 42860 KB Output is correct
5 Correct 29 ms 42604 KB Output is correct
6 Correct 30 ms 42604 KB Output is correct
7 Correct 30 ms 42732 KB Output is correct
8 Correct 31 ms 42732 KB Output is correct
9 Correct 29 ms 42604 KB Output is correct
10 Correct 29 ms 42732 KB Output is correct
11 Correct 29 ms 42732 KB Output is correct
12 Correct 29 ms 42732 KB Output is correct
13 Correct 36 ms 42988 KB Output is correct
14 Correct 37 ms 43244 KB Output is correct
15 Correct 37 ms 43500 KB Output is correct
16 Correct 35 ms 43756 KB Output is correct
17 Correct 33 ms 42988 KB Output is correct
18 Correct 33 ms 43116 KB Output is correct
19 Correct 33 ms 43372 KB Output is correct
20 Correct 33 ms 43628 KB Output is correct
21 Correct 34 ms 42860 KB Output is correct
22 Correct 34 ms 43116 KB Output is correct
23 Correct 34 ms 43372 KB Output is correct
24 Correct 34 ms 43628 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 963 ms 84016 KB Output is correct
2 Correct 1265 ms 122316 KB Output is correct
3 Correct 1455 ms 161112 KB Output is correct
4 Correct 1642 ms 202040 KB Output is correct
5 Correct 1132 ms 82056 KB Output is correct
6 Correct 1677 ms 118316 KB Output is correct
7 Correct 2227 ms 155160 KB Output is correct
8 Correct 2738 ms 193852 KB Output is correct
9 Correct 956 ms 81932 KB Output is correct
10 Correct 1309 ms 119068 KB Output is correct
11 Correct 1560 ms 156572 KB Output is correct
12 Correct 1786 ms 195612 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 42604 KB Output is correct
2 Correct 29 ms 42604 KB Output is correct
3 Correct 29 ms 42732 KB Output is correct
4 Correct 30 ms 42860 KB Output is correct
5 Correct 29 ms 42604 KB Output is correct
6 Correct 30 ms 42604 KB Output is correct
7 Correct 30 ms 42732 KB Output is correct
8 Correct 31 ms 42732 KB Output is correct
9 Correct 29 ms 42604 KB Output is correct
10 Correct 29 ms 42732 KB Output is correct
11 Correct 29 ms 42732 KB Output is correct
12 Correct 29 ms 42732 KB Output is correct
13 Correct 36 ms 42988 KB Output is correct
14 Correct 37 ms 43244 KB Output is correct
15 Correct 37 ms 43500 KB Output is correct
16 Correct 35 ms 43756 KB Output is correct
17 Correct 33 ms 42988 KB Output is correct
18 Correct 33 ms 43116 KB Output is correct
19 Correct 33 ms 43372 KB Output is correct
20 Correct 33 ms 43628 KB Output is correct
21 Correct 34 ms 42860 KB Output is correct
22 Correct 34 ms 43116 KB Output is correct
23 Correct 34 ms 43372 KB Output is correct
24 Correct 34 ms 43628 KB Output is correct
25 Correct 963 ms 84016 KB Output is correct
26 Correct 1265 ms 122316 KB Output is correct
27 Correct 1455 ms 161112 KB Output is correct
28 Correct 1642 ms 202040 KB Output is correct
29 Correct 1132 ms 82056 KB Output is correct
30 Correct 1677 ms 118316 KB Output is correct
31 Correct 2227 ms 155160 KB Output is correct
32 Correct 2738 ms 193852 KB Output is correct
33 Correct 956 ms 81932 KB Output is correct
34 Correct 1309 ms 119068 KB Output is correct
35 Correct 1560 ms 156572 KB Output is correct
36 Correct 1786 ms 195612 KB Output is correct
37 Correct 3278 ms 84640 KB Output is correct
38 Correct 3575 ms 122612 KB Output is correct
39 Correct 3326 ms 162332 KB Output is correct
40 Correct 2713 ms 202268 KB Output is correct
41 Correct 827 ms 82312 KB Output is correct
42 Correct 1361 ms 118684 KB Output is correct
43 Correct 1925 ms 155292 KB Output is correct
44 Correct 2563 ms 193584 KB Output is correct
45 Correct 1520 ms 82696 KB Output is correct
46 Correct 1856 ms 119400 KB Output is correct
47 Correct 1977 ms 156288 KB Output is correct
48 Correct 2025 ms 195484 KB Output is correct