Xor sum

n, q = [int(x) for x in input().split()]
values = [int(x) for x in input().split()]
queries = []
 
tree = [0 for _ in range(2*n)]
for i in range(n):
    tree[n+i] = values[i]
for i in range(n-1, 0, -1):
    tree[i] = tree[2*i] ^ tree[2*i+1]
 
def sum(l, r):
    l += n
    r += n
    s = 0
    while l <= r:
        if l%2 == 1:
            s ^= tree[l]
            l += 1
        if r%2 == 0:
            s ^= tree[r]
            r -= 1
        l //= 2
        r //= 2
    queries.append(s)
 
for _ in range(q):
    a, b = [int(x) for x in input().split()]
    sum(a-1, b-1)
 
for query in queries:
    print(query)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED