# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569922 | jmyszka2007 | XORanges (eJOI19_xoranges) | C++17 | 162 ms | 7952 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;
constexpr int base = (1 << 18);
int d1[2 * base];
int d2[2 * base];
void upd1(int v, int x) {
v += base;
d1[v] = x;
v >>= 1;
while(v > 0) {
d1[v] = d1[2 * v] ^ d1[2 * v + 1];
v >>= 1;
}
}
int que1(int l, int r) {
l += base;
r += base;
int ans = 0;
while(l <= r) {
if(l & 1) {
ans ^= d1[l];
}
if(!(r & 1)) {
ans ^= d1[r];
}
l++;
l >>= 1;
r--;
r >>= 1;
}
Compilation message (stderr)
# | 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... |