oj.uz

Submission #832976

# Submission time Handle Problem Language Result Execution time Memory
832976 2023-08-21T17:39:00 Z damwuan Klasika (COCI20_klasika) C++17
33 / 110
 688 ms 524288 KB 



#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define bit(n,i) ((n>>i)&1)
#define all(x) x.begin(),x.end()
//#pragma GCC optimize("O2,unroll-loops")
//#pragma GCC target("avx,avx2,bmi,bmi2,sse,sse2,sse3,ssse3,sse4,popcnt")
#define int long long
typedef long long ll;
typedef pair<int,int> pii;
typedef double ld;
typedef pair<ld,ld> pdd;
typedef pair<ll,ll> pll;
const ll maxn=2e5+5;
const ll offset=1e9;
const ll block_sz=317;
const ll inf=1e18;
const ll mod=1e9+7;
int n;
struct TrieNode
{
    TrieNode* child[2];
    int cnt;
    TrieNode()
    {
        child[0]=child[1]=nullptr;
        cnt=inf;
    }
};
TrieNode* root[maxn];
void Update(TrieNode* r, int u,int Time)
{
    TrieNode* cur=r;
    for2(i,30,0)
    {
        bool nxt=(u>>i)&1;
        if (cur->child[nxt]==nullptr)
        {
            cur->child[nxt]=new TrieNode;
        }
        cur=cur->child[nxt];
        cur->cnt=min(cur->cnt,Time);
    }
}
int Get(TrieNode* r, int u,int Time)
{
    int ans=0;
    TrieNode* cur=r;
    for2(i,30,0)
    {
        bool nxt=((u>>i)&1)^1;
        //cerr<< nxt<<'\n';
        if (cur->child[nxt]!=nullptr && cur->child[nxt]->cnt<=Time)
        {
            cur=cur->child[nxt];
            ans+=(1<<i);
        }
        else
        //if (cur->child[nxt|1]!=nullptr)
        cur=cur->child[nxt^1];
        //else cout << "wtf\n";
    }
    return ans;
}

int q,id[maxn];
string type;
int pre[maxn],ans[maxn];
vector<int> adj[maxn],L[maxn];
vector<pii> qr[maxn];
void dfs(int u)
{
//    cerr<< u<<' '<<pre[u]<<'\n';
    L[u].pb(u);
    Update(root[u],pre[u],id[u]);
    for(int v: adj[u])
    {
//        cerr<< v<<" asd\n";
        dfs(v);
    }
    for(int v: adj[u])
    {
        if (L[v].size()>L[u].size())
        {
            L[u].swap(L[v]);
            swap(root[u],root[v]);
        }
        for(int a:L[v])
        {
            L[u].pb(a);
            Update(root[u],pre[a],id[a]);
        }
    }
    //cerr<< u<< ' '<<L[u].size()<<" wtf\n";
    //...
    for(auto x: qr[u])
    {
        //cerr<< u<<' '<<x.se<<' '<<x.fi<<' '<<L[u].size()<<'\n';
        ans[x.se]=Get(root[u],x.fi,x.se);
    }
}
void sol()
{
    cin >> q;
    n=1;
    for1(i,1,q)
    {
        ans[i]=-1;
        int a,b;cin>> type>>a>>b;
        if (type[0]=='A')
        {
            adj[a].pb(++n);
            pre[n]=pre[a]^b;
            id[n]=i;
        }
        else
        {
            qr[b].pb({pre[a],i});
        }
    }
    for1(i,1,n) root[i]=new TrieNode;
//    cerr<< "kk\n";
    dfs(1);
    for1(i,1,q) if (ans[i]!=-1) cout << ans[i]<<'\n';
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
//    freopen("GROUPDIV.inp","r",stdin);
//    freopen("GROUPDIV.out","w",stdout);

    int t=1;//cin >> t;
    while (t--)
    {
        sol();
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14548 KB Output is correct
3 Correct 7 ms 14548 KB Output is correct
4 Correct 8 ms 14676 KB Output is correct
5 Correct 8 ms 14536 KB Output is correct
6 Correct 7 ms 14548 KB Output is correct
7 Correct 8 ms 14676 KB Output is correct
8 Correct 7 ms 14812 KB Output is correct
9 Correct 6 ms 14548 KB Output is correct
10 Correct 6 ms 14616 KB Output is correct
11 Correct 7 ms 14676 KB Output is correct
12 Correct 7 ms 14804 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14548 KB Output is correct
3 Correct 7 ms 14548 KB Output is correct
4 Correct 8 ms 14676 KB Output is correct
5 Correct 8 ms 14536 KB Output is correct
6 Correct 7 ms 14548 KB Output is correct
7 Correct 8 ms 14676 KB Output is correct
8 Correct 7 ms 14812 KB Output is correct
9 Correct 6 ms 14548 KB Output is correct
10 Correct 6 ms 14616 KB Output is correct
11 Correct 7 ms 14676 KB Output is correct
12 Correct 7 ms 14804 KB Output is correct
13 Correct 8 ms 15188 KB Output is correct
14 Correct 8 ms 15956 KB Output is correct
15 Correct 9 ms 16724 KB Output is correct
16 Correct 11 ms 17364 KB Output is correct
17 Correct 9 ms 15700 KB Output is correct
18 Correct 10 ms 16980 KB Output is correct
19 Correct 12 ms 18504 KB Output is correct
20 Correct 18 ms 19820 KB Output is correct
21 Correct 9 ms 15540 KB Output is correct
22 Correct 10 ms 16596 KB Output is correct
23 Correct 11 ms 17620 KB Output is correct
24 Correct 14 ms 18588 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 87856 KB Output is correct
2 Correct 224 ms 152736 KB Output is correct
3 Correct 282 ms 215324 KB Output is correct
4 Correct 341 ms 278652 KB Output is correct
5 Correct 288 ms 185100 KB Output is correct
6 Correct 477 ms 354952 KB Output is correct
7 Correct 688 ms 524288 KB Output is correct
8 Runtime error 617 ms 524288 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14548 KB Output is correct
3 Correct 7 ms 14548 KB Output is correct
4 Correct 8 ms 14676 KB Output is correct
5 Correct 8 ms 14536 KB Output is correct
6 Correct 7 ms 14548 KB Output is correct
7 Correct 8 ms 14676 KB Output is correct
8 Correct 7 ms 14812 KB Output is correct
9 Correct 6 ms 14548 KB Output is correct
10 Correct 6 ms 14616 KB Output is correct
11 Correct 7 ms 14676 KB Output is correct
12 Correct 7 ms 14804 KB Output is correct
13 Correct 8 ms 15188 KB Output is correct
14 Correct 8 ms 15956 KB Output is correct
15 Correct 9 ms 16724 KB Output is correct
16 Correct 11 ms 17364 KB Output is correct
17 Correct 9 ms 15700 KB Output is correct
18 Correct 10 ms 16980 KB Output is correct
19 Correct 12 ms 18504 KB Output is correct
20 Correct 18 ms 19820 KB Output is correct
21 Correct 9 ms 15540 KB Output is correct
22 Correct 10 ms 16596 KB Output is correct
23 Correct 11 ms 17620 KB Output is correct
24 Correct 14 ms 18588 KB Output is correct
25 Correct 154 ms 87856 KB Output is correct
26 Correct 224 ms 152736 KB Output is correct
27 Correct 282 ms 215324 KB Output is correct
28 Correct 341 ms 278652 KB Output is correct
29 Correct 288 ms 185100 KB Output is correct
30 Correct 477 ms 354952 KB Output is correct
31 Correct 688 ms 524288 KB Output is correct
32 Runtime error 617 ms 524288 KB Execution killed with signal 9
33 Halted 0 ms 0 KB -