#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
const int NEU = 0;
int rec(int l, int r, vector<int> &v){
    int ans = 0;
    if ((r-l+1) % 2 == 0) return 0;
    for (int i = l; i <= r; i+=2){
        ans^=v[i];
    }
    return ans;
}
void solve(){
    int n, q; cin >> n >> q;
    vector<int> v(n);
    for (int i = 0 ; i < n; i++) cin >> v[i];
    for (int i = 0; i < q; i++) {
        int p, l, r; cin >> p >> l >> r;
        if (p == 1) {
            v[l-1] = r;
        }
        else {
            cout << rec(l-1, r-1, v) << endl;
        }
    }
    // cout << (5^5) << endl;
}
signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--)solve();
}
| # | 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... |