# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
633882 | smartmonky | XORanges (eJOI19_xoranges) | C++14 | 448 ms | 8300 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 <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define int ll
using namespace std;
main(){
int n,q;
cin >> n>>q;
vector <int> v(n+1);
for(int i=1;i<=n;i++)
cin >>v[i];
while(q--){
int type,x,y;
cin >>type >>x >>y;
if(type==1)
v[x]=y;
else{
int res=0;
//cout<< v[x+(y-x+1)/2] <<"-";
if(((y-x+2)/2)%2==0){
res^=v[x];
res^=v[y];
}else if((y-x+1)%2==1){
res=((v[x]^v[x+(y-x+1)/2])^v[y]);
}else
res=0;
cout <<res <<endl;
}
}
}
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... |