# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261599 | sckmd | XOR (IZhO12_xor) | C++14 | 260 ms | 59512 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define MAXN 500005
int a[MAXN];
struct node
{
node* nula;
node* kec;
int minpos=9999999;
//bool leaf;
};
node* root;
void update(int br,int pos)
{
node* now = root;
for(int i = 31; i >= 0; i--)
{
//if(now->minpos == NULL)now->minpos = 999999999;
now->minpos = min(now->minpos,pos);
if(br&(1<<i))
{
if(now->kec == NULL)now->kec = new node();
now = now->kec;
}
else
{
if(now->nula == NULL)now->nula = new node();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |