# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006373 | JoksimKaktus | XORanges (eJOI19_xoranges) | C++17 | 90 ms | 11968 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;
vector <int> seg1(200000*3);
vector <int> seg2(200000*3);
vector <int> v(200000);
void build(int l,int r,int u){
if(l == r){
if(l % 2 == 1){
return;
}
seg1[u] = v[l];
return;
}
build(l,(l+r)/2,u*2);
build((l+r)/2+1,r,u*2+1);
seg1[u] = seg1[u*2]^seg1[u*2+1];
}
void update(int l,int r,int u,int v,int k){
if(l == r && l == v){
seg1[u] = k;
return;
}
if(v < l || v > r)return;
update(l,(l+r)/2,u*2,v,k);
update((l+r)/2+1,r,u*2+1,v,k);
# | 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... |