oj.uz

답안 #938773

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938773 2024-03-05T14:14:52 Z User0069 Klasika (COCI20_klasika) C++17
33 / 110
 699 ms 524288 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+1;
const int INF=1e9;
int n=1,q,a[maxn],b[maxn],in[maxn],out[maxn],cur,v[maxn];
string s[maxn];
vector<int> adj[maxn];
struct trie
{
    struct node
    {
        node* child[2];
        int cnt;
        node()
        {
            cnt=0;
            child[1]=child[0]=NULL;
        }
    };
    node* root;
    trie()
    {
        root=new node();
    }
    void add(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];
            cur->cnt++;
        }
    }
    int get(int x)
    {
        int ans=0;
        node* cur=root;
        for(int i=30;i>=0;i--)
        {
            int c=(x>>i)&1;
            if(cur->child[1^c]!=NULL)
            {
                ans+=(1<<i);
                cur=cur->child[1^c];
            }
            else if(cur->child[c]!=NULL) cur=cur->child[c];
            else return 0;
        }
        return ans;
    }
};
struct segtree
{
    trie ST[4*maxn];
    void update(int id,int cl,int cr,int pos,int val)
    {
        if(cl>pos||cr<pos) return;
        ST[id].add(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);
    }
    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 ST[id].get(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));
    }
}f;
void dfs(int x,int par)
{
    in[x]=++cur;
    v[x]=v[par]^v[x];
    for(int y:adj[x])
    {
        dfs(y,x);
    }
    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<=q;i++)
    {
        cin>>s[i]>>a[i]>>b[i];
        if(s[i]=="Add")
        {
            adj[a[i]].push_back(++n);
            v[n]=b[i];
        }
    }
    dfs(1,0);
    int cc=1;
    f.update(1,1,n,1,0);
    for(int i=1;i<=q;i++)
    {
        if(s[i]=="Add")
        {
            ++cc;
            f.update(1,1,n,in[cc],v[cc]);
        }
        else
        {
            cout<<f.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

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 48464 KB Output is correct
2 Correct 27 ms 48556 KB Output is correct
3 Correct 26 ms 48976 KB Output is correct
4 Correct 30 ms 49244 KB Output is correct
5 Correct 27 ms 48464 KB Output is correct
6 Correct 26 ms 48732 KB Output is correct
7 Correct 32 ms 48884 KB Output is correct
8 Correct 26 ms 49236 KB Output is correct
9 Correct 25 ms 48476 KB Output is correct
10 Correct 25 ms 48692 KB Output is correct
11 Correct 26 ms 48984 KB Output is correct
12 Correct 33 ms 49232 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 48464 KB Output is correct
2 Correct 27 ms 48556 KB Output is correct
3 Correct 26 ms 48976 KB Output is correct
4 Correct 30 ms 49244 KB Output is correct
5 Correct 27 ms 48464 KB Output is correct
6 Correct 26 ms 48732 KB Output is correct
7 Correct 32 ms 48884 KB Output is correct
8 Correct 26 ms 49236 KB Output is correct
9 Correct 25 ms 48476 KB Output is correct
10 Correct 25 ms 48692 KB Output is correct
11 Correct 26 ms 48984 KB Output is correct
12 Correct 33 ms 49232 KB Output is correct
13 Correct 30 ms 51540 KB Output is correct
14 Correct 33 ms 55480 KB Output is correct
15 Correct 39 ms 59732 KB Output is correct
16 Correct 45 ms 63528 KB Output is correct
17 Correct 30 ms 51540 KB Output is correct
18 Correct 33 ms 55160 KB Output is correct
19 Correct 39 ms 59484 KB Output is correct
20 Correct 39 ms 63196 KB Output is correct
21 Correct 30 ms 51548 KB Output is correct
22 Correct 33 ms 55420 KB Output is correct
23 Correct 36 ms 59452 KB Output is correct
24 Correct 39 ms 63128 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 699 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 48464 KB Output is correct
2 Correct 27 ms 48556 KB Output is correct
3 Correct 26 ms 48976 KB Output is correct
4 Correct 30 ms 49244 KB Output is correct
5 Correct 27 ms 48464 KB Output is correct
6 Correct 26 ms 48732 KB Output is correct
7 Correct 32 ms 48884 KB Output is correct
8 Correct 26 ms 49236 KB Output is correct
9 Correct 25 ms 48476 KB Output is correct
10 Correct 25 ms 48692 KB Output is correct
11 Correct 26 ms 48984 KB Output is correct
12 Correct 33 ms 49232 KB Output is correct
13 Correct 30 ms 51540 KB Output is correct
14 Correct 33 ms 55480 KB Output is correct
15 Correct 39 ms 59732 KB Output is correct
16 Correct 45 ms 63528 KB Output is correct
17 Correct 30 ms 51540 KB Output is correct
18 Correct 33 ms 55160 KB Output is correct
19 Correct 39 ms 59484 KB Output is correct
20 Correct 39 ms 63196 KB Output is correct
21 Correct 30 ms 51548 KB Output is correct
22 Correct 33 ms 55420 KB Output is correct
23 Correct 36 ms 59452 KB Output is correct
24 Correct 39 ms 63128 KB Output is correct
25 Runtime error 699 ms 524288 KB Execution killed with signal 9
26 Halted 0 ms 0 KB -