Submission #793088

#TimeUsernameProblemLanguageResultExecution timeMemory
793088poustouflanXORanges (eJOI19_xoranges)Cpython 3
55 / 100
1064 ms27452 KiB
n, q = map(int, input().split())

A = list(map(int, input().split())) # scan results
for _ in range(q):
    q, i, j = map(int, input().split())
    if q == 1:
        # rescan
        A[i-1] = j
    else:
        # query
        if (j - i) % 2 == 1:
            print(0)
        else:
            y = 0
            for x in range(i, j+1, 2):
                y ^= A[x-1]
            print(y)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...