Xor sum

n,q = [int(x) for x in input().split()]
L = [int(x) for x in input().split()]

tree = [0 for i in range(n)]
tree+=L
for i in range (n-1,0,-1):
    tree[i]= tree[2*i]^tree[2*i+1]


def mini(a,b):
    a+=n
    b+=n
    xor = 0
    while (a<=b):
        if a%2 == 1:
            xor = xor ^tree[a]
            a+=1
        if b%2 == 0:
            xor = xor ^tree[b]
            b-=1
        a//=2
        b//=2
    return xor

def update(k,v):
    k = n + k
    tree[k] = v
    k//=2
    while(k>=1):
        
        tree[k] = tree[2*k]^tree[2*k+1]
        k//=2

for i in range (q):
    b,c = [int(x) for x in input().split()]
    
    print(mini(b-1,c-1))

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED