Submission #925547

# Submission time Handle Problem Language Result Execution time Memory
925547 2024-02-12T03:03:05 Z imarn XORanges (eJOI19_xoranges) C++14
0 / 100
94 ms 8792 KB
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define vp vector<pii>
using namespace std;
const int N=2e5+5;
int t[2][2*N]{0};
int a[N]{0};
int qr(int i,int l,int r,int sz,int res=0){
    for(l+=sz,r+=sz;l<r;l>>=1,r>>=1){
        if(l&1)res^=t[i][l++];
        if(r&1)res^=t[i][--r];
    }return res;
}
void upd(int i,int id,int amt,int sz){
    id+=sz;t[i][id]=amt;
    for(id>>=1;id;id>>=1)t[i][id]=t[i][2*id]^t[i][2*id+1];
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,q;cin>>n>>q;
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n;i+=2)t[0][i+n]=a[i];
    for(int i=1;i<n;i+=2)t[1][i+n]=a[i];
    for(int i=n-1;i>0;i--)t[0][i]=t[0][2*i]^t[0][2*i+1],t[1][i]=t[1][2*i]^t[1][2*i+1];
    while(q--){
        int o;cin>>o;
        if(o==1){
            int i,j;cin>>i>>j;
            if((i-1)&1)upd(1,i-1,j,n);
            else upd(0,i-1,j,n);
        }
        else {
            int l,r;cin>>l>>r;
            if((r-l+1)&1)cout<<qr((l-1)%2,l-1,r,n)<<'\n';
            else cout<<qr(l%2,l-1,r,n)<<'\n';
        }
    }
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 94 ms 8792 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -