Submission #1337026

#TimeUsernameProblemLanguageResultExecution timeMemory
1337026nambanana987XORanges (eJOI19_xoranges)C++20
55 / 100
25 ms472 KiB
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define sz(a) (int)a.size()
#define mk make_pair
#define pii pair<int,int>
int n,q;
namespace subtask1{
    const int N=10005;
    int M[N];
    void solve(){
        for(int i=1;i<=n;++i) cin>>M[i];
        while(q--){
            int type,l,r;cin>>type>>l>>r;
            if(type==1){
                M[l]=r;
            }
            else{
                int ans=0;
                for(int i=l;i<=r;++i){
                    if((!(i-l+1 &1)) || !(r-i+1 &1)) continue;
                    ans^=M[i];
                }
                cout<<ans<<'\n';
            }
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>q;
    if(n<=10000 && q<=10000) subtask1::solve();
}
#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...