제출 #675865

#제출 시각아이디문제언어결과실행 시간메모리
675865KubetiXORanges (eJOI19_xoranges)C++14
30 / 100
3 ms472 KiB
#include <iostream> #include <vector> using namespace std; int v[1001]; int main() { int n, q; cin>>n>>q; for(int i=1; i<=n; i++) cin>>v[i]; 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; } /* int main(){ int n; cin>>n; vector<vector<int>> v(n+1); for(int i=1; i<=n; i++){ for(int j=i; j<=n; j++){ for(int x=i; x<=j; x++) v[x].push_back(x); } } for(int i=1; i<=n; i++){ for(auto it:v[i]) cout<<it<<" "; cout<<"-> "<<v[i].size()<<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...