제출 #1219213

#제출 시각아이디문제언어결과실행 시간메모리
1219213lizi14XORanges (eJOI19_xoranges)C++20
0 / 100
1096 ms1532 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 ans1=0,ans2=0;
                for(int f=k; f<=g;f++){
                    if(f%2==0)ans1^=x[f];
                    else ans2^=x[f];
                }
                if(k%2==0){
                    cout<<ans1<<endl;
                }
                else cout<<ans2<<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...