Submission #850020

#TimeUsernameProblemLanguageResultExecution timeMemory
850020MinhQNgoXORanges (eJOI19_xoranges)Pypy 3
55 / 100
1056 ms39140 KiB
n, q = map(int, input().split())
a = [int(x) for x in input().split()]

for _ in range(q):
    act_type, x, y = map(int, input().split())

    if act_type == 1:
        a[x - 1] = y
    else:
        d = y - x + 1
        total_xor_of_seq_len_d = 0
        for i in range(1, d + 1):
            cnt_in_seqs = i * (d - i + 1)
            if cnt_in_seqs % 2 == 0:
                continue
            else:
                total_xor_of_seq_len_d ^= a[i + (x - 2)]
        print(total_xor_of_seq_len_d)
#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...