Submission #792328

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
792328	2023-07-25T01:03:37 Z	Ahmed_Solyman	XOR (IZhO12_xor)	C++14	0 / 100	2000 ms	108680 KB

xor

#include <bits/stdc++.h>
#include <ext/rope>

using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
int n,x;
struct node{
    int i;
    node *arr[2];
};
node *New(int i){
    node *ret=new node;
    ret->i=i;
    ret->arr[0]=NULL;
    ret->arr[1]=NULL;
    return ret;
}
void insert(node *root,int xr,int j){
    node *temp=root;
    for(int i=30;i>=0;i--){
        int u=((1<<i)&xr)>0;
        if(temp->arr[u]==NULL){
            temp->arr[u]=New(j);
        }
        temp=temp->arr[u];
        temp->i=min(temp->i,j);
    }
}
int query(node *root,int xr){
    int ret=1e9;
    node *temp=root;
    for(int i=30;i>=0;i--){
        int a=((1<<i)&x)>0;
        int b=((1<<i)&xr)>0;
        if(a){
            if(temp->arr[b^1]==NULL){
                return ret+1;
            }
            else{
                temp=temp->arr[b^1];
            }
        }
        else{
            if(temp->arr[b^1]!=NULL){
                ret=min(ret,temp->arr[b^1]->i);
            }
            if(temp->arr[b]!=NULL){
                temp=temp->arr[b];
            }
            if(temp->arr[b]==NULL){
                break;
            }
        }
    }
    if(temp->arr[0]==NULL && temp->arr[1]==NULL){
        ret=min(ret,temp->i);
    }
    return ret+1;
}
signed main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    fast
    cin>>n>>x;
    node *root=New(0);
    insert(root,0,0);
    int xr=0;
    int pos=0,len=0;
    bool valid=0;
    for(int i=1;i<=n;i++){
        int k;cin>>k;
        xr^=k;
      	valid|=(k>=x);
        int j=query(root,xr);
        if(j<1e9){
            if(i-j+1>len){
                pos=j;
                len=i-j+1;
            }
        }
        insert(root,xr,i);
    }
    while(!pos && valid)cout<<"g";
    cout<<pos<<" "<<len<<endl;
    return 0;
}

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Execution timed out	2079 ms	108680 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-