oj.uz

Submission #940898

# Submission time Handle Problem Language Result Execution time Memory
940898 2024-03-08T01:48:31 Z User0069 Klasika (COCI20_klasika) C++17
33 / 110
 5000 ms 47844 KB 
#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+6;
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];
    int Max,Min;
    set<int> s;
    node()
    {
        child[1]=child[0]=NULL;
    }
};
node* root=new node();
void add(int x,int val)
{
    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];
        cur->s.insert(val);
    }
}
int get(int val,int l,int r)
{
    node* cur =root;
    int ans=0;
    for(int i=30;i>=0;i--)
    {
        int c=(val>>i)&1;
        node* kk=cur->child[1^c];
        if(kk!=NULL)
        {
            auto k=lower_bound(kk->s.begin(),kk->s.end(),l);
            if(k!=kk->s.end()&&*k<=r)
            {
                ans+=(1<<i);
                cur=cur->child[1^c];
            }
            else cur=cur->child[c];
        }
        else cur=cur->child[c];
    }
    return ans;
}
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;
    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;
    add(v[1],in[1]);
    for(int i=1;i<=q;i++)
    {
        if(s[i]=="Add")
        {
            ++cur;
            add(v[cur],in[cur]);
        }
        else
        {
            cout<<get(v[a[i]],in[b[i]],out[b[i]])<<"\n";
        }
    }
}

Compilation message

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

Subtask #1
11.0 / 11.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15452 KB Output is correct
2 Correct 4 ms 15452 KB Output is correct
3 Correct 4 ms 15708 KB Output is correct
4 Correct 4 ms 15960 KB Output is correct
5 Correct 4 ms 15452 KB Output is correct
6 Correct 4 ms 15452 KB Output is correct
7 Correct 4 ms 15708 KB Output is correct
8 Correct 4 ms 15708 KB Output is correct
9 Correct 3 ms 15452 KB Output is correct
10 Correct 4 ms 15644 KB Output is correct
11 Correct 4 ms 15584 KB Output is correct
12 Correct 5 ms 15708 KB Output is correct
13 Correct 9 ms 16732 KB Output is correct
14 Correct 14 ms 17760 KB Output is correct
15 Correct 16 ms 19180 KB Output is correct
16 Correct 13 ms 20316 KB Output is correct
17 Correct 10 ms 16476 KB Output is correct
18 Correct 14 ms 17752 KB Output is correct
19 Correct 19 ms 19156 KB Output is correct
20 Correct 16 ms 20060 KB Output is correct
21 Correct 9 ms 16472 KB Output is correct
22 Correct 14 ms 17688 KB Output is correct
23 Correct 16 ms 19096 KB Output is correct
24 Correct 15 ms 20056 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5048 ms 47844 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15452 KB Output is correct
2 Correct 4 ms 15452 KB Output is correct
3 Correct 4 ms 15708 KB Output is correct
4 Correct 4 ms 15960 KB Output is correct
5 Correct 4 ms 15452 KB Output is correct
6 Correct 4 ms 15452 KB Output is correct
7 Correct 4 ms 15708 KB Output is correct
8 Correct 4 ms 15708 KB Output is correct
9 Correct 3 ms 15452 KB Output is correct
10 Correct 4 ms 15644 KB Output is correct
11 Correct 4 ms 15584 KB Output is correct
12 Correct 5 ms 15708 KB Output is correct
13 Correct 9 ms 16732 KB Output is correct
14 Correct 14 ms 17760 KB Output is correct
15 Correct 16 ms 19180 KB Output is correct
16 Correct 13 ms 20316 KB Output is correct
17 Correct 10 ms 16476 KB Output is correct
18 Correct 14 ms 17752 KB Output is correct
19 Correct 19 ms 19156 KB Output is correct
20 Correct 16 ms 20060 KB Output is correct
21 Correct 9 ms 16472 KB Output is correct
22 Correct 14 ms 17688 KB Output is correct
23 Correct 16 ms 19096 KB Output is correct
24 Correct 15 ms 20056 KB Output is correct
25 Execution timed out 5048 ms 47844 KB Time limit exceeded
26 Halted 0 ms 0 KB -