#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, q;
cin >> n >> q;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
while (q--) {
ll ty;
cin >> ty;
if (ty == 1) {
ll idx, val;
cin >> idx >> val;
a[idx - 1] = val;
} else {
ll l, r;
cin >> l >> r;
ll sol = 0;
for (int i = l - 1; i <= r - 1; i++) {
sol ^= a[i];
}
cout << sol << 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... |