oj.uz

Submission #803186

# Submission time Handle Problem Language Result Execution time Memory
803186 2023-08-03T00:12:00 Z Essa2006 XORanges (eJOI19_xoranges) C++14
55 / 100
 49 ms 4484 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)
const int pr=17, s_p=1<<pr, e_p=(1<<(pr+1))-1;
int n, q;
int S[2][1<<(pr+1)];
void update(int par, int ind, int new_){
    S[par][ind]=new_;
    S[!par][ind]=0;
    while(ind/=2){
        S[par][ind]=S[par][ind*2]^S[par][ind*2+1];
        S[!par][ind]=S[!par][ind*2]^S[!par][ind*2+1];
    }
}
 
int get(int id, int u, int v, int l, int r, int par){
    if(l>v || r<u)
        return 0;
    if(l>=u && r<=v)
        return S[par][id];
    int md=(l+r)/2;
    return get(id*2, u, v, l, md, par)^get(id*2+1, u, v, md+1, r, par);
}
int main(){
    cin>>n>>q;
    for(int i=1, a;i<=n;i++){
        cin>>a;
        update(i&1, i+s_p, a);
    }
    while(q--){
        int type, i, x;
        cin>>type>>i>>x;
        if(type==1){
            for(int j=0;j<=29;j++){
                update(i&1, i+s_p, x);
            }
        }
        else if(type==2){
            int ans=0; 
            if((x-i+1)&1)
                ans=get(1, i+s_p, x+s_p, s_p, e_p, i&1);
            cout<<ans<<endl;
        }
    }
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 14 ms 444 KB Output is correct
12 Correct 13 ms 340 KB Output is correct
13 Correct 10 ms 456 KB Output is correct
14 Correct 13 ms 460 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 4484 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 14 ms 444 KB Output is correct
12 Correct 13 ms 340 KB Output is correct
13 Correct 10 ms 456 KB Output is correct
14 Correct 13 ms 460 KB Output is correct
15 Runtime error 49 ms 4484 KB Execution killed with signal 11
16 Halted 0 ms 0 KB -