Submission #1223261

#TimeUsernameProblemLanguageResultExecution timeMemory
1223261boclobanchatXORanges (eJOI19_xoranges)C++20
100 / 100
48 ms3912 KiB
#include<bits/stdc++.h> using namespace std; const int MAXN=2e5+5; int fen[MAXN][2],A[MAXN]; void update(int i,int c,int n,int val) { for(;i<=n;i+=i&-i) fen[i][c]^=val; } int get(int i,int c) { int ans=0;for(;i;i-=i&-i) ans^=fen[i][c];return ans; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,q; cin>>n>>q; for(int i=1;i<=n;i++) { cin>>A[i]; update(i,i%2,n,A[i]); } while(q--) { int t,l,r; cin>>t>>l>>r; if(t==1) { update(l,l%2,n,r^A[l]); A[l]=r; } else if(r%2==l%2) cout<<(get(r,r%2)^get(l-1,r%2))<<"\n"; else cout<<"0\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...