# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1103048 | _snoopy_ | XORanges (eJOI19_xoranges) | C++17 | 1046 ms | 5112 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.
#include <bits/stdc++.h>
using namespace std;
long long int arr[1000010];
int main(){
long long int n, q, i, j, k, a, b, c, x, d;
cin>>n>>q;
for(i=1; i<=n; i++){
cin>>arr[i];
}
for(i=0; i<q; i++){
cin>>a>>b>>c;
if(a==1){
arr[b]=c;
}
else{
x=0;
if((c-b+1)%2==0 ){
x=x^0;
}
else if((c-b+1)==1){
x=x^arr[b];
cout<<x<<endl;
continue;
}
else{
x=x^arr[b];
}
for(j=b+1; j<c; j++){
if(((c-b+1)+((c-b+1)-j))% 2==0){
x=x^0;
}
else{
x=x^arr[j];
}
}
if((c-b+1)%2==0){
x=x^0;
}
else{
x=x^arr[c];
}
cout<<x<<endl;
}
}
return 0;
}
Compilation message (stderr)
# | 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... |