제출 #1269284

#제출 시각아이디문제언어결과실행 시간메모리
12692846ydgXORanges (eJOI19_xoranges)C++20
55 / 100
1095 ms2184 KiB
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    int n,q;
    cin>>n>>q;
    vector<int> orrange;
    for(int i=0;i<n;i++){
        int temp;
        cin>>temp;
        orrange.push_back(temp);


    }
    for(int i=0;i<q;i++){
        int type;
        cin>>type;
        if(type==1){
            int i,value;
            cin>>i>>value;
            orrange[i-1]=value;
            continue;
        }
        else{
            int l,u;
            cin>>l>>u;
            //if(l-u==0){
                //cout<<orrange[l-1]<<"\n";
          //  }
            //else
                if((l-u)%2==0){
                //XOR all of the odd numbers;
                long long answ=0;
                for(int i=l-1;i<u;i+=2){
                    answ=answ^orrange[i];
                }

                cout<<answ<<"\n";

            }
            else{cout<<0<<"\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...