#include <bits/stdc++.h>
using namespace std;
vector<long long> st;
vector<long long> st2;
void build(vector<long long> a, long long v, long long tl, long long tr){
if(tl==tr) st[v]=a[tl];
else{
long long tm=(tl+tr)/2;
build(a,v*2,tl,tm);
build(a,v*2+1,tm+1,tr);
st[v]=st[v*2]^st[v*2+1];
}
}
long long XUM(long long v, long long tl, long long tr, long long l, long long r){
if(l>r) return 0;
if(l==tl and r==tr) return st[v];
long long tm=(tl+tr)/2;
return XUM(v*2,tl,tm,l,min(r,tm))^XUM(v*2+1,tm+1,tr,max(l,tm+1),r);
}
void update(long long v, long long tl, long long tr, long long pos, long long new_val){
if(tl==tr){
st[v]=new_val;
}
else{
long long tm=(tl+tr)/2;
if(pos<=tm) update(v*2,tl,tm,pos,new_val);
else update(v*2+1,tm+1,tr,pos,new_val);
st[v]=st[v*2]^st[v*2+1];
}
}
void build2(vector<long long> a, long long v, long long tl, long long tr){
if(tl==tr) st2[v]=a[tl];
else{
long long tm=(tl+tr)/2;
build2(a,v*2,tl,tm);
build2(a,v*2+1,tm+1,tr);
st2[v]=st2[v*2]^st2[v*2+1];
}
}
long long XUM2(long long v, long long tl, long long tr, long long l, long long r){
if(l>r) return 0;
if(l==tl and r==tr) return st2[v];
long long tm=(tl+tr)/2;
return XUM2(v*2,tl,tm,l,min(r,tm))^XUM2(v*2+1,tm+1,tr,max(l,tm+1),r);
}
void update2(long long v, long long tl, long long tr, long long pos, long long new_val){
if(tl==tr){
st2[v]=new_val;
}
else{
long long tm=(tl+tr)/2;
if(pos<=tm) update2(v*2,tl,tm,pos,new_val);
else update2(v*2+1,tm+1,tr,pos,new_val);
st2[v]=st2[v*2]^st2[v*2+1];
}
}
int main(){
long long n,q;
scanf("%lld%lld",&n,&q);
vector<long long> a;
vector<long long> a2;
st.resize(4*((n+1)/2));
st2.resize(4*(n/2));
for(long long i=0;i<n;i++){
long long x;
scanf("%lld",&x);
if((i&1)==0)a.push_back(x);
else a2.push_back(x);
}
build(a,1,0,((n+1)/2)-1);
build2(a2,1,0,n/2-1);
while(q--){
long long action;
scanf("%lld",&action);
if(action==1){
long long pos,ch;
scanf("%lld%lld",&pos,&ch);
if((pos&1)!=0) update(1,0,(n+1)/2-1,pos/2,ch);
else update2(1,0,n/2-1,pos/2-1,ch);
}
else{
long long l,u;
scanf("%lld%lld",&l,&u);
if(((u-l)&1)==1) printf("%lld\n",0);
else{
if((l&1)==1){
long long xum=XUM(1,0,((n+1)/2)-1,l/2,u/2);
printf("%lld\n",xum);
}
else{
long long xum=XUM2(1,0,(n/2)-1,l/2-1,u/2-1);
printf("%lld\n",xum);
}
}
}
}
return 0;
}
Compilation message
xoranges.cpp: In function 'int main()':
xoranges.cpp:92:41: warning: format '%lld' expects argument of type 'long long int', but argument 2 has type 'int' [-Wformat=]
92 | if(((u-l)&1)==1) printf("%lld\n",0);
| ~~~^ ~
| | |
| | int
| long long int
| %d
xoranges.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
67 | scanf("%lld%lld",&n,&q);
| ~~~~~^~~~~~~~~~~~~~~~~~
xoranges.cpp:74:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
74 | scanf("%lld",&x);
| ~~~~~^~~~~~~~~~~
xoranges.cpp:82:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
82 | scanf("%lld",&action);
| ~~~~~^~~~~~~~~~~~~~~~
xoranges.cpp:85:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
85 | scanf("%lld%lld",&pos,&ch);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~
xoranges.cpp:91:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
91 | scanf("%lld%lld",&l,&u);
| ~~~~~^~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
308 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
308 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
10 ms |
884 KB |
Output is correct |
| 12 |
Correct |
10 ms |
884 KB |
Output is correct |
| 13 |
Correct |
9 ms |
864 KB |
Output is correct |
| 14 |
Correct |
10 ms |
928 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
1079 ms |
22984 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
308 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
10 ms |
884 KB |
Output is correct |
| 12 |
Correct |
10 ms |
884 KB |
Output is correct |
| 13 |
Correct |
9 ms |
864 KB |
Output is correct |
| 14 |
Correct |
10 ms |
928 KB |
Output is correct |
| 15 |
Execution timed out |
1079 ms |
22984 KB |
Time limit exceeded |
| 16 |
Halted |
0 ms |
0 KB |
- |
