# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
577180 | berr | XORanges (eJOI19_xoranges) | C++17 | 137 ms | 10012 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 st1[400005], st2[400005], t1[200005], t2[200005];
void build1(int l, int r, int v)
{
if(l>r) return;
else if(l==r) st1[v]=t1[l];
else
{
int mid=(l+r)/2;
build1(l, mid, v*2);
build1(mid+1, r, v*2+1);
st1[v]=(st1[v*2] xor st1[v*2+1]);
}
}
void build2(int l, int r, int v)
{
if(l>r) return;
else if(l==r) st2[v]=t2[l];
else
{
int mid=(l+r)/2;
build2(l, mid, v*2);
build2(mid+1, r, v*2+1);
st2[v]=(st2[v*2] xor st2[v*2+1]);
}
}
# | 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... |