Xor sum

#include <iostream>
#include <vector>
#include <algorithm>
#include <limits.h>
using namespace std;



int findXor(int a, int b, int t, vector<int>& tree){
    a += t; 
    b += t;
    int m = 0;
    while (a <= b) {
        if (a%2 == 1) m = tree[a++] ^ m;
        if (b%2 == 0) m = tree[b--] ^ m;
        a /= 2; b /= 2;
    }
    return m;
}

int main() {
    int n, q;
    cin >> n >> q;
    vector<int> num(n);
    for (int i = 0; i < n; i++){
        cin >> num[i];
    }
    vector<vector<int>> queries(q, vector<int>(2));
    for (int i = 0; i < q; i++){
        for (int j = 0; j < 2; j++){
            cin >> queries[i][j];
        }
    }
    
    int t = 1;
    while (t < n) t *= 2;
    vector<int> segmentTree(2*t, 0);
    for (int i = 0; i < n; i++) {
        segmentTree[t+i] = num[i];
    }
    for (int i = t-1; i >= 1; i--){
        segmentTree[i] = 
            segmentTree[2*i] ^ segmentTree[2*i+1];
    }
    
    for (int i = 0; i < q; i++){
        int a = queries[i][0];
        int b = queries[i][1];
        int sol = findXor(a-1, b-1, t, segmentTree);
        cout << sol << endl;
    }
    
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED