# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1219609 | durdona | XORanges (eJOI19_xoranges) | Pypy 3 | 1099 ms | 83880 KiB |
n,q=map(int,input().split())
arr=list(map(int,input().split()))
for i in range(q):
s,l,r=map(int,input().split())
if s==1:
arr[l-1]=r
else:
m=0
for i in range(l-1,r):
for j in range(i,r):
for k in range(i,j+1):
m^=arr[k]
print(m)
Compilation message (stdout)
# | 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... |