# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1235329 | GoBananas69 | XORanges (eJOI19_xoranges) | C++20 | 0 ms | 0 KiB |
#include <algorithm>
#include <iostream>
#include <vector>
#include "outputdebug.cpp"
typedef long long ll;
using namespace std;
int main() {
cin.tie(0) -> sync_with_stdio(0);
int n, q;
cin >> n >> q;
vector<int> nums(n);
for (int &x : nums) cin >> x;
while (q--) {
int type;
cin >> type;
if (type == 1) {
int p, v;
cin >> p >> v;
--p;
nums[p] = v;
} else if (type == 2) {
int l, r;
cin >> l >> r;
--l; --r;
int res = 0;
for (int i = l; i <= r; ++i) {
for (int j = i; j <= r; ++j) {
for (int k = i; k <= j; ++k) {
res ^= nums[k];
}
}
}
cout << res << '\n';
}
}
return 0;
}