oj.uz

Submission #369882

# Submission time Handle Problem Language Result Execution time Memory
369882 2021-02-22T17:02:19 Z AdamGS XORanges (eJOI19_xoranges) C++14
100 / 100
 120 ms 12164 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
const ll LIM=2e5+7;
ll T[3*LIM][2], N=1;
ll cnt(ll l, ll r, ll k) {
    l+=N; r+=N;
    ll ans=T[l][k];
    if(l!=r) ans^=T[r][k];
    while(l/2!=r/2) {
        if(l%2==0) ans^=T[l+1][k];
        if(r%2==1) ans^=T[r-1][k];
        l/=2; r/=2;
    }
    return ans;
}
void upd(ll v, ll x, ll k) {
    v+=N;
    while(v) {
        T[v][k]^=x;
        v/=2;
    }
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, q;
    cin >> n >> q;
    while(N<n) N*=2;
    rep(i, n) cin >> T[N+i/2][i%2];
    for(ll i=N-1; i; --i) {
        T[i][0]=T[2*i][0]^T[2*i+1][0];
        T[i][1]=T[2*i][1]^T[2*i+1][1];
    }
    while(q--) {
        ll x, a, b;
        cin >> x >> a >> b; --a;
        if(x==1) {
            upd(a/2, T[N+a/2][a%2]^b, a%2);
        } else {
            --b;
            if((b-a)%2==1) {
                cout << "0\n";
            } else {
                cout << cnt(a/2, b/2, a%2) << '\n';
            }
        }
    }
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

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

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 12164 KB Output is correct
2 Correct 118 ms 12012 KB Output is correct
3 Correct 118 ms 12012 KB Output is correct
4 Correct 105 ms 11756 KB Output is correct
5 Correct 107 ms 11884 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 4 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 3 ms 620 KB Output is correct
14 Correct 3 ms 620 KB Output is correct
15 Correct 120 ms 12164 KB Output is correct
16 Correct 118 ms 12012 KB Output is correct
17 Correct 118 ms 12012 KB Output is correct
18 Correct 105 ms 11756 KB Output is correct
19 Correct 107 ms 11884 KB Output is correct
20 Correct 113 ms 11860 KB Output is correct
21 Correct 115 ms 11756 KB Output is correct
22 Correct 111 ms 11756 KB Output is correct
23 Correct 106 ms 11884 KB Output is correct
24 Correct 103 ms 11756 KB Output is correct