oj.uz

답안 #285411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
285411 2020-08-28T22:32:18 Z loideptrai1 K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 280 ms 42856 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

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 41472 KB Output is correct
2 Correct 25 ms 41472 KB Output is correct
3 Correct 24 ms 41472 KB Output is correct
4 Correct 24 ms 41472 KB Output is correct
5 Correct 25 ms 41472 KB Output is correct
6 Correct 24 ms 41472 KB Output is correct
7 Correct 25 ms 41468 KB Output is correct
8 Correct 24 ms 41472 KB Output is correct
9 Correct 25 ms 41472 KB Output is correct
10 Correct 28 ms 41472 KB Output is correct
11 Correct 25 ms 41472 KB Output is correct
12 Correct 25 ms 41472 KB Output is correct
13 Correct 24 ms 41464 KB Output is correct
14 Correct 24 ms 41472 KB Output is correct
15 Correct 24 ms 41472 KB Output is correct
16 Correct 24 ms 41464 KB Output is correct
17 Correct 24 ms 41472 KB Output is correct
18 Correct 24 ms 41464 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 41472 KB Output is correct
2 Correct 26 ms 41400 KB Output is correct
3 Correct 24 ms 41464 KB Output is correct
4 Correct 25 ms 41472 KB Output is correct
5 Correct 25 ms 41472 KB Output is correct
6 Correct 24 ms 41464 KB Output is correct
7 Correct 24 ms 41472 KB Output is correct
8 Correct 24 ms 41472 KB Output is correct
9 Correct 25 ms 41472 KB Output is correct
10 Correct 25 ms 41472 KB Output is correct
11 Correct 24 ms 41464 KB Output is correct
12 Correct 25 ms 41472 KB Output is correct
13 Correct 24 ms 41464 KB Output is correct
14 Correct 25 ms 41472 KB Output is correct
15 Correct 24 ms 41472 KB Output is correct
16 Correct 24 ms 41464 KB Output is correct
17 Correct 24 ms 41472 KB Output is correct
18 Correct 24 ms 41472 KB Output is correct
19 Correct 25 ms 41464 KB Output is correct
20 Correct 24 ms 41464 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 41464 KB Output is correct
2 Correct 24 ms 41472 KB Output is correct
3 Correct 24 ms 41472 KB Output is correct
4 Correct 24 ms 41464 KB Output is correct
5 Correct 25 ms 41472 KB Output is correct
6 Correct 25 ms 41464 KB Output is correct
7 Correct 24 ms 41472 KB Output is correct
8 Correct 25 ms 41464 KB Output is correct
9 Correct 24 ms 41472 KB Output is correct
10 Correct 25 ms 41592 KB Output is correct
11 Correct 24 ms 41388 KB Output is correct
12 Correct 24 ms 41464 KB Output is correct
13 Correct 25 ms 41472 KB Output is correct
14 Correct 24 ms 41472 KB Output is correct
15 Correct 24 ms 41420 KB Output is correct
16 Correct 26 ms 41472 KB Output is correct
17 Correct 24 ms 41472 KB Output is correct
18 Correct 25 ms 41472 KB Output is correct
19 Correct 24 ms 41472 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 41472 KB Output is correct
2 Correct 52 ms 41848 KB Output is correct
3 Correct 55 ms 41976 KB Output is correct
4 Correct 91 ms 41848 KB Output is correct
5 Correct 202 ms 42476 KB Output is correct
6 Correct 89 ms 42488 KB Output is correct
7 Correct 142 ms 42488 KB Output is correct
8 Correct 24 ms 41472 KB Output is correct
9 Correct 25 ms 41472 KB Output is correct
10 Correct 24 ms 41472 KB Output is correct
11 Correct 28 ms 41464 KB Output is correct
12 Correct 25 ms 41472 KB Output is correct
13 Correct 27 ms 41472 KB Output is correct
14 Correct 47 ms 41464 KB Output is correct
15 Correct 31 ms 41472 KB Output is correct
16 Correct 35 ms 41464 KB Output is correct
17 Correct 52 ms 41976 KB Output is correct
18 Correct 58 ms 41848 KB Output is correct
19 Correct 105 ms 41848 KB Output is correct
20 Correct 245 ms 42488 KB Output is correct
21 Correct 89 ms 42488 KB Output is correct
22 Correct 158 ms 42488 KB Output is correct
23 Correct 86 ms 42492 KB Output is correct
24 Correct 102 ms 42480 KB Output is correct
25 Correct 280 ms 42488 KB Output is correct
26 Correct 25 ms 41464 KB Output is correct
27 Correct 25 ms 41472 KB Output is correct
28 Correct 43 ms 41592 KB Output is correct
29 Correct 31 ms 41592 KB Output is correct
30 Correct 34 ms 41592 KB Output is correct
31 Correct 52 ms 41848 KB Output is correct
32 Correct 55 ms 41976 KB Output is correct
33 Correct 102 ms 42068 KB Output is correct
34 Correct 240 ms 42832 KB Output is correct
35 Correct 89 ms 42836 KB Output is correct
36 Correct 148 ms 42856 KB Output is correct
37 Correct 30 ms 41564 KB Output is correct
38 Correct 53 ms 41464 KB Output is correct
39 Correct 25 ms 41472 KB Output is correct
40 Correct 25 ms 41464 KB Output is correct
41 Correct 26 ms 41472 KB Output is correct
42 Correct 24 ms 41468 KB Output is correct