Xor sum

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

long long sum_xor(int a, int b, vector<long long>& tree) {
    return (tree[b] ^ tree[a - 1]);
}


int main() {
    int n, q;
    cin >> n >> q;

    vector<long long> indexed_tree(n+1, 0);
    for (int i = 1; i <= n; i++) {
        cin >> indexed_tree[i];
        indexed_tree[i] = indexed_tree[i-1] ^ indexed_tree[i];
    }

    int a,b;
    for(int i = 0; i < q; i++){
        cin >> a >> b;
        cout << sum_xor(a, b, indexed_tree) << endl;
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED