Submission #704203

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
7042032023-03-01 23:01:06assem_albitarXOR (IZhO12_xor)C++14
100 / 100
212 ms60384 KiB
#include <bits/stdc++.h>
#define ll long long
#define assem ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
ll n,k=31,x;
vector<ll> v;
ll id,mx=-1;
struct trie
{
ll mn;
trie* child[2];
trie()
{
mn=INT_MAX;
memset(child,0,sizeof child);
}
void add(int i,bitset<32> b,ll id)
{
if(i==-1)
{
mn=min(mn,id);
return;
}
if(child[b[i]]==0)child[b[i]]=new trie();
child[b[i]]->add(i-1,b,id);
if(child[0]!=0)mn=min(mn,child[0]->mn);
if(child[1]!=0)mn=min(mn,child[1]->mn);
}
ll get(int i,bitset<32> b1,bitset<32> b2,ll m)
{
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...