Submission #1221516

#TimeUsernameProblemLanguageResultExecution timeMemory
1221516mayacXORanges (eJOI19_xoranges)C++20
0 / 100
270 ms3036 KiB
#include <iostream> #include <vector> #include <queue> using namespace std; int main(){ int n,q,a,b,t,ans; cin>>n>>q; vector<int> v(n),vxor(n+1,0); for(int i=0;i<n;i++){ cin>>v[i]; vxor[i+1]=vxor[i]^v[i]; } while(q--){ cin>>t>>a>>b;a--; if(t==1){ v[a]=b; }else{ ans=0; if((b-a)%2==1){ ans=vxor[b]^vxor[a]; } cout<<ans<<"\n"; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...