제출 #1219210

#제출 시각아이디문제언어결과실행 시간메모리
1219210lizi14XORanges (eJOI19_xoranges)C++20
0 / 100
256 ms3112 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; } } else{ int k,g; cin>>k>>g; k--; g--; if(g-k+1%2==0){ cout<<0<<endl; } else{ if(k%2==0){ cout<<l<<endl; } else cout<<ke<<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...