This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
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
ans = 0
for l in range(1, n + 1):
cur_xor = 0
for i in range(n - l + 1):
sub_xor = 0
for j in range(i, i + l):
sub_xor ^= a[j]
cur_xor ^= sub_xor
ans ^= cur_xor
print(ans)
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |