제출 #1221501

#제출 시각아이디문제언어결과실행 시간메모리
1221501mayacXORanges (eJOI19_xoranges)C++20
55 / 100
1092 ms1320 KiB
#include <iostream> #include <vector> #include <queue> using namespace std; int main(){ int n,q,a,b,t,ans; cin>>n>>q; vector<int> v(n); for(int i=0;i<n;i++)cin>>v[i]; while(q--){ cin>>t>>a>>b;a--; if(t==1){ v[a]=b; }else{ ans=0; for(int i=a;i<b;i++){ if(((i-a+1)*(b-i))%2==1){ ans=ans^v[i]; } } cout<<ans<<"\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...