Xor sum

import sys 


input = sys.stdin.read().split()

n = int(input[0])
q = int(input[1])

#def xor = (lambda x,y = x^y) 

def build() :
    tree = [float('inf')] * (2*n)
    for i in range(n):
        tree[n+i] = int(input[2+i])
    for i in range(n-1,0,-1):
        tree[i] = tree[2*i] ^ tree[(2*i)+1]
    return tree
    


def query(tree, start, end): 
    l = start +n
    r = end +n
    res = 0
    while l <= r: 
        if l%2 ==1 :
            res ^= tree[l]
            l = l+1
        if r%2 ==0: 
            res ^= tree[r]
            r = r-1
        l = l//2
        r = r//2
    return res

tree = build()
i = n+2 
for _ in range(q): 
    print(query(tree, int(input[i])-1, int(input[i+1])-1))
    i = i+2

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED