oj.uz

Submission #1117361

# Submission time Handle Problem Language Result Execution time Memory
1117361 2024-11-23T11:58:39 Z Tai_xiu Klasika (COCI20_klasika) C++14
110 / 110
 1699 ms 51016 KB 
#include<bits/stdc++.h>
using namespace std;

#define i128 int128
#define ii pair<int,int>
#define ld long double
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pair<int,int>>
#define FOR(i,a,b) for (int i=a;i<=b;i++)
#define FOR1(i,a,b,c) for (int i=a;i<=b;i+=c)
#define REP(i,a,b) for (int i=a;i>=b;i--)
#define REP1(i,a,b,c) for(int i=b;i>=a;i-=c)
#define endh '\n';
#define len(a) a.length()
#define pb(c) push_back(c)
#define elif else if
#define ppb() pop_back()
#define rong std::npos
#define all(c) (c.begin(),c.end())
#define Z int
#define R double
#define lcm(a,b) ((int) (a/__gcd(a,b))*b)
#define mk(a,b) make_pair(a,b)
Z dx4[]={-1,1,0,0};
Z dy4[]={0,0,1,-1};
string co="YES",khong="NO";
const int mod=1e9+7;
const Z maxn=200005;
const Z blocksize=2024;
Z tour[maxn],tin[maxn],tout[maxn],s[maxn],id=0,cnode=1,nv[maxn],check[maxn];
Z q;
vi g[maxn];
struct item
{
    Z type,x,y;
    item(){}
    item(Z _type,Z _x,Z _y)
    {
        type=_type;
        x=_x;
        y=_y;
    }
}Q[maxn];
Z tt[maxn*64][2];
struct trie
{
    Z root;

    void update(Z val)
    {
        Z curr=root;
        REP(i,30,0){
            if (val>>i&1){
                if (tt[curr][1]==0){
                    tt[curr][1]= ++cnode;
                }
                curr=tt[curr][1];
            }
            else{
               if (tt[curr][0]==0){
                    tt[curr][0]= ++cnode;
                }
                curr=tt[curr][0];
            }
        }
    }
    Z query (Z val)
    {
        Z curr=root;
        Z ans=0;
        REP(i,30,0){

            Z tam=(val>>i&1);
            if (tt[curr][tam^1]!=0){
                ans+=(1<<i);
                 curr=tt[curr][tam^1];
            }
            else if ( tt[curr][tam]!=0){
                 curr=tt[curr][tam];
            }
            else return ans;
        }
        return ans;
    }
}st[maxn];
void dfs(Z u)
{
    tour[++id]=u;
    tin[u]=id;
    for (Z v:g[u]){
        dfs(v);
    }
    tout[u]=id;
}
void update(Z pos,Z val)
{
  nv[pos]=val;
  check[pos]=1;
  st[pos/blocksize].update(val);
}
Z query(Z l,Z r,Z val)
{
   Z ans=0;
    Z taml=l/blocksize,tamr=r/blocksize;
    if (l/blocksize==r/blocksize){
        FOR(i,l,r){
            if (check[i])
                ans=max(ans,nv[i]^val);
        }
        return ans;
    }
    FOR(i,l,r){
        if (i%blocksize==0){
            taml=i/blocksize;
            break;
        }
        if (check[i]) ans=max(ans,nv[i]^val);
    }
    REP(i,r,l){
        if (check[i]) ans=max(ans,nv[i]^val);
        if (i%blocksize==0){
            tamr=(i-1)/blocksize;
            break;
        }
    }
    FOR(i,taml,tamr){
        ans=max(ans,st[i].query(val));
    }
    return ans;
}
void solve()
{
    cin>>q;
    Z cnt=1;
    FOR(i,1,q)
    {
        string aa;
        Z x,y,type;
        cin>>aa>>x>>y;
        if (aa[0]=='A') type=1;
        else type=2;
        if (type==1)
        {
            cnt++;
            g[x].pb(cnt);
            s[cnt]=(s[x]^y);
            Q[i]=item(1,cnt,0);
        }
        else{
            Q[i]=item(2,x,y);
        }
    }
    dfs(1);

    cnode=cnt/blocksize+1;
    FOR(i,1,cnt/blocksize+1) st[i].root=i;
    update(1,s[1]);
    FOR(i,1,q){
        if (Q[i].type==1){
            update(tin[Q[i].x],s[Q[i].x]);
        }
        else{
            Z tam=s[Q[i].x];
            cout<<query(tin[Q[i].y],tout[Q[i].y],tam)<<'\n';
        }
    }
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    Z t=1;
  //  cin>>t;
    while(t--) solve();
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8528 KB Output is correct
2 Correct 2 ms 8528 KB Output is correct
3 Correct 2 ms 8528 KB Output is correct
4 Correct 2 ms 8528 KB Output is correct
5 Correct 2 ms 8528 KB Output is correct
6 Correct 2 ms 8528 KB Output is correct
7 Correct 2 ms 8528 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 2 ms 8528 KB Output is correct
10 Correct 2 ms 8528 KB Output is correct
11 Correct 2 ms 8528 KB Output is correct
12 Correct 2 ms 8528 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8528 KB Output is correct
2 Correct 2 ms 8528 KB Output is correct
3 Correct 2 ms 8528 KB Output is correct
4 Correct 2 ms 8528 KB Output is correct
5 Correct 2 ms 8528 KB Output is correct
6 Correct 2 ms 8528 KB Output is correct
7 Correct 2 ms 8528 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 2 ms 8528 KB Output is correct
10 Correct 2 ms 8528 KB Output is correct
11 Correct 2 ms 8528 KB Output is correct
12 Correct 2 ms 8528 KB Output is correct
13 Correct 4 ms 8784 KB Output is correct
14 Correct 3 ms 8784 KB Output is correct
15 Correct 3 ms 8948 KB Output is correct
16 Correct 4 ms 9040 KB Output is correct
17 Correct 3 ms 8784 KB Output is correct
18 Correct 3 ms 8784 KB Output is correct
19 Correct 3 ms 8980 KB Output is correct
20 Correct 4 ms 9052 KB Output is correct
21 Correct 3 ms 8784 KB Output is correct
22 Correct 3 ms 8784 KB Output is correct
23 Correct 3 ms 8784 KB Output is correct
24 Correct 4 ms 9040 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 925 ms 22652 KB Output is correct
2 Correct 992 ms 32060 KB Output is correct
3 Correct 921 ms 41320 KB Output is correct
4 Correct 744 ms 50980 KB Output is correct
5 Correct 1384 ms 20680 KB Output is correct
6 Correct 1699 ms 28292 KB Output is correct
7 Correct 1674 ms 35992 KB Output is correct
8 Correct 1116 ms 43544 KB Output is correct
9 Correct 935 ms 21096 KB Output is correct
10 Correct 1046 ms 29328 KB Output is correct
11 Correct 1048 ms 37104 KB Output is correct
12 Correct 725 ms 45152 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8528 KB Output is correct
2 Correct 2 ms 8528 KB Output is correct
3 Correct 2 ms 8528 KB Output is correct
4 Correct 2 ms 8528 KB Output is correct
5 Correct 2 ms 8528 KB Output is correct
6 Correct 2 ms 8528 KB Output is correct
7 Correct 2 ms 8528 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 2 ms 8528 KB Output is correct
10 Correct 2 ms 8528 KB Output is correct
11 Correct 2 ms 8528 KB Output is correct
12 Correct 2 ms 8528 KB Output is correct
13 Correct 4 ms 8784 KB Output is correct
14 Correct 3 ms 8784 KB Output is correct
15 Correct 3 ms 8948 KB Output is correct
16 Correct 4 ms 9040 KB Output is correct
17 Correct 3 ms 8784 KB Output is correct
18 Correct 3 ms 8784 KB Output is correct
19 Correct 3 ms 8980 KB Output is correct
20 Correct 4 ms 9052 KB Output is correct
21 Correct 3 ms 8784 KB Output is correct
22 Correct 3 ms 8784 KB Output is correct
23 Correct 3 ms 8784 KB Output is correct
24 Correct 4 ms 9040 KB Output is correct
25 Correct 925 ms 22652 KB Output is correct
26 Correct 992 ms 32060 KB Output is correct
27 Correct 921 ms 41320 KB Output is correct
28 Correct 744 ms 50980 KB Output is correct
29 Correct 1384 ms 20680 KB Output is correct
30 Correct 1699 ms 28292 KB Output is correct
31 Correct 1674 ms 35992 KB Output is correct
32 Correct 1116 ms 43544 KB Output is correct
33 Correct 935 ms 21096 KB Output is correct
34 Correct 1046 ms 29328 KB Output is correct
35 Correct 1048 ms 37104 KB Output is correct
36 Correct 725 ms 45152 KB Output is correct
37 Correct 618 ms 23148 KB Output is correct
38 Correct 618 ms 32552 KB Output is correct
39 Correct 564 ms 41800 KB Output is correct
40 Correct 490 ms 51016 KB Output is correct
41 Correct 77 ms 21064 KB Output is correct
42 Correct 103 ms 28744 KB Output is correct
43 Correct 107 ms 36168 KB Output is correct
44 Correct 129 ms 43592 KB Output is correct
45 Correct 170 ms 21472 KB Output is correct
46 Correct 180 ms 29388 KB Output is correct
47 Correct 179 ms 37192 KB Output is correct
48 Correct 173 ms 45384 KB Output is correct