Submission #1283654

#	Time	Username	Problem	Language	Result	Execution time	Memory
1283654		VMaksimoski008	XORanges (eJOI19_xoranges)	C++20	100 / 100	59 ms	4564 KiB

xoranges

#include <bits/stdc++.h>
using namespace std;

struct fenwick {
    int n;
    vector<int> tree;

    void init(int _n) {
        n = _n + 10;
        tree.resize(n+10);
    }

    void update(int p, int v) {
        for(p++; p<n; p+=p&-p) tree[p] ^= v;
    }

    int query(int p) {
        int ans = 0;
        for(p++; p; p-=p&-p) ans ^= tree[p];
        return ans;
    }

    int query(int l, int r) {
        return query(r) ^ query(l-1);
    }
};

signed main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    int n, q; cin >> n >> q;
    vector<int> a(n+1);
    for(int i=1; i<=n; i++) cin >> a[i];

    fenwick fwt[2];
    fwt[0].init(n);
    fwt[1].init(n);

    for(int i=1; i<=n; i++)
        fwt[i&1].update(i, a[i]);

    while(q--) {
        int t, l, r; cin >> t >> l >> r;

        if(t == 1) {
            fwt[l&1].update(l, a[l]^r);
            a[l] = r;
        } else {
            cout << ((r-l) % 2 ? 0 : fwt[l&1].query(l, r)) << '\n';
        }
    }
}

• Subtask 1: 12 / 12
• Subtask 2: 18 / 18
• Subtask 3: 25 / 25
• Subtask 4: 20 / 20
• Subtask 5: 25 / 25