oj.uz

Submission #772102

# Submission time Handle Problem Language Result Execution time Memory
772102 2023-07-03T15:57:30 Z VMaksimoski008 XORanges (eJOI19_xoranges) C++14
100 / 100
 130 ms 13424 KB 
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<long long, long long>
#define debug(x) cout << #x << " = " << x << endl
#define pb push_back
#define eb emplace_back
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int mod = 1e9 + 7;
using namespace std;

void setIO() {
    ios_base::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
}

struct SegTree {
    int n;
    vector<ll> v;
    vector<ull> tree;

    SegTree(vector<ll> const &v) {
        this->n = sz(v);
        this->v = v;
        tree.resize(4*sz(v) + 5);
        build(1, 0, n-1);
    }

    void build(int node, int l, int r) {
        if(l == r) {
            tree[node] = v[l];
        } else {
            int mid = (l + r) / 2;
            build(2*node, l, mid);
            build(2*node+1, mid+1, r);
            tree[node] = tree[2*node] ^ tree[2*node+1];
        }
    }

    ull query(int node, int tl, int tr, int l, ll r) {
        if(l > r) return 0;
        if(l == tl && r == tr) return tree[node];

        int tm = (tl + tr) / 2;
        return query(2*node, tl, tm, l, min(r, 1ll*tm)) ^ query(2*node+1, tm+1, tr, max(l, tm+1), r);
    }

    void update(int node, int l, int r, int pos, ll val) {
        if(l == r) {
            tree[node] = val;
            v[l] = val;
        } else {
            int mid = (l + r) / 2;
            if(l <= pos && pos <= mid)
                update(2*node, l, mid, pos, val);
            else
                update(2*node+1, mid+1, r, pos, val);
            tree[node] = tree[2*node] ^ tree[2*node+1];
        }
    }
};

int main() {
    setIO();

    int n, q;
    cin >> n >> q;

    vector<ll> v(n), even, odd;
    for(int i=0; i<n; i++) {
        cin >> v[i];
        if(i % 2 == 1) even.pb(v[i]);
        else odd.pb(v[i]);
    }

    SegTree tree1(odd), tree2(even);
    while(q--) {
        int t, a;
        ll b;
        cin >> t >> a >> b;

        if(t == 1) {
            if(a % 2 == 1)
                tree1.update(1, 0, sz(odd)-1, a/2, b);
            else
                tree2.update(1, 0, sz(even)-1, a/2-1, b);
        } else {
            if((b - a + 1) % 2 == 0) cout << 0 << '\n';
            else {
                if(a % 2 == 1)
                    cout << tree1.query(1, 0, sz(odd)-1, a/2, b/2) << '\n';
                else
                    cout << tree2.query(1, 0, sz(even)-1, a/2-1, b/2-1) << '\n';
            }
        }
    }

    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 360 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 3 ms 752 KB Output is correct
13 Correct 3 ms 736 KB Output is correct
14 Correct 4 ms 724 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 13424 KB Output is correct
2 Correct 116 ms 13124 KB Output is correct
3 Correct 116 ms 13192 KB Output is correct
4 Correct 96 ms 13212 KB Output is correct
5 Correct 96 ms 13156 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 360 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 3 ms 752 KB Output is correct
13 Correct 3 ms 736 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 130 ms 13424 KB Output is correct
16 Correct 116 ms 13124 KB Output is correct
17 Correct 116 ms 13192 KB Output is correct
18 Correct 96 ms 13212 KB Output is correct
19 Correct 96 ms 13156 KB Output is correct
20 Correct 98 ms 12428 KB Output is correct
21 Correct 95 ms 12456 KB Output is correct
22 Correct 119 ms 12388 KB Output is correct
23 Correct 94 ms 12968 KB Output is correct
24 Correct 106 ms 12928 KB Output is correct