| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 848441 | MinhQNgo | XORanges (eJOI19_xoranges) | Pypy 3 | 1037 ms | 39084 KiB |
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):
act_type, x, y = map(int, input().split())
if act_type == 1:
a[x - 1] = y
else:
res = 0
x -= 1
y -= 1
for d in range(1, y - x + 2):
total_xor_of_seq_len_d = 0
for i in range(x, y - d + 2):
total_xor_of_seq = 0
for j in range(i, i + d):
total_xor_of_seq ^= a[j]
total_xor_of_seq_len_d ^= total_xor_of_seq
res ^= total_xor_of_seq_len_d
print(res)
| # | 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... | ||||
