oj.uz

Submission #272119

# Submission time Handle Problem Language Result Execution time Memory
272119 2020-08-18T09:19:12 Z HinS K blocks (IZhO14_blocks) C++14
100 / 100
 261 ms 42848 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;
const int K = 105;
const int INF = 0x3f3f3f3f;

int a[N];
int L[N], minF[N];
int dp[K][N];
int n, k;

int main() {
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    memset(dp, 0x3f, sizeof dp);
    dp[1][0] = 0;
    for (int i = 1; i <= n; ++i) dp[1][i] = max(dp[1][i - 1], a[i]);
    for (int i = 2; i <= k; ++i) {
        stack<pair<int, int> > S;
        for (int j = i; j <= n; ++j) {
            int minF = dp[i - 1][j - 1];
            while (!S.empty() && a[S.top().second] <= a[j]) {
                minF = min(minF, S.top().first);
                S.pop();
            }
            dp[i][j] = min(dp[i][S.empty() ? 0 : S.top().second], minF + a[j]);
            S.push(make_pair(minF, j));
        }
    }
    cout << dp[k][n] << endl;
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 41472 KB Output is correct
2 Correct 22 ms 41472 KB Output is correct
3 Correct 22 ms 41464 KB Output is correct
4 Correct 22 ms 41472 KB Output is correct
5 Correct 24 ms 41472 KB Output is correct
6 Correct 22 ms 41472 KB Output is correct
7 Correct 22 ms 41472 KB Output is correct
8 Correct 22 ms 41472 KB Output is correct
9 Correct 24 ms 41472 KB Output is correct
10 Correct 22 ms 41472 KB Output is correct
11 Correct 23 ms 41376 KB Output is correct
12 Correct 23 ms 41472 KB Output is correct
13 Correct 23 ms 41464 KB Output is correct
14 Correct 22 ms 41472 KB Output is correct
15 Correct 22 ms 41472 KB Output is correct
16 Correct 22 ms 41472 KB Output is correct
17 Correct 22 ms 41472 KB Output is correct
18 Correct 22 ms 41464 KB Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 41464 KB Output is correct
2 Correct 49 ms 41628 KB Output is correct
3 Correct 80 ms 41848 KB Output is correct
4 Correct 90 ms 41960 KB Output is correct
5 Correct 214 ms 42488 KB Output is correct
6 Correct 87 ms 42488 KB Output is correct
7 Correct 135 ms 42488 KB Output is correct
8 Correct 22 ms 41472 KB Output is correct
9 Correct 23 ms 41464 KB Output is correct
10 Correct 23 ms 41472 KB Output is correct
11 Correct 22 ms 41472 KB Output is correct
12 Correct 22 ms 41472 KB Output is correct
13 Correct 23 ms 41464 KB Output is correct
14 Correct 43 ms 41472 KB Output is correct
15 Correct 28 ms 41472 KB Output is correct
16 Correct 32 ms 41512 KB Output is correct
17 Correct 49 ms 41848 KB Output is correct
18 Correct 54 ms 41848 KB Output is correct
19 Correct 102 ms 41956 KB Output is correct
20 Correct 250 ms 42488 KB Output is correct
21 Correct 87 ms 42488 KB Output is correct
22 Correct 164 ms 42488 KB Output is correct
23 Correct 90 ms 42488 KB Output is correct
24 Correct 103 ms 42488 KB Output is correct
25 Correct 261 ms 42488 KB Output is correct
26 Correct 28 ms 41472 KB Output is correct
27 Correct 23 ms 41472 KB Output is correct
28 Correct 42 ms 41608 KB Output is correct
29 Correct 29 ms 41592 KB Output is correct
30 Correct 31 ms 41592 KB Output is correct
31 Correct 51 ms 41848 KB Output is correct
32 Correct 55 ms 42104 KB Output is correct
33 Correct 100 ms 42164 KB Output is correct
34 Correct 223 ms 42848 KB Output is correct
35 Correct 89 ms 42832 KB Output is correct
36 Correct 149 ms 42840 KB Output is correct
37 Correct 30 ms 41472 KB Output is correct
38 Correct 39 ms 41464 KB Output is correct
39 Correct 23 ms 41472 KB Output is correct
40 Correct 26 ms 41464 KB Output is correct
41 Correct 23 ms 41472 KB Output is correct
42 Correct 22 ms 41472 KB Output is correct