oj.uz

Submission #422052

# Submission time Handle Problem Language Result Execution time Memory
422052 2021-06-09T16:17:45 Z timmyfeng Meetings (IOI18_meetings) C++17
100 / 100
 3615 ms 488068 KB 
#include <bits/stdc++.h>
using namespace std;

#include "meetings.h"

const int N = 750000, L = __lg(N) + 1;

struct segtree {
    segtree *left = nullptr, *right = nullptr;
    long long lazy_m = -1, lazy_b = 0, first = 0, last = 0;

    void apply(long long m, long long b, int l, int r) {
        if (m == -1) {
            first += b;
            last += b;
            lazy_b += b;
        } else {
            first = m * l + b;
            last = m * r + b;
            lazy_m = m;
            lazy_b = b;
        }
    }

    void push(int l, int r) {
        if (!left) {
            left = new segtree();
            right = new segtree();
        }

        int m = (l + r) / 2;
        left->apply(lazy_m, lazy_b, l, m);
        right->apply(lazy_m, lazy_b, m + 1, r);
        lazy_m = -1, lazy_b = 0;
    }

    void pull() {
        first = left->first;
        last = right->last;
    }

    long long query(int a, int l, int r) {
        if (l == r) {
            return first;
        } else {
            push(l, r);
            int m = (l + r) / 2;
            if (a <= m) {
                return left->query(a, l, m);
            } else {
                return right->query(a, m + 1, r);
            }
        }
    }

    void update(int a, int b, long long x, long long y, long long z, int l, int r) {
        if (b < l || r < a) {
            return;
        } else if (a <= l && r <= b) {
            if (first + x <= y * l + z) {
                apply(-1, x, l, r);
                return;
            } else if (last + x >= y * r + z) {
                apply(y, z, l, r);
                return;
            }
        }

        push(l, r);
        int m = (l + r) / 2;
        left->update(a, b, x, y, z, l, m);
        right->update(a, b, x, y, z, m + 1, r);
        pull();
    }
};

int adj[N][2], first[N], last[N], n;
vector<array<int, 3>> queries[N];
array<int, 2> sparse[L][N];
long long cost[N], ans[N];
vector<int> h;
segtree *mini;

void dfs(int u) {
    for (auto c : adj[u]) {
        if (c != -1) {
            dfs(c);
        }
    }

    long long maxi = h[u];
    for (auto [l, r, i] : queries[u]) {
        ans[i] = min(ans[i], (u - l + 1) * maxi +
            (r == u ? 0 : mini->query(r, 0, n - 1)));
    }

    first[u] = adj[u][0] == -1 ? u : first[adj[u][0]];
    last[u] = adj[u][1] == -1 ? u : last[adj[u][1]];

    mini->update(u, last[u], (u - first[u] + 1) * maxi,
        maxi, (adj[u][0] == -1 ? 0 : mini->query(u - 1, 0, n - 1)) - (u - 1) * maxi, 0, n - 1);
}

vector<long long> minimum_costs(vector<int> h, vector<int> l, vector<int> r) {
    int q = l.size();
    n = h.size();

    fill(ans, ans + q, LLONG_MAX);

    for (int z = 0; z < 2; ++z) {
        ::h = h;
        fill(queries, queries + n, vector<array<int, 3>>());
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < 2; ++j) {
                adj[i][j] = -1;
            }
        }

        int root = -1;
        vector<int> stk;
        for (int i = 0; i < n; ++i) {
            while (!stk.empty() && h[stk.back()] < h[i]) {
                stk.pop_back();
            }

            if (!stk.empty()) {
                int j = stk.back();
                adj[i][0] = adj[j][1];
                adj[j][1] = i;
            } else {
                adj[i][0] = root;
                root = i;
            }

            stk.push_back(i);
        }

        for (int i = 0; i <= __lg(n); ++i) {
            for (int j = 0; j + (1 << i) <= n; ++j) {
                if (i == 0) {
                    sparse[i][j] = {h[j], -j};
                } else {
                    sparse[i][j] = max(sparse[i - 1][j], sparse[i - 1][j + (1 << (i - 1))]);
                }
            }
        }

        for (int i = 0; i < q; ++i) {
            int k = __lg(r[i] - l[i] + 1);
            auto [y, j] = max(sparse[k][l[i]], sparse[k][r[i] - (1 << k) + 1]);
            queries[-j].push_back({l[i], r[i], i});
        }

        mini = new segtree();
        dfs(root);

        reverse(h.begin(), h.end());
        for (int i = 0; i < q; ++i) {
            int temp = l[i];
            l[i] = n - 1 - r[i];
            r[i] = n - 1 - temp;
        }
    }

    return vector<long long>(ans, ans + q);
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 17868 KB Output is correct
2 Correct 16 ms 19100 KB Output is correct
3 Correct 17 ms 19052 KB Output is correct
4 Correct 16 ms 19084 KB Output is correct
5 Correct 16 ms 19124 KB Output is correct
6 Correct 17 ms 19220 KB Output is correct
7 Correct 16 ms 19148 KB Output is correct
8 Correct 15 ms 19376 KB Output is correct
9 Correct 15 ms 19132 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 17868 KB Output is correct
2 Correct 16 ms 19100 KB Output is correct
3 Correct 17 ms 19052 KB Output is correct
4 Correct 16 ms 19084 KB Output is correct
5 Correct 16 ms 19124 KB Output is correct
6 Correct 17 ms 19220 KB Output is correct
7 Correct 16 ms 19148 KB Output is correct
8 Correct 15 ms 19376 KB Output is correct
9 Correct 15 ms 19132 KB Output is correct
10 Correct 22 ms 20244 KB Output is correct
11 Correct 21 ms 20236 KB Output is correct
12 Correct 22 ms 20292 KB Output is correct
13 Correct 24 ms 20300 KB Output is correct
14 Correct 23 ms 20632 KB Output is correct
15 Correct 21 ms 20344 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 17868 KB Output is correct
2 Correct 63 ms 24924 KB Output is correct
3 Correct 318 ms 72368 KB Output is correct
4 Correct 294 ms 66440 KB Output is correct
5 Correct 289 ms 72036 KB Output is correct
6 Correct 272 ms 72864 KB Output is correct
7 Correct 325 ms 74756 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 17868 KB Output is correct
2 Correct 63 ms 24924 KB Output is correct
3 Correct 318 ms 72368 KB Output is correct
4 Correct 294 ms 66440 KB Output is correct
5 Correct 289 ms 72036 KB Output is correct
6 Correct 272 ms 72864 KB Output is correct
7 Correct 325 ms 74756 KB Output is correct
8 Correct 297 ms 67256 KB Output is correct
9 Correct 239 ms 66548 KB Output is correct
10 Correct 282 ms 67324 KB Output is correct
11 Correct 291 ms 66496 KB Output is correct
12 Correct 236 ms 65736 KB Output is correct
13 Correct 253 ms 66852 KB Output is correct
14 Correct 385 ms 72896 KB Output is correct
15 Correct 249 ms 65996 KB Output is correct
16 Correct 333 ms 72144 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 17868 KB Output is correct
2 Correct 16 ms 19100 KB Output is correct
3 Correct 17 ms 19052 KB Output is correct
4 Correct 16 ms 19084 KB Output is correct
5 Correct 16 ms 19124 KB Output is correct
6 Correct 17 ms 19220 KB Output is correct
7 Correct 16 ms 19148 KB Output is correct
8 Correct 15 ms 19376 KB Output is correct
9 Correct 15 ms 19132 KB Output is correct
10 Correct 22 ms 20244 KB Output is correct
11 Correct 21 ms 20236 KB Output is correct
12 Correct 22 ms 20292 KB Output is correct
13 Correct 24 ms 20300 KB Output is correct
14 Correct 23 ms 20632 KB Output is correct
15 Correct 21 ms 20344 KB Output is correct
16 Correct 12 ms 17868 KB Output is correct
17 Correct 63 ms 24924 KB Output is correct
18 Correct 318 ms 72368 KB Output is correct
19 Correct 294 ms 66440 KB Output is correct
20 Correct 289 ms 72036 KB Output is correct
21 Correct 272 ms 72864 KB Output is correct
22 Correct 325 ms 74756 KB Output is correct
23 Correct 297 ms 67256 KB Output is correct
24 Correct 239 ms 66548 KB Output is correct
25 Correct 282 ms 67324 KB Output is correct
26 Correct 291 ms 66496 KB Output is correct
27 Correct 236 ms 65736 KB Output is correct
28 Correct 253 ms 66852 KB Output is correct
29 Correct 385 ms 72896 KB Output is correct
30 Correct 249 ms 65996 KB Output is correct
31 Correct 333 ms 72144 KB Output is correct
32 Correct 2644 ms 382244 KB Output is correct
33 Correct 1997 ms 398576 KB Output is correct
34 Correct 2336 ms 405948 KB Output is correct
35 Correct 2913 ms 404336 KB Output is correct
36 Correct 1937 ms 399360 KB Output is correct
37 Correct 2255 ms 406556 KB Output is correct
38 Correct 3419 ms 453164 KB Output is correct
39 Correct 3615 ms 453264 KB Output is correct
40 Correct 2869 ms 411552 KB Output is correct
41 Correct 3067 ms 488068 KB Output is correct
42 Correct 3361 ms 487208 KB Output is correct
43 Correct 3500 ms 487192 KB Output is correct
44 Correct 3336 ms 452036 KB Output is correct