Submission #1268248

#	Time	Username	Problem	Language	Result	Execution time	Memory
1268248		iamarman	XOR (IZhO12_xor)	C++20	0 / 100	872 ms	327680 KiB

xor

                                                  //   Bismillahir Rahmanir Rahim      //
                                                 //     After hardship comes ease     //
                                                //         AUTHOR : iamarman         //

// pragmas
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC optimization ("strict-overflow")
 
#include<bits/stdc++.h>

using namespace std;

                                                    ////       TEMPLATE       ////

//---------------------------------------------------------------------------------------------------------------------------------|


# define    el '\n'
# define    sp " "
# define    ff first
# define    ss second
# define    ll long long
# define    pb push_back
# define    mp make_pair
# define    yess1 cout<<1<<el 
# define    noo cout<<"NO"<<el
# define    yess cout<<"YES"<<el
# define    siz(x) (int)x.size()
# define    ull unsigned long long    
# define    all(v) v.begin(),v.end()
# define    allr(v) v.rbegin(),v.rend()
# define    torad(x) ((x) * ((2*acos(0))/180.0))
# define    todeg(x) ((x) * (180.0/(2*acos(0))))


int dx[]={-1, 1 , 0 , 0 , -1 ,-1, 1, 1};
int dy[]={ 0, 0 ,-1 , 1 , -1 , 1,-1, 1};

// up = { -1,0 } , down = { 1,0 } , right = { 0,1 } , left = { 0,-1 }
// up-right = { -1,1 } , up-left = { -1,-1 } , down-right = { 1,1 } , down-left = { 1,-1 }




                                                   ///  ____________CODE STARTS FROM HERE____________    ///

class TrieNode
{
public:
    TrieNode *left;
    TrieNode *right;
    int cnt;
    TrieNode()
    {
        left = NULL;
        right = NULL;
        cnt = 0;
    }
};

class Trie
{
    TrieNode *root;
public:
    Trie()
    {
        root = new TrieNode();
    }

    void insert(int n)
    {
        TrieNode *curr = root;
        // use bits 30..0 (safe for inputs <= 1e9)
        for (int i = 30; i >= 0; --i)
        {
            int bit = (n >> i) & 1;
            if (bit == 0)
            {
                if (curr->left == NULL)
                    curr->left = new TrieNode();
                curr = curr->left;
                curr->cnt++;
            }
            else
            {
                if (curr->right == NULL)
                    curr->right = new TrieNode();
                curr = curr->right;
                curr->cnt++;
            }
        }
    }

    int max_xor_pair(int n)
    {
        TrieNode *curr = root;
        int ans = 0;
        for (int i = 30; i >= 0; --i)
        {
            if (curr == NULL) break;
            int bit = (n >> i) & 1;
            if (bit == 0)
            {
                if (curr->right != NULL && curr->right->cnt > 0)
                {
                    ans |= (1 << i);   // safe shift because i <= 30
                    curr = curr->right;
                }
                else
                {
                    curr = curr->left;
                }
            }
            else
            {
                if (curr->left != NULL && curr->left->cnt > 0)
                {
                    ans |= (1 << i);
                    curr = curr->left;
                }
                else
                {
                    curr = curr->right;
                }
            }
        }
        return ans;
    }
};

void solve()
{
    int n,x;
    cin>>n>>x;
    vector<int> vec(n+1);
    for(int i=1;i<=n;i++)
    {
        cin>>vec[i];
        vec[i]^=vec[i-1];
    }

    auto ok=[&](int len)->bool
    {
        Trie tr;
        tr.insert(0);
        for(int i=len;i<=n;i++)
        {
            tr.insert(vec[i-len]);
            if(tr.max_xor_pair(vec[i])>=x) return true;
        }
        return false;
    };

    int low=1,high=n+1;
    while(high-low>1)
    {
        int mid=low+(high-low)/2;
        if(ok(mid)) low=mid;
        else high=mid;
    }

    for(int i=low;i<=n;i++)
    {
        if((vec[i]^(vec[i-low]))>=x)
        {
            cout<<i-low+1<<sp<<low<<el;
            return;
        }
    }

}
int main()
{ 

    clock_t start= clock();
    int t=1;
    // cin>>t;
    for(int i=1;i<=t;i++)
    {
         //cout<<"Case "<<i<<": ";
        solve();
    }


}

• Subtask 1: 0 / 100