# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
877840 | slumio | XORanges (eJOI19_xoranges) | C++17 | 472 ms | 9776 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;
using ll=long long;
using ull=unsigned long long;
void add(vector<int>&tree,int &n,int k,int &num)
{
k+=n;
tree[k]=num;
for(k/=2;k>=1;k/=2)
{
tree[k]=tree[2*k]^tree[2*k+1];
}
return;
}
int sump(vector<int>&tree,int &n,int a,int b)
{
a+=n;
b+=n;
int num=0;
while(a<=b)
{
if(a%2==1)num^=tree[a++];
if(b%2==0)num^=tree[b--];
# | 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... |