| Task: | Xor sum |
| Sender: | Petu |
| Submission time: | 2025-09-22 17:37:44 +0300 |
| Language: | Python3 (CPython3) |
| Status: | READY |
| Result: | TIME LIMIT EXCEEDED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | details |
| #2 | TIME LIMIT EXCEEDED | -- | details |
Code
n_count, q_count = map(int, input().split())
n = list(map(int, input().split()))
q = [list(map(int, input().split())) for _ in range(q_count)]
x_sum = []
for i in range(q_count):
x_sum.append([])
sum = n[q[i][0] - 1]
for j in n[q[i][0] : q[i][1]]:
sum ^= j
x_sum[-1].append(sum)
for i in x_sum:
print(i[0])
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 8 36 7 6 4 6 2 9 4 8 1 1 1 2 1 3 ... |
| correct output |
|---|
| 7 1 5 3 1 ... |
| user output |
|---|
| 7 1 5 3 1 ... |
Test 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 200000 921726510 307633388 992247073 ... |
| correct output |
|---|
| 834756431 130379787 403037296 308618218 784778243 ... |
| user output |
|---|
| (empty) |
