| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 793088 | poustouflan | XORanges (eJOI19_xoranges) | Cpython 3 | 1064 ms | 27452 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 = 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 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... | ||||
