# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
631654 | smartmonky | XORanges (eJOI19_xoranges) | C++14 | 1080 ms | 4524 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()
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{
if(y==x)
cout<<v[x] <<endl;
else if(((y-x+2)/2)%2==0)
cout<<(v[x]^v[y]) <<endl;
else{
int res=0;
for(int i=x+1;i<=y-1;i++)
res^=v[i];
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... |