# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445615 | aris12345678 | XORanges (eJOI19_xoranges) | C++14 | 117 ms | 7876 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 mxN = 2*1e5+5;
int a[mxN], pref[mxN];
int main() {
int n, q;
scanf("%d %d", &n, &q);
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if(i == 0 || i == 1)
pref[i+1] = a[i];
else
pref[i+1] = a[i]^pref[i-1];
}
while(q--) {
int type, l, r;
scanf("%d %d %d", &type, &l, &r);
if(type == 1)
a[l-1] = r;
else {
if(l%2 != r%2)
printf("0\n");
else
printf("%d\n", pref[r]^pref[l]^a[l-1]);
}
}
return 0;
}
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... |