oj.uz

답안 #156516

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
156516 2019-10-06T09:41:42 Z leson207 K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 199 ms 43388 KB 
#include <bits/stdc++.h>

using namespace std;

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

int a[N], 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 = 1; i <= n; ++i)
        for (L[i] = i - 1; L[i] && a[L[i]] <= a[i]; ) L[i] = L[L[i]];
    for (int i = 2; i <= k; ++i) {
        minF[i - 1] = INF;
        for (int j = i; j <= n; ++j) {
            minF[j] = dp[i - 1][j - 1];
            for (int t = j - 1; t > L[j]; t = L[t])
                minF[j] = min(minF[j], minF[t]);
            dp[i][j] = min(dp[i][L[j]], minF[j] + a[j]);
        }
    }
    cout << dp[k][n] << endl;
    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 41464 KB Output is correct
2 Correct 36 ms 41464 KB Output is correct
3 Correct 36 ms 41464 KB Output is correct
4 Correct 35 ms 41464 KB Output is correct
5 Correct 36 ms 41464 KB Output is correct
6 Correct 36 ms 41448 KB Output is correct
7 Correct 36 ms 41464 KB Output is correct
8 Correct 36 ms 41464 KB Output is correct
9 Correct 36 ms 41464 KB Output is correct
10 Correct 36 ms 41464 KB Output is correct
11 Correct 36 ms 41464 KB Output is correct
12 Correct 36 ms 41464 KB Output is correct
13 Correct 36 ms 41464 KB Output is correct
14 Correct 36 ms 41464 KB Output is correct
15 Correct 36 ms 41464 KB Output is correct
16 Correct 36 ms 41452 KB Output is correct
17 Correct 36 ms 41464 KB Output is correct
18 Correct 36 ms 41464 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 41492 KB Output is correct
2 Correct 36 ms 41520 KB Output is correct
3 Correct 38 ms 41384 KB Output is correct
4 Correct 36 ms 41464 KB Output is correct
5 Correct 36 ms 41452 KB Output is correct
6 Correct 36 ms 41464 KB Output is correct
7 Correct 36 ms 41464 KB Output is correct
8 Correct 36 ms 41464 KB Output is correct
9 Correct 35 ms 41464 KB Output is correct
10 Correct 36 ms 41464 KB Output is correct
11 Correct 36 ms 41436 KB Output is correct
12 Correct 35 ms 41464 KB Output is correct
13 Correct 36 ms 41464 KB Output is correct
14 Correct 35 ms 41464 KB Output is correct
15 Correct 36 ms 41464 KB Output is correct
16 Correct 36 ms 41464 KB Output is correct
17 Correct 36 ms 41464 KB Output is correct
18 Correct 36 ms 41464 KB Output is correct
19 Correct 36 ms 41464 KB Output is correct
20 Correct 36 ms 41468 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 41464 KB Output is correct
2 Correct 42 ms 41464 KB Output is correct
3 Correct 42 ms 41464 KB Output is correct
4 Correct 36 ms 41436 KB Output is correct
5 Correct 36 ms 41436 KB Output is correct
6 Correct 36 ms 41464 KB Output is correct
7 Correct 36 ms 41464 KB Output is correct
8 Correct 42 ms 41464 KB Output is correct
9 Correct 37 ms 41460 KB Output is correct
10 Correct 36 ms 41512 KB Output is correct
11 Correct 35 ms 41372 KB Output is correct
12 Correct 36 ms 41464 KB Output is correct
13 Correct 36 ms 41464 KB Output is correct
14 Correct 36 ms 41464 KB Output is correct
15 Correct 36 ms 41464 KB Output is correct
16 Correct 36 ms 41464 KB Output is correct
17 Correct 36 ms 41464 KB Output is correct
18 Correct 36 ms 41464 KB Output is correct
19 Correct 36 ms 41388 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 41592 KB Output is correct
2 Correct 62 ms 42100 KB Output is correct
3 Correct 66 ms 42276 KB Output is correct
4 Correct 89 ms 42232 KB Output is correct
5 Correct 177 ms 43388 KB Output is correct
6 Correct 95 ms 43128 KB Output is correct
7 Correct 135 ms 43304 KB Output is correct
8 Correct 36 ms 41464 KB Output is correct
9 Correct 35 ms 41464 KB Output is correct
10 Correct 36 ms 41364 KB Output is correct
11 Correct 36 ms 41464 KB Output is correct
12 Correct 37 ms 41464 KB Output is correct
13 Correct 37 ms 41436 KB Output is correct
14 Correct 51 ms 41652 KB Output is correct
15 Correct 42 ms 41728 KB Output is correct
16 Correct 44 ms 41720 KB Output is correct
17 Correct 61 ms 42108 KB Output is correct
18 Correct 64 ms 42236 KB Output is correct
19 Correct 97 ms 42232 KB Output is correct
20 Correct 198 ms 43384 KB Output is correct
21 Correct 96 ms 43256 KB Output is correct
22 Correct 143 ms 43200 KB Output is correct
23 Correct 93 ms 42872 KB Output is correct
24 Correct 103 ms 43256 KB Output is correct
25 Correct 199 ms 43336 KB Output is correct
26 Correct 36 ms 41448 KB Output is correct
27 Correct 36 ms 41464 KB Output is correct
28 Correct 49 ms 41592 KB Output is correct
29 Correct 42 ms 41592 KB Output is correct
30 Correct 50 ms 41592 KB Output is correct
31 Correct 61 ms 42104 KB Output is correct
32 Correct 64 ms 42204 KB Output is correct
33 Correct 88 ms 42232 KB Output is correct
34 Correct 177 ms 43256 KB Output is correct
35 Correct 99 ms 43364 KB Output is correct
36 Correct 128 ms 43256 KB Output is correct
37 Correct 42 ms 41592 KB Output is correct
38 Correct 49 ms 41592 KB Output is correct
39 Correct 36 ms 41464 KB Output is correct
40 Correct 37 ms 41592 KB Output is correct
41 Correct 36 ms 41464 KB Output is correct
42 Correct 38 ms 41464 KB Output is correct