oj.uz

Submission #453191

# Submission time Handle Problem Language Result Execution time Memory
453191 2021-08-04T08:48:56 Z lukadupli XORanges (eJOI19_xoranges) C++14
100 / 100
 679 ms 10724 KB 
#include <bits/stdc++.h>

#define f first
#define s second

using namespace std;

typedef pair <int, int> pii;

const int MAX = 1 << 18;

struct tournament
{
    pii nodes[2 * MAX];

    pii merge_nodes(pii l_node, int l_node_size, pii r_node, int r_node_size){
        pii res = {l_node.f, 0};

        if(l_node_size > 1) res.s = l_node.s;

        if((l_node_size) % 2){
            if(r_node_size > 1) res.f ^= r_node.s;
            res.s ^= r_node.f;
        }
        else{
            res.f ^= r_node.f;
            if(r_node_size) res.s ^= r_node.s;
        }

        return res;
    }

    void build(int *arr, int arr_size, int node = 1, int l = 0, int r = MAX){
        if(r - l == 1){
            if(l < arr_size) nodes[node] = {arr[l], arr[l]};
            return;
        }

        int m = (l + r) / 2;
        build(arr, arr_size, 2 * node, l, m);
        build(arr, arr_size, 2 * node + 1, m, r);

        nodes[node] = merge_nodes(nodes[2 * node], m - l, nodes[2 * node + 1], r - m);
    }

    void change(int ind, int val, int node = 1, int l = 0, int r = MAX){
        if(r - l == 1){
            nodes[node] = {val, val};
            return;
        }

        int m = (l + r) / 2;
        if(ind < m) change(ind, val, 2 * node, l, m);
        else change(ind, val, 2 * node + 1, m, r);

        nodes[node] = merge_nodes(nodes[2 * node], m - l, nodes[2 * node + 1], r - m);
    }

    pair <pii, int> query(int lq, int rq, int node = 1, int l = 0, int r = MAX){
        if(l >= lq && r <= rq) return {nodes[node], r - l};
        if(l >= rq || r <= lq) return {{0, 0}, 0};

        int m = (l + r) / 2;
        pair <pii, int> l_child = query(lq, rq, 2 * node, l, m);
        pair <pii, int> r_child = query(lq, rq, 2 * node + 1, m, r);

        return {merge_nodes(l_child.f, l_child.s, r_child.f, r_child.s), l_child.s + r_child.s};
    }


};

int n, q, arr[MAX];
tournament tour;

int main()
{
    cin >> n >> q;
    for(int i = 0; i < n; i++) cin >> arr[i];

    tour.build(arr, n);

    while(q--){
        int mode;
        cin >> mode;

        if(mode == 1){
            int ind, val;
            cin >> ind >> val;

            tour.change(ind - 1, val);
        }
        else{
            int l, r;
            cin >> l >> r;

            if((r - l + 1) % 2) cout << tour.query(l - 1, r).f.f << '\n';
            else cout << 0 << '\n';
        }
    }

    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2252 KB Output is correct
2 Correct 4 ms 2252 KB Output is correct
3 Correct 4 ms 2252 KB Output is correct
4 Correct 4 ms 2316 KB Output is correct
5 Correct 4 ms 2332 KB Output is correct
6 Correct 6 ms 2252 KB Output is correct
7 Correct 6 ms 2252 KB Output is correct
8 Correct 6 ms 2252 KB Output is correct
9 Correct 6 ms 2252 KB Output is correct
10 Correct 5 ms 2252 KB Output is correct
11 Correct 16 ms 2432 KB Output is correct
12 Correct 15 ms 2420 KB Output is correct
13 Correct 19 ms 2424 KB Output is correct
14 Correct 19 ms 2352 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 679 ms 9132 KB Output is correct
2 Correct 672 ms 10692 KB Output is correct
3 Correct 672 ms 10724 KB Output is correct
4 Correct 641 ms 10284 KB Output is correct
5 Correct 641 ms 10384 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2252 KB Output is correct
2 Correct 4 ms 2252 KB Output is correct
3 Correct 4 ms 2252 KB Output is correct
4 Correct 4 ms 2316 KB Output is correct
5 Correct 4 ms 2332 KB Output is correct
6 Correct 6 ms 2252 KB Output is correct
7 Correct 6 ms 2252 KB Output is correct
8 Correct 6 ms 2252 KB Output is correct
9 Correct 6 ms 2252 KB Output is correct
10 Correct 5 ms 2252 KB Output is correct
11 Correct 16 ms 2432 KB Output is correct
12 Correct 15 ms 2420 KB Output is correct
13 Correct 19 ms 2424 KB Output is correct
14 Correct 19 ms 2352 KB Output is correct
15 Correct 679 ms 9132 KB Output is correct
16 Correct 672 ms 10692 KB Output is correct
17 Correct 672 ms 10724 KB Output is correct
18 Correct 641 ms 10284 KB Output is correct
19 Correct 641 ms 10384 KB Output is correct
20 Correct 523 ms 10524 KB Output is correct
21 Correct 520 ms 10456 KB Output is correct
22 Correct 527 ms 10432 KB Output is correct
23 Correct 625 ms 10468 KB Output is correct
24 Correct 631 ms 10492 KB Output is correct