# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596772 | Cookie | XORanges (eJOI19_xoranges) | C++14 | 177 ms | 16116 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 ll long long
#define vt vector
#define pb push_back
const int mxn = 2e5 + 3;
ll a[mxn];
int n, q;
ll odd[mxn * 4] = {}, even[mxn * 4] = {};
void build(int nd, int l, int r){
if(l == r){
if(l % 2 == 0)even[nd] = a[l];
else odd[nd] = a[l];
return;
}
int mid = (l + r) >> 1;
build((nd << 1), l, mid); build((nd << 1) + 1, mid + 1, r);
odd[nd] = odd[(nd << 1)] ^ odd[(nd << 1) + 1]; even[nd] = even[(nd << 1)] ^ even[(nd << 1) + 1];
}
void upd(int nd, int l, int r, int id, ll v){
if(id > r || id < l)return;
if(l == r){
even[nd] = v;
return;
}
int mid = (l + r) >> 1;
upd((nd << 1), l, mid, id, v); upd((nd << 1) + 1, mid + 1, r, id, v);
even[nd] = even[(nd << 1)] ^ even[(nd << 1) + 1];
}
void upd2(int nd, int l, int r, int id, ll v){
# | 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... |