Submission #675872

#TimeUsernameProblemLanguageResultExecution timeMemory
675872KubetiXORanges (eJOI19_xoranges)C++14
0 / 100
447 ms6236 KiB
#include <iostream> #include <vector> using namespace std; int v[200001], s[2][200001]; int main() { int n, q; cin>>n>>q; for(int i=1; i<=n; i++){ cin>>v[i]; s[i&2][i] = v[i]; } if(n<=5000){ for(int i=0; i<n; i++){ int t; cin>>t; if(t == 1){ int x, y; cin>>x>>y; v[x] = y; } else{ int x, y; cin>>x>>y; if(abs(x-y)%2 == 1){ cout<<0<<'\n'; } else{ int sum=0; for(;x<=y;x+=2) sum^=v[x]; cout<<sum<<'\n'; } } } return 0; } for(int i=2; i<=n; i++){ s[i&2][i] ^= s[i&2][i-2]; } for(int h=0; h<q; h++){ int t, x, y; cin>>t>>x>>y; if(abs(x-y)%2 == 1){ cout<<0<<'\n'; continue; } int ans = s[y&1][y]^s[x&1][x-1]<<'\n'; cout<<ans<<'\n'; } return 0; }
#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...