oj.uz

Submission #720175

# Submission time Handle Problem Language Result Execution time Memory
720175 2023-04-07T14:22:15 Z Cyanmond Feast (NOI19_feast) C++17
100 / 100
 658 ms 36176 KB 
#include <bits/stdc++.h>

using i64 = long long;
constexpr i64 inf = 1ll << 55;

using D = std::array<std::array<std::vector<i64>, 2>, 2>;

std::vector<i64> mergeConcave(const std::vector<i64> &a, const std::vector<i64> &b) {
    const int sl = (int)a.size(), sr = (int)b.size();
    std::vector<i64> ret(sl + sr - 1);
    int j = 1;
    i64 val = a[0] + b[0];
    ret[0] = val;
    for (int i = 1; i < sl; ++i) {
        while (j != sr and b[j] - b[j - 1] > a[i] - a[i - 1]) {
            val += b[j] - b[j - 1];
            ret[i - 1 + j] = val;
            ++j;
        }
        val += a[i] - a[i - 1];
        ret[i + j - 1] = val;
    }
    while (j != sr) {
        val += b[j] - b[j - 1];
        ret[sl - 1 + j] = val;
        ++j;
    }
    return ret;
}
void chmax(std::vector<i64> &a, const std::vector<i64> &b) {
    const int n = (int)std::min(a.size(), b.size());
    for (int i = 0; i < n; ++i) a[i] = std::max(a[i], b[i]);
}
void chmax(i64 &a, const i64 b) {
    if (a < b) a = b;
}

void solve() {
    int N, K;
    std::cin >> N >> K;
    std::vector<i64> A(N);
    for (auto &e : A) std::cin >> e;

    auto merge = [&](const D &dl, const D &dr) {
        const int sl = (int)dl[0][0].size(), sr = (int)dr[0][0].size();
        D ret;
        for (int x = 0; x < 2; ++x) {
            for (int y = 0; y < 2; ++y) {
                ret[x][y].assign(sl + sr - 1, -inf);
            }
        }
        for (int xl = 0; xl < 2; ++xl) {
            for (int xr = 0; xr < 2; ++xr) {
                for (int yl = 0; yl < 2; ++yl) {
                    for (int yr = 0; yr < 2; ++yr) {
                        // merge !
                        // ret[xl][yr] <- dl[xl][xr] * dr[yl][yr]
                        const auto &a = dl[xl][xr], &b = dr[yl][yr];
                        auto &res = ret[xl][yr];
                        if (xr == 1 and yl == 1) {
                            const auto &lVec = dl[xl][xr], &rVec = dr[yl][yr];
                            auto mVec = mergeConcave(lVec, rVec);
                            mVec.erase(mVec.begin());
                            mVec[0] = -inf;
                            chmax(ret[xl][yr], mVec);
                            /*
                            int j = 1;
                            i64 val = a[0] + b[0];
                            // chmax(res[0], val);
                            for (int i = 1; i < sl; ++i) {
                                while (j != sr and b[j] - b[j - 1] > a[i] - a[i - 1]) {
                                    val += b[j] - b[j - 1];
                                    chmax(res[i - 1 + j - 1], val);
                                    ++j;
                                }
                                val += a[i] - a[i - 1];
                                chmax(res[i + j - 1 - 1], val);
                            }
                            while (j != sr) {
                                val += b[j] - b[j - 1];
                                chmax(res[sl - 1 + j - 1], val);
                                ++j;
                            }
                            res[0] = -inf;
                            */
                        } else {
                            int j = 1;
                            i64 val = a[0] + b[0];
                            chmax(res[0], val);
                            for (int i = 1; i < sl; ++i) {
                                while (j != sr and b[j] - b[j - 1] > a[i] - a[i - 1]) {
                                    val += b[j] - b[j - 1];
                                    chmax(res[i - 1 + j], val);
                                    ++j;
                                }
                                val += a[i] - a[i - 1];
                                chmax(res[i + j - 1], val);
                            }
                            while (j != sr) {
                                val += b[j] - b[j - 1];
                                chmax(res[sl - 1 + j], val);
                                ++j;
                            }
                        }
                    }
                }
            }
        }
        for (int x = 0; x < 2; ++x) {
            for (int y = 0; y < 2; ++y) {
                for (int i = 1; i < sl + sr - 1; ++i) {
                    ret[x][y][i] = std::max(ret[x][y][i], ret[x][y][i - 1]);
                }
            }
        }
        chmax(ret[0][0], ret[0][1]);
        chmax(ret[1][0], ret[1][1]);
        chmax(ret[0][0], ret[1][0]);
        chmax(ret[0][1], ret[1][1]);
        return ret;
    };

    auto solve = [&](auto &&self, const int l, const int r) -> D {
        if (r - l == 1) {
            D ret;
            ret[0][0] = {0, A[l]};
            ret[0][1] = {-inf, A[l]};
            ret[1][0] = {-inf, A[l]};
            ret[1][1] = {-inf, A[l]};
            return ret;
        }
        const int m = (l + r) / 2;
        const auto lRes = self(self, l, m), rRes = self(self, m, r);
        const auto ret = merge(lRes, rRes);
        return ret;
    };

    const auto res = solve(solve, 0, N);
    i64 answer = res[0][0][K];
    std::cout << answer << std::endl;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    solve();
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 506 ms 31012 KB Output is correct
2 Correct 522 ms 32816 KB Output is correct
3 Correct 525 ms 34620 KB Output is correct
4 Correct 536 ms 32780 KB Output is correct
5 Correct 504 ms 31696 KB Output is correct
6 Correct 489 ms 35008 KB Output is correct
7 Correct 497 ms 31592 KB Output is correct
8 Correct 502 ms 33800 KB Output is correct
9 Correct 515 ms 34372 KB Output is correct
10 Correct 510 ms 31412 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 503 ms 31292 KB Output is correct
2 Correct 518 ms 33420 KB Output is correct
3 Correct 509 ms 31840 KB Output is correct
4 Correct 497 ms 31688 KB Output is correct
5 Correct 486 ms 34440 KB Output is correct
6 Correct 481 ms 35328 KB Output is correct
7 Correct 489 ms 32684 KB Output is correct
8 Correct 501 ms 35296 KB Output is correct
9 Correct 536 ms 30784 KB Output is correct
10 Correct 499 ms 31936 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 606 ms 33096 KB Output is correct
2 Correct 593 ms 31524 KB Output is correct
3 Correct 643 ms 31488 KB Output is correct
4 Correct 600 ms 34444 KB Output is correct
5 Correct 600 ms 35164 KB Output is correct
6 Correct 611 ms 35344 KB Output is correct
7 Correct 606 ms 31136 KB Output is correct
8 Correct 602 ms 32332 KB Output is correct
9 Correct 616 ms 32008 KB Output is correct
10 Correct 622 ms 33136 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 272 KB Output is correct
12 Correct 1 ms 320 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 320 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 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 272 KB Output is correct
12 Correct 1 ms 320 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 320 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 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 4 ms 480 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 4 ms 468 KB Output is correct
24 Correct 4 ms 468 KB Output is correct
25 Correct 4 ms 584 KB Output is correct
26 Correct 5 ms 596 KB Output is correct
27 Correct 4 ms 588 KB Output is correct
28 Correct 6 ms 488 KB Output is correct
29 Correct 5 ms 468 KB Output is correct
30 Correct 5 ms 468 KB Output is correct

Subtask #7
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 506 ms 31012 KB Output is correct
2 Correct 522 ms 32816 KB Output is correct
3 Correct 525 ms 34620 KB Output is correct
4 Correct 536 ms 32780 KB Output is correct
5 Correct 504 ms 31696 KB Output is correct
6 Correct 489 ms 35008 KB Output is correct
7 Correct 497 ms 31592 KB Output is correct
8 Correct 502 ms 33800 KB Output is correct
9 Correct 515 ms 34372 KB Output is correct
10 Correct 510 ms 31412 KB Output is correct
11 Correct 503 ms 31292 KB Output is correct
12 Correct 518 ms 33420 KB Output is correct
13 Correct 509 ms 31840 KB Output is correct
14 Correct 497 ms 31688 KB Output is correct
15 Correct 486 ms 34440 KB Output is correct
16 Correct 481 ms 35328 KB Output is correct
17 Correct 489 ms 32684 KB Output is correct
18 Correct 501 ms 35296 KB Output is correct
19 Correct 536 ms 30784 KB Output is correct
20 Correct 499 ms 31936 KB Output is correct
21 Correct 606 ms 33096 KB Output is correct
22 Correct 593 ms 31524 KB Output is correct
23 Correct 643 ms 31488 KB Output is correct
24 Correct 600 ms 34444 KB Output is correct
25 Correct 600 ms 35164 KB Output is correct
26 Correct 611 ms 35344 KB Output is correct
27 Correct 606 ms 31136 KB Output is correct
28 Correct 602 ms 32332 KB Output is correct
29 Correct 616 ms 32008 KB Output is correct
30 Correct 622 ms 33136 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 324 KB Output is correct
36 Correct 1 ms 320 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 272 KB Output is correct
42 Correct 1 ms 320 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 320 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 4 ms 480 KB Output is correct
52 Correct 4 ms 468 KB Output is correct
53 Correct 4 ms 468 KB Output is correct
54 Correct 4 ms 468 KB Output is correct
55 Correct 4 ms 584 KB Output is correct
56 Correct 5 ms 596 KB Output is correct
57 Correct 4 ms 588 KB Output is correct
58 Correct 6 ms 488 KB Output is correct
59 Correct 5 ms 468 KB Output is correct
60 Correct 5 ms 468 KB Output is correct
61 Correct 611 ms 31296 KB Output is correct
62 Correct 600 ms 35316 KB Output is correct
63 Correct 590 ms 33044 KB Output is correct
64 Correct 603 ms 32368 KB Output is correct
65 Correct 594 ms 36176 KB Output is correct
66 Correct 619 ms 32108 KB Output is correct
67 Correct 658 ms 30984 KB Output is correct
68 Correct 603 ms 32288 KB Output is correct
69 Correct 595 ms 34736 KB Output is correct
70 Correct 587 ms 34740 KB Output is correct