# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
609103 | AliHasanli | XORanges (eJOI19_xoranges) | C++17 | 139 ms | 8652 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;
const int MAX = 200001;
int t[2][MAX];
int arr[MAX];
void inc(int id, int i, int dx) {
for (; i < MAX; i |= i + 1) {
t[id][i] ^= dx;
}
}
int sum(int id, int i) {
int res = 0;
for (; i > 0; i = (i & (i + 1)) - 1) {
res ^= t[id][i];
}
return res;
}
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; ++i) {
scanf("%d", &arr[i]);
inc(i & 1, i, arr[i]);
}
while (q--) {
int qt, l, r;
scanf("%d%d%d", &qt, &l, &r);
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... |