oj.uz

Submission #803181

# Submission time Handle Problem Language Result Execution time Memory
803181 2023-08-03T00:06:20 Z Essa2006 XORanges (eJOI19_xoranges) C++14
55 / 100
 757 ms 61704 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][30][1<<(pr+1)];
void update(int par, int j, int ind, bool new_){
    S[par][j][ind]=new_;
    S[!par][j][ind]=0;
    while(ind/=2){
        S[par][j][ind]=S[par][j][ind*2]^S[par][j][ind*2+1];
        S[!par][j][ind]=S[!par][j][ind*2]^S[!par][j][ind*2+1];
    }
}
 
bool get(int id, int u, int v, int l, int r, int par, int j){
    if(l>v || r<u)
        return 0;
    if(l>=u && r<=v)
        return S[par][j][id];
    int md=(l+r)/2;
    return get(id*2, u, v, l, md, par, j)^get(id*2+1, u, v, md+1, r, par, j);
}
int main(){
    cin>>n>>q;
    for(int i=1, a;i<=n;i++){
        cin>>a;
        for(int j=0;j<=29;j++){
            update(i&1, j, i+s_p, ((a&(1<<j))!=0));
        }
    }
    while(q--){
        int type, i, x;
        cin>>type>>i>>x;
        if(type==1){
            for(int j=0;j<=29;j++){
                update(i&1, j, i+s_p, ((x&(1<<j))!=0));
            }
        }
        else if(type==2){
            int ans=0; 
            for(int j=0;j<=29 && (x-i+1)&1;j++){
                bool odd=get(1, i+s_p, x+s_p, s_p, e_p, i&1, j);
                if(odd)
                    ans+=1<<j;
            }
            cout<<ans<<endl;
        }
    }
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2516 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 3 ms 2620 KB Output is correct
4 Correct 2 ms 2516 KB Output is correct
5 Correct 2 ms 2516 KB Output is correct
6 Correct 6 ms 2516 KB Output is correct
7 Correct 6 ms 2516 KB Output is correct
8 Correct 6 ms 2516 KB Output is correct
9 Correct 6 ms 2516 KB Output is correct
10 Correct 6 ms 2516 KB Output is correct
11 Correct 57 ms 4488 KB Output is correct
12 Correct 58 ms 4480 KB Output is correct
13 Correct 58 ms 4504 KB Output is correct
14 Correct 57 ms 4412 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 757 ms 61704 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2516 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 3 ms 2620 KB Output is correct
4 Correct 2 ms 2516 KB Output is correct
5 Correct 2 ms 2516 KB Output is correct
6 Correct 6 ms 2516 KB Output is correct
7 Correct 6 ms 2516 KB Output is correct
8 Correct 6 ms 2516 KB Output is correct
9 Correct 6 ms 2516 KB Output is correct
10 Correct 6 ms 2516 KB Output is correct
11 Correct 57 ms 4488 KB Output is correct
12 Correct 58 ms 4480 KB Output is correct
13 Correct 58 ms 4504 KB Output is correct
14 Correct 57 ms 4412 KB Output is correct
15 Incorrect 757 ms 61704 KB Output isn't correct
16 Halted 0 ms 0 KB -