Xor sum

import math

def main():
    n, q = [int(x) for x in input().split()]
    values = [int(x) for x in input().split()]

    N = 1
    while N < n:
        N *= 2

    tree = [0] * N * 2

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

    def query(a, b):
        a += N
        b += N
        s = 0

        while a <= b:
            if a % 2 == 1:
                s = s ^ tree[a]
                a += 1
            if b % 2 == 0:
                s = s ^ tree[b]
                b -= 1
            a //= 2
            b //= 2
        return s

    for _ in range(q):
        action = [int(x) for x in input().split()]

        print(query(action[0] - 1, action[1] - 1))

main()

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED