oj.uz

Submission #372284

# Submission time Handle Problem Language Result Execution time Memory
372284 2021-02-27T13:42:30 Z gustason Airplanes (LMIO17_lektuvai) C++11
11 / 100
 59 ms 6636 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
struct Node {
    int mx;
    int setAll;
    bool setAllValid;
    Node() {
        setAllValid = false;
        setAll = 0;
        mx = 0;
    }
    void Reset() {
        setAllValid = false;
    }
};
struct SegTree {
    int n;
    vector<Node> tree;
    SegTree(vector<int>& a) {
        n = a.size();
        tree.assign(4*n, Node());
        build_r(a, 0, n-1, 0);
    }
    void build_r(vector<int>& a, int l, int r, int idx) {
        if (l == r) {
            if (l < n)
                tree[idx].mx = a[l];
            else
                tree[idx].mx = 0;
            return;
        }

        int mid = (l + r) / 2;
        build_r(a, l, mid, 2*idx+1);
        build_r(a, mid+1, r, 2*idx+2);

        tree[idx].mx = max(tree[2*idx+1].mx, tree[2*idx+2].mx);
    }
    void applyAggr(int idx, int l, int r) {
        if (tree[idx].setAllValid)
            tree[idx].mx = max(tree[idx].mx, tree[idx].setAll);

        if (l != r) {
            compose(idx, 2*idx+1);
            compose(idx, 2*idx+2);
        }

        tree[idx].Reset();
    }
    void compose(int par, int child) {
        if (tree[par].setAllValid) {
            tree[child].setAllValid = true;
            tree[child].setAll = tree[par].setAll;
        }
    }
    void updateSet(int L, int R, int val) {
        updateSet_r(0, 0, n-1, L, R, val);
    }
    void updateSet_r(int idx, int l, int r, int& L, int& R, int& val) {
        if (r < L || R < l || l >= n)
            return;
        if (L <= l && R >= r) {
            tree[idx].setAllValid = true;
            tree[idx].setAll = max(tree[idx].setAll, val);
            return;
        }

        applyAggr(idx, l, r);

        int mid = (l + r) / 2;
        updateSet_r(2*idx+1, l, mid, L, R, val);
        updateSet_r(2*idx+2, mid+1, r, L, R, val);
        applyAggr(2*idx+1, l, mid);
        applyAggr(2*idx+2, mid+1, r);

        tree[idx].mx = max(tree[2*idx+1].mx, tree[2*idx+2].mx);
    }
    int getMax(int L, int R) {
        return getMax_r(0, 0, n-1, L, R);
    }
    int getMax_r(int idx, int l, int r, int& L, int& R) {
        if (r < L || R < l || l >= n)
            return 0;

        applyAggr(idx, l, r);

        if (L <= l && R >= r)
            return tree[idx].mx;

        int mid = (l + r) / 2;
        return max(getMax_r(2*idx+1, l, mid, L, R), getMax_r(2*idx+2, mid+1, r, L, R));
    }
};
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
//    freopen("test.in", "r", stdin);
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<int> p(n);
    p[n-1] = -1;
    for(int i = 0; i < n-1; i++) {
        cin >> p[i];
        p[i]--;
    }
    if (n <= 2000) {
        int q;
        cin >> q;
        for(int i = 0; i < q; i++) {
            char type;
            cin >> type;
            if (type == 'I') {
                int idx;
                cin >> idx;
                idx--;
                cout << a[idx] << "\n";
            } else if (type == 'P') {
                int idx, by;
                cin >> idx >> by;
                idx--;
                a[idx] += by;
                vector<bool> vis(n+1, false);
                while(1) {
                    int par = p[idx];
                    if (par == -1 || vis[par]) break;
                    a[par] = max(a[par], a[idx]);
                    idx = par;
                }
            }
        }
    } else {
    int q;
    cin >> q;
    SegTree tree(a);
    for(int i = 0; i < q; i++) {
        char type;
        cin >> type;
        if (type == 'I') {
            int idx;
            cin >> idx;
            idx--;
            cout << tree.getMax(0, idx) << "\n";
        } else if (type == 'P') {
            int idx, by;
            cin >> idx >> by;
            idx--;
            a[idx] = tree.getMax(0, idx) + by;
            tree.updateSet(idx, n, a[idx]);
        }
    }
    }
//    vector<int> a(4);
//    a = {2, 4, 5, 5};
//    SegTree tree(a);
//    tree.updateSet(0, 2, 8);
//    tree.updateSet(0, 3, 6);
//    tree.updateSet(0, 3, 4);
//    tree.updateSet(0, 3, 7);
//    tree.updateSet(0, 1, 9);
//    for(int i = 0; i < 4; i++) {
//        cout << tree.getMax(i, i) << " ";
//    } cout << "\n";
//    cout << tree.getMax(2, 3) << "\n";
    return 0;
}

Subtask #1
5.0 / 5.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 2 ms 364 KB Output is correct
7 Correct 1 ms 384 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 1 ms 364 KB Output is correct

Subtask #2
6.0 / 6.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 2 ms 364 KB Output is correct
7 Correct 1 ms 384 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 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct

Subtask #3
0 / 40.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 2 ms 364 KB Output is correct
7 Correct 1 ms 384 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 1 ms 364 KB Output is correct
12 Incorrect 59 ms 6636 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 49.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 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Incorrect 59 ms 6636 KB Output isn't correct
25 Halted 0 ms 0 KB -