oj.uz

Submission #720176

# Submission time Handle Problem Language Result Execution time Memory
720176 2023-04-07T14:23:36 Z Cyanmond Feast (NOI19_feast) C++17
100 / 100
 617 ms 35200 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) {
                            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 447 ms 30516 KB Output is correct
2 Correct 444 ms 31664 KB Output is correct
3 Correct 452 ms 34756 KB Output is correct
4 Correct 468 ms 31996 KB Output is correct
5 Correct 441 ms 31736 KB Output is correct
6 Correct 461 ms 32220 KB Output is correct
7 Correct 443 ms 34908 KB Output is correct
8 Correct 456 ms 35080 KB Output is correct
9 Correct 487 ms 33100 KB Output is correct
10 Correct 432 ms 32836 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 455 ms 32732 KB Output is correct
2 Correct 459 ms 32956 KB Output is correct
3 Correct 422 ms 31320 KB Output is correct
4 Correct 441 ms 30844 KB Output is correct
5 Correct 440 ms 30560 KB Output is correct
6 Correct 446 ms 30364 KB Output is correct
7 Correct 501 ms 31448 KB Output is correct
8 Correct 441 ms 31652 KB Output is correct
9 Correct 455 ms 32052 KB Output is correct
10 Correct 472 ms 31636 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 568 ms 30872 KB Output is correct
2 Correct 559 ms 34208 KB Output is correct
3 Correct 568 ms 32248 KB Output is correct
4 Correct 562 ms 31744 KB Output is correct
5 Correct 558 ms 31712 KB Output is correct
6 Correct 560 ms 31796 KB Output is correct
7 Correct 556 ms 31296 KB Output is correct
8 Correct 547 ms 33916 KB Output is correct
9 Correct 591 ms 35200 KB Output is correct
10 Correct 573 ms 31996 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 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 340 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 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 340 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 3 ms 468 KB Output is correct
22 Correct 3 ms 472 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 4 ms 468 KB Output is correct
25 Correct 3 ms 468 KB Output is correct
26 Correct 4 ms 468 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 4 ms 468 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 4 ms 464 KB Output is correct

Subtask #7
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 447 ms 30516 KB Output is correct
2 Correct 444 ms 31664 KB Output is correct
3 Correct 452 ms 34756 KB Output is correct
4 Correct 468 ms 31996 KB Output is correct
5 Correct 441 ms 31736 KB Output is correct
6 Correct 461 ms 32220 KB Output is correct
7 Correct 443 ms 34908 KB Output is correct
8 Correct 456 ms 35080 KB Output is correct
9 Correct 487 ms 33100 KB Output is correct
10 Correct 432 ms 32836 KB Output is correct
11 Correct 455 ms 32732 KB Output is correct
12 Correct 459 ms 32956 KB Output is correct
13 Correct 422 ms 31320 KB Output is correct
14 Correct 441 ms 30844 KB Output is correct
15 Correct 440 ms 30560 KB Output is correct
16 Correct 446 ms 30364 KB Output is correct
17 Correct 501 ms 31448 KB Output is correct
18 Correct 441 ms 31652 KB Output is correct
19 Correct 455 ms 32052 KB Output is correct
20 Correct 472 ms 31636 KB Output is correct
21 Correct 568 ms 30872 KB Output is correct
22 Correct 559 ms 34208 KB Output is correct
23 Correct 568 ms 32248 KB Output is correct
24 Correct 562 ms 31744 KB Output is correct
25 Correct 558 ms 31712 KB Output is correct
26 Correct 560 ms 31796 KB Output is correct
27 Correct 556 ms 31296 KB Output is correct
28 Correct 547 ms 33916 KB Output is correct
29 Correct 591 ms 35200 KB Output is correct
30 Correct 573 ms 31996 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 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 340 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 3 ms 468 KB Output is correct
52 Correct 3 ms 472 KB Output is correct
53 Correct 3 ms 468 KB Output is correct
54 Correct 4 ms 468 KB Output is correct
55 Correct 3 ms 468 KB Output is correct
56 Correct 4 ms 468 KB Output is correct
57 Correct 3 ms 468 KB Output is correct
58 Correct 4 ms 468 KB Output is correct
59 Correct 3 ms 468 KB Output is correct
60 Correct 4 ms 464 KB Output is correct
61 Correct 557 ms 30656 KB Output is correct
62 Correct 553 ms 32188 KB Output is correct
63 Correct 549 ms 30724 KB Output is correct
64 Correct 587 ms 32860 KB Output is correct
65 Correct 589 ms 33448 KB Output is correct
66 Correct 556 ms 32548 KB Output is correct
67 Correct 560 ms 30808 KB Output is correct
68 Correct 617 ms 33144 KB Output is correct
69 Correct 595 ms 34088 KB Output is correct
70 Correct 563 ms 34592 KB Output is correct