oj.uz

답안 #318941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
318941 2020-11-03T13:44:10 Z leaked Klasika (COCI20_klasika) C++14
110 / 110
 4001 ms 513588 KB 
#include<bits/stdc++.h>

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

//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//    #pragma GCC target("avx,avx2,fma")
//    #pragma GCC optimization ("unroll-loops")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define f first
#define vec vector
#define s second
#define p_b push_back
#define pb push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<long long,long long> pll;
typedef pair<int,int> pii;
typedef pair<long long,int> pli;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
int inf = 1e9,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
template<typename T> bool umax(T& a, T b) {return a<b?a=b,1:0;}
template<typename T> bool umin(T& a, T b) {return b<a?a=b,1:0;}
bool is_prime(ll val){for(ll i=2;i<=sqrt(val);i++)if(val%i==0)return 0; return 1;}
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll RR=1e4;
const ll tx[8]={1,-1,2,-2,-1,-2};
const ll ty[8]={-2,-2,-1,-1,2,1};
const char rev_to[4]={'E','W','N','S'};
///////////////////fdsfsdfgdsjgdjfsgdsfsdkafsdaokfsdpofdckokfpgjvdsujbgdfpiodjOFCjs;igsd;cpjzckpdoskvgdok;a///////
const int ppp=73;
const int M=1e9+7;
///////////////////fdsfsdfgdsjgdjfsgdsfsdkafsdaokfsdpofdckokfpgjvdsujbgdfpiodjOFCjs;igsd;cpjzckpdoskvgdok;a///////
//const int ppp=73;
const int block=600;
const int OPEN=1;
const int CLOSE=0;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> o_st;
auto rnd=bind(uniform_int_distribution<int>(1,5969699),mt19937(time(0)));
void bad(){
    cout<<"-1";
    exit(0);
}
const int N=2e5+4;
const int lg=30;
int in[N],out[N];
int xr[N];
vec<int>g[N];
int ti;
int n=1;
map<int,int>mp;
map<int,int>obr;
void dfs1(int v,int p){
    in[v]=++ti;
    xr[v]=xr[p]^obr[v];
    if(v==p)
        xr[v]=0;
    for(auto &z : g[v]){
        if(z^p)
            dfs1(z,v);
    }
    out[v]=ti;
}
struct query{
    int tp,x,y;
    query(string s,int _x,int _y){
        tp=(s=="Add"?1:2);
        x=_x;y=_y;
    }
};
struct node{
    node *a[2];
    int cl;
    o_st st;
    node(){
        a[0]=a[1]=nullptr;
        cl=0;
    }
};
node *root=new node();
void add(int x,int id){
    node  *cur=root;
    for(int i=lg-1;i>=0;i--){
        int bt=(x>>i)&1;
        if(!cur->a[bt]){
            cur->a[bt]=new node();
        }
        cur=cur->a[bt];
        cur->st.insert(id);
    }
}
int GET(int x,int l,int r){
    int sub=0;
    node *cur=root;
    for(int i=lg-1;i>=0;i--){
        int bt=(x>>i)&1;
        if(cur->a[bt^1]){
            int cl=cur->a[bt^1]->st.order_of_key(r+1)-cur->a[bt^1]->st.order_of_key(l);
            if(cl){
                cur=cur->a[bt^1];
                sub+=(1<<i);
                continue;
            }
        }
        cur=cur->a[bt];
    }
    return sub;
}
signed main()
{
    fast_io;
    int t;
    cin>>t;
    vec<query>q;
    mp[1]=1;
    obr[1]=1;
    for(int i=0;i<t;i++){
        int x,y;
        string s;
        cin>>s>>x>>y;
        query lel=query(s,x,y);
        q.pb(lel);
        if(q[i].tp==1){
            int a=x,b=++n;
            mp[y]=n;
            obr[n]=y;
            g[a].pb(b);
            q[i].x=a,q[i].y=b;
//            debug()<<imie(a)imie(b);
        }
        else{
            int a=x,b=y;
            q[i].x=a,q[i].y=b;
        }
    }
    dfs1(1,1);
    add(0,1);
//    return 0;
    for(int i=0;i<t;i++){
        if(q[i].tp==1){
            int id=q[i].y;
            add(xr[id],in[id]);
//            debug()<<imie(id)imie(xr[id]);
        }
        else{
            int x=xr[q[i].x];
            int l=in[q[i].y],r=out[q[i].y];
//            debug()<<imie(l)imie(r);
            cout<<GET(x,l,r)<<endl;
        }
//        debug()<<imie("YE");
    }
    return 0;
}
/*



*/

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5356 KB Output is correct
2 Correct 4 ms 5356 KB Output is correct
3 Correct 5 ms 5612 KB Output is correct
4 Correct 4 ms 5760 KB Output is correct
5 Correct 4 ms 5228 KB Output is correct
6 Correct 4 ms 5356 KB Output is correct
7 Correct 4 ms 5484 KB Output is correct
8 Correct 4 ms 5760 KB Output is correct
9 Correct 4 ms 5228 KB Output is correct
10 Correct 5 ms 5484 KB Output is correct
11 Correct 5 ms 5612 KB Output is correct
12 Correct 4 ms 5740 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5356 KB Output is correct
2 Correct 4 ms 5356 KB Output is correct
3 Correct 5 ms 5612 KB Output is correct
4 Correct 4 ms 5760 KB Output is correct
5 Correct 4 ms 5228 KB Output is correct
6 Correct 4 ms 5356 KB Output is correct
7 Correct 4 ms 5484 KB Output is correct
8 Correct 4 ms 5760 KB Output is correct
9 Correct 4 ms 5228 KB Output is correct
10 Correct 5 ms 5484 KB Output is correct
11 Correct 5 ms 5612 KB Output is correct
12 Correct 4 ms 5740 KB Output is correct
13 Correct 8 ms 6764 KB Output is correct
14 Correct 10 ms 8428 KB Output is correct
15 Correct 13 ms 9996 KB Output is correct
16 Correct 15 ms 11372 KB Output is correct
17 Correct 11 ms 6764 KB Output is correct
18 Correct 12 ms 8172 KB Output is correct
19 Correct 13 ms 9756 KB Output is correct
20 Correct 15 ms 11116 KB Output is correct
21 Correct 8 ms 6764 KB Output is correct
22 Correct 11 ms 8300 KB Output is correct
23 Correct 13 ms 9708 KB Output is correct
24 Correct 16 ms 11116 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1579 ms 145928 KB Output is correct
2 Correct 2351 ms 272056 KB Output is correct
3 Correct 2983 ms 392292 KB Output is correct
4 Correct 3621 ms 513164 KB Output is correct
5 Correct 1240 ms 142352 KB Output is correct
6 Correct 1943 ms 264976 KB Output is correct
7 Correct 2579 ms 382136 KB Output is correct
8 Correct 3251 ms 499344 KB Output is correct
9 Correct 1304 ms 142196 KB Output is correct
10 Correct 2107 ms 266512 KB Output is correct
11 Correct 2866 ms 385896 KB Output is correct
12 Correct 3594 ms 502232 KB Output is correct

Subtask #4
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5356 KB Output is correct
2 Correct 4 ms 5356 KB Output is correct
3 Correct 5 ms 5612 KB Output is correct
4 Correct 4 ms 5760 KB Output is correct
5 Correct 4 ms 5228 KB Output is correct
6 Correct 4 ms 5356 KB Output is correct
7 Correct 4 ms 5484 KB Output is correct
8 Correct 4 ms 5760 KB Output is correct
9 Correct 4 ms 5228 KB Output is correct
10 Correct 5 ms 5484 KB Output is correct
11 Correct 5 ms 5612 KB Output is correct
12 Correct 4 ms 5740 KB Output is correct
13 Correct 8 ms 6764 KB Output is correct
14 Correct 10 ms 8428 KB Output is correct
15 Correct 13 ms 9996 KB Output is correct
16 Correct 15 ms 11372 KB Output is correct
17 Correct 11 ms 6764 KB Output is correct
18 Correct 12 ms 8172 KB Output is correct
19 Correct 13 ms 9756 KB Output is correct
20 Correct 15 ms 11116 KB Output is correct
21 Correct 8 ms 6764 KB Output is correct
22 Correct 11 ms 8300 KB Output is correct
23 Correct 13 ms 9708 KB Output is correct
24 Correct 16 ms 11116 KB Output is correct
25 Correct 1579 ms 145928 KB Output is correct
26 Correct 2351 ms 272056 KB Output is correct
27 Correct 2983 ms 392292 KB Output is correct
28 Correct 3621 ms 513164 KB Output is correct
29 Correct 1240 ms 142352 KB Output is correct
30 Correct 1943 ms 264976 KB Output is correct
31 Correct 2579 ms 382136 KB Output is correct
32 Correct 3251 ms 499344 KB Output is correct
33 Correct 1304 ms 142196 KB Output is correct
34 Correct 2107 ms 266512 KB Output is correct
35 Correct 2866 ms 385896 KB Output is correct
36 Correct 3594 ms 502232 KB Output is correct
37 Correct 2130 ms 146968 KB Output is correct
38 Correct 2897 ms 271896 KB Output is correct
39 Correct 3482 ms 395548 KB Output is correct
40 Correct 4001 ms 513588 KB Output is correct
41 Correct 1830 ms 142964 KB Output is correct
42 Correct 2492 ms 265148 KB Output is correct
43 Correct 3000 ms 382440 KB Output is correct
44 Correct 3443 ms 498272 KB Output is correct
45 Correct 2112 ms 142628 KB Output is correct
46 Correct 2837 ms 266628 KB Output is correct
47 Correct 3343 ms 384220 KB Output is correct
48 Correct 3806 ms 502068 KB Output is correct