# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
778352 | andrei_iorgulescu | XORanges (eJOI19_xoranges) | C++14 | 129 ms | 10432 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;
int n,q;
int aintpar[800005];
int aintimpar[800005];
void update(int nod,int l,int r,int pos,int val)
{
if (l == r)
{
if (l % 2 == 1)
aintimpar[nod] = val;
else
aintpar[nod] = val;
return;
}
int mij = (l + r) / 2;
if (pos <= mij)
update(2 * nod,l,mij,pos,val);
else
update(2 * nod + 1,mij + 1,r,pos,val);
aintpar[nod] = aintpar[2 * nod] ^ aintpar[2 * nod + 1];
aintimpar[nod] = aintimpar[2 * nod] ^ aintimpar[2 * nod + 1];
}
int querypar(int nod,int l,int r,int st,int dr)
{
if (r < st or dr < l)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |