oj.uz

Submission #672322

# Submission time Handle Problem Language Result Execution time Memory
672322 2022-12-15T14:11:54 Z FedShat Two Antennas (JOI19_antennas) C++17
13 / 100
 3000 ms 27548 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr ll INFLL = numeric_limits<ll>::max() / 2;

template<class T>
istream &operator>>(istream &is, vector<T> &a) {
    for (auto &i : a) {
        is >> i;
    }
    return is;
}

struct SegTree {
    struct Node {
        int mx = -INF, mn = INF, ans = -2 * INF, push = INF;
    };

    vector<Node> tree;
    vector<int> hx, ans;
    int n;

    SegTree(int n) : n(n) {
        hx.resize(n, -INF);
        ans.resize(n, -2 * INF);
        tree.resize(4 * n);
    }

    void push(int v, int l, int r) {// min=
        if (l + 1 < r) {
            tree[2 * v + 1].push = min(tree[v].push, tree[2 * v + 1].push);
            tree[2 * v + 2].push = min(tree[v].push, tree[2 * v + 2].push);
        }
        tree[v].mn = min(tree[v].mn, tree[v].push);
        tree[v].ans = max(tree[v].ans, tree[v].mx - tree[v].mn);
        tree[v].push = INF;
    }

    Node pull(const Node &vl, const Node &vr) {
        Node ans;
        ans.mn = min(vl.mn, vr.mn);
        ans.mx = max(vl.mx, vr.mx);
        ans.ans = max({vl.ans, vr.ans, ans.mx - ans.mn});
        return ans;
    }

    void update_seg(int v, int l, int r, int li, int ri, int x) {// min= x
        push(v, l, r);
        if (li >= r || l >= ri) {
            return;
        }
        if (li <= l && r <= ri) {
            tree[v].push = x;
            push(v, l, r);
            return;
        }
        int m = (l + r) / 2;
        update_seg(2 * v + 1, l, m, li, ri, x);
        update_seg(2 * v + 2, m, r, li, ri, x);
        tree[v] = pull(tree[2 * v + 1], tree[2 * v + 2]);
    }

    void update_seg(int li, int ri, int x) {
        li = max(li, 0);
        ri = min(ri + 1, n);
        for (int i = li; i < ri; ++i) {
            ans[i] = max(ans[i], hx[i] - x);
        }
        // update_seg(0, 0, n, li, ri, x);
    }

    void update_point(int v, int l, int r, int i, int x) {
        push(v, l, r);
        if (l + 1 == r) {
            tree[v].mx = x;
            tree[v].ans = max(tree[v].ans, tree[v].mx - tree[v].mn);
            return;
        }
        int m = (l + r) / 2;
        {
            push(2 * v + 1, l, m);
            push(2 * v + 2, m, r);
        }
        if (i < m) {
            update_point(2 * v + 1, l, m, i, x);
        } else {
            update_point(2 * v + 2, m, r, i, x);
        }
        tree[v] = pull(tree[2 * v + 1], tree[2 * v + 2]);
    }

    void update_point(int i, int x) {
        hx[i] = x;
        // update_point(0, 0, n, i, x);
    }

    int get(int v, int l, int r, int li, int ri) {
        push(v, l, r);
        if (li >= r || l >= ri) {
            return -2 * INF;
        }
        if (li <= l && r <= ri) {
            return tree[v].ans;
        }
        int m = (l + r) / 2;
        return max(get(2 * v + 1, l, m, li, ri), get(2 * v + 2, m, r, li, ri));
    }

    int get(int li, int ri) {
        int res = -2 * INF;
        for (int i = li; i < ri; ++i) {
            res = max(res, ans[i]);
        }
        return res;
        // return get(0, 0, n, li, ri);
    }
};

struct Event {
    int x;
    int t;// -1 is opened, +1 is closed, 0 is new point, 2 is query
    int i;
    int l;// for query

    bool operator<(const Event &p) const {
        return x < p.x || (x == p.x && t < p.t);
    }
};

int main() {
    cin.tie(0)->sync_with_stdio(0);
#ifdef __APPLE__
    freopen("input.txt", "r", stdin);
#endif
    int n;
    cin >> n;
    vector<array<int, 3>> hab(n);
    for (int i = 0; i < n; ++i) {
        cin >> hab[i][0] >> hab[i][1] >> hab[i][2];
    }
    int q;
    cin >> q;
    vector<pair<int, int>> lr(q);
    for (int i = 0; i < q; ++i) {
        cin >> lr[i].first >> lr[i].second;
        --lr[i].first;
        --lr[i].second;
    }
    vector<int> ans(q, -2 * INF);
    auto solve = [&]() {
        vector<Event> e;
        for (int i = 0; i < n; ++i) {
            e.push_back({i, 0, i, -1});
            e.push_back({i + hab[i][1], -1, i, -1});
            e.push_back({i + hab[i][2], +1, i, -1});
        }
        for (int i = 0; i < q; ++i) {
            e.push_back({lr[i].second, 2, i, lr[i].first});
        }
        sort(e.begin(), e.end());
        SegTree st(n);
        for (auto [x, t, i, l] : e) {
            // cout << x << " " << t << " " << i << " " << l << "\n";
            if (t == -1) {
                st.update_point(i, hab[i][0]);
            } else if (t == 1) {
                st.update_point(i, -INF);
            } else if (t == 0) {
                st.update_seg(x - hab[i][2], x - hab[i][1], hab[i][0]);
            } else {
                ans[i] = max(ans[i], st.get(l, x + 1));
            }
        }
    };
    solve();
    for (auto &[l, r] : lr) {
        l = n - l - 1;
        r = n - r - 1;
        swap(l, r);
    }
    reverse(hab.begin(), hab.end());
    solve();
    for (auto i : ans) {
        cout << max(-1, i) << "\n";
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 340 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 124 ms 9684 KB Output is correct
26 Correct 23 ms 1412 KB Output is correct
27 Correct 262 ms 11720 KB Output is correct
28 Correct 276 ms 11884 KB Output is correct
29 Correct 128 ms 9696 KB Output is correct
30 Correct 198 ms 9408 KB Output is correct
31 Correct 119 ms 11380 KB Output is correct
32 Correct 288 ms 11872 KB Output is correct
33 Correct 199 ms 11432 KB Output is correct
34 Correct 136 ms 5980 KB Output is correct
35 Correct 239 ms 11780 KB Output is correct
36 Correct 286 ms 11888 KB Output is correct
37 Correct 159 ms 6700 KB Output is correct
38 Correct 291 ms 11856 KB Output is correct
39 Correct 40 ms 2492 KB Output is correct
40 Correct 269 ms 11872 KB Output is correct
41 Correct 208 ms 9796 KB Output is correct
42 Correct 281 ms 11872 KB Output is correct
43 Correct 95 ms 4840 KB Output is correct
44 Correct 279 ms 11872 KB Output is correct
45 Correct 49 ms 2624 KB Output is correct
46 Correct 283 ms 11876 KB Output is correct
47 Correct 70 ms 3236 KB Output is correct
48 Correct 299 ms 11876 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3065 ms 27548 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 124 ms 9684 KB Output is correct
26 Correct 23 ms 1412 KB Output is correct
27 Correct 262 ms 11720 KB Output is correct
28 Correct 276 ms 11884 KB Output is correct
29 Correct 128 ms 9696 KB Output is correct
30 Correct 198 ms 9408 KB Output is correct
31 Correct 119 ms 11380 KB Output is correct
32 Correct 288 ms 11872 KB Output is correct
33 Correct 199 ms 11432 KB Output is correct
34 Correct 136 ms 5980 KB Output is correct
35 Correct 239 ms 11780 KB Output is correct
36 Correct 286 ms 11888 KB Output is correct
37 Correct 159 ms 6700 KB Output is correct
38 Correct 291 ms 11856 KB Output is correct
39 Correct 40 ms 2492 KB Output is correct
40 Correct 269 ms 11872 KB Output is correct
41 Correct 208 ms 9796 KB Output is correct
42 Correct 281 ms 11872 KB Output is correct
43 Correct 95 ms 4840 KB Output is correct
44 Correct 279 ms 11872 KB Output is correct
45 Correct 49 ms 2624 KB Output is correct
46 Correct 283 ms 11876 KB Output is correct
47 Correct 70 ms 3236 KB Output is correct
48 Correct 299 ms 11876 KB Output is correct
49 Execution timed out 3065 ms 27548 KB Time limit exceeded
50 Halted 0 ms 0 KB -