Submission #940450

#	Time	Username	Problem	Language	Result	Execution time	Memory
940450		User0069	Klasika (COCI20_klasika)	C++17	33 / 110	773 ms	524288 KiB

klasika

#include<bits/stdc++.h>
#define taskname ""
#define el '\n'
#define fi first
#define sc second
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
//#define int ll
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
#define Faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int maxn=2e5+1;
const int INF=1e9;
vector<int> adj[maxn];
int q,n,in[maxn],out[maxn],a[maxn],b[maxn],v[maxn],cur;
string s[maxn];
struct node
{
    node* child[2];
    node()
    {
        child[1]=child[0]=NULL;
    }
};
void add(node* root, int x)
{
    node* cur=root;
    for(int i=30;i>=0;i--)
    {
        int c=(x>>i)&1;
        if(cur->child[c]==NULL) cur->child[c]=new node();
        cur=cur->child[c];
    }
}
int get(node* root, int x)
{
    node* cur =root;
    if(cur->child[1]==NULL&&cur->child[0]==NULL) return 0;
    int ans=0;
    for(int i=30;i>=0;i--)
    {
        int c=(x>>i)&1;
        if(cur->child[1^c]!=NULL) cur=cur->child[1^c],ans+=(1<<i);
        else cur=cur->child[c];
    }
    return ans;
}
node* ST[4*maxn];
int get(int id,int cl,int cr,int l,int r,int val)
{
    if(cl>r||cr<l) return 0;
    if(cl>=l&&cr<=r) return get(ST[id],val);
    int mid=(cl+cr)/2;
    return max(get(2*id,cl,mid,l,r,val),get(2*id+1,mid+1,cr,l,r,val));
}
void update(int id,int cl,int cr,int pos,int val)
{
    if(cl>pos||cr<pos) return;
    add(ST[id],val);
    if(cl==cr) return;
    int mid=(cl+cr)/2;
    if(pos<=mid) update(2*id,cl,mid,pos,val);
    else update(2*id+1,mid+1,cr,pos,val);
}
void dfs(int x)
{
    in[x]=++cur;
    for(int y:adj[x])
    {
        dfs(y);
    }
    out[x]=cur;
}
signed main()
{
    if (fopen(taskname".INP","r"))
    {
        freopen(taskname".INP","r",stdin);
        freopen(taskname".OUT","w",stdout);
    }
    Faster
    cin>>q;
    for(int i=1;i<=4*q;i++) ST[i]=new node();
    n=1;
    for(int i=1;i<=q;i++)
    {
        cin>>s[i]>>a[i]>>b[i];
        if(s[i]=="Add")
        {
            adj[a[i]].push_back(++n);
            v[n]=b[i]^v[a[i]];
        }
    }
    dfs(1);
    cur=1;
    update(1,1,n,1,0);
    for(int i=1;i<=q;i++)
    {
        if(s[i]=="Add")
        {
            ++cur;
            update(1,1,n,in[cur],v[cur]);
        }
        else
        {
            cout<<get(1,1,n,in[b[i]],out[b[i]],v[a[i]])<<"\n";
        }
    }
//    for(int i=1;i<=n;i++) cout<<v[i]<<" ";
}

Compilation message (stderr)

klasika.cpp: In function 'int main()':
klasika.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen(taskname".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp:82:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         freopen(taskname".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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