| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 447260 | bigo | XORanges (eJOI19_xoranges) | C++14 | 1089 ms | 4076 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>
#include <cmath>
using namespace std;
typedef unsigned long long ll;
int main() {
int n, q;
cin >> n >> q;
vector<int>vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
while (q--) {
int op;
cin >> op;
if (op == 1) {
int i, j;
cin >> i >> j;
vec[i - 1] = j;
}
else {
int l, r;
cin >> l >> r;
l--; r--;
if ((r - l + 1) % 2 == 0)
cout << 0 << endl;
else {
int ans = 0;
for (int i = l; i <= r; i+=2) {
ans ^= vec[i];
}
cout << ans << endl;
}
}
}
}| # | 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... | ||||
