Submission #1219219

#TimeUsernameProblemLanguageResultExecution timeMemory
1219219lizi14XORanges (eJOI19_xoranges)C++20
55 / 100
1069 ms1292 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n,m; cin>>n>>m; int x[n]; //long long ke=0,l=0; for(int i=0; i<n; i++){ cin>>x[i]; // if(i%2==0){ // l^=x[i]; // } // else{ // ke^=x[i]; // } } for(int i=0; i<m; i++){ int j; cin>>j; if(j==1){ int k,g; cin>>k>>g; k--; // if(k%2==0){ // l^=x[k]; // l^=g; // } // else{ // ke^=x[k]; // ke^=g; // } x[k]=g; } else{ int k,g; cin>>k>>g; k--; g--; // if(g-k+1%2==0){ // cout<<0<<endl; // } // else{ int ans=0; for(int f=k; f<=g;f++){ int ka=(f-k+1)*(g-f+1); if(ka%2==1){ ans^=x[f]; } } cout<<ans<<endl; //} } } }
#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...