Submission #531301

#TimeUsernameProblemLanguageResultExecution timeMemory
531301MinhQNgoXORanges (eJOI19_xoranges)Pypy 3
12 / 100
1083 ms38960 KiB
n, q = map(int, input().split())
a = [int(x) for x in input().split()]

for _ in range(q):
    t, x, y = map(int, input().split())
    if t == 1:
        a[x - 1] = y
    else:
        x -= 1
        y -= 1
        xor = 0
        mx_len = y - x + 1
        for l in range(1, mx_len + 1):
            for i in range(x, y - l + 2):
                sub_xor = 0
                for j in range(i, i + l):
                    sub_xor ^= a[j]
                xor ^= sub_xor
        print(xor)
#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...