Submission #1221511

#TimeUsernameProblemLanguageResultExecution timeMemory
1221511mayacXORanges (eJOI19_xoranges)C++20
0 / 100
1096 ms2036 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),vxor(n+1,0);
    for(int i=0;i<n;i++){
        cin>>v[i];
        vxor[i+1]=vxor[i]^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(b-a==1){
                    ans=vxor[b]^vxor[a];
                }
            }
            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...