oj.uz

답안 #119735

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
119735 2019-06-22T05:23:35 Z dolphingarlic K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 721 ms 80664 KB 
#include <bits/stdc++.h>

using namespace std;

stack<int> s;

int main() {
    int n, k;
    cin >> n >> k;
    int arr[n + 1];
    for (int i = 1; i <= n; ++i) cin >> arr[i];
    int dp[n + 1][k + 1];
    int chosen[n + 1][k + 1];
    dp[0][1] = 0;
    for (int i = 1; i <= n; ++i)
        dp[i][1] = max(arr[i], dp[i - 1][1]), chosen[i][1] = dp[i][1];
    for (int j = 2; j <= k; ++j) {
        while (s.size() > 0) s.pop();
        for (int i = j; i <= n; ++i) {
            dp[i][j] = dp[i - 1][j - 1] + arr[i];
            chosen[i][j] = arr[i];
            while (s.size() > 0) {
                int idx = s.top();
                if (arr[idx] <= arr[i]) {
                    if (dp[idx][j] - chosen[idx][j] +
                            max(chosen[idx][j], arr[i]) <
                        dp[i][j]) {
                        dp[i][j] = dp[idx][j] - chosen[idx][j] +
                                   max(chosen[idx][j], arr[i]);
                    }
                    s.pop();
                } else
                    break;
            }
            if (s.size() > 0) {
                int idx = s.top();
                if (dp[idx][j] < dp[i][j]) {
                    dp[i][j] = dp[idx][j];
                    chosen[i][j] = chosen[idx][j];
                }
            }
            s.push(i);
        }
    }
    cout << dp[n][k] << '\n';
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 2432 KB Output is correct
2 Correct 18 ms 1536 KB Output is correct
3 Correct 22 ms 3704 KB Output is correct
4 Correct 125 ms 27632 KB Output is correct
5 Correct 658 ms 80396 KB Output is correct
6 Correct 39 ms 4472 KB Output is correct
7 Correct 275 ms 37448 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 43 ms 8320 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 12 ms 2432 KB Output is correct
17 Correct 17 ms 1536 KB Output is correct
18 Correct 24 ms 3584 KB Output is correct
19 Correct 150 ms 27612 KB Output is correct
20 Correct 695 ms 80536 KB Output is correct
21 Correct 40 ms 4644 KB Output is correct
22 Correct 287 ms 37496 KB Output is correct
23 Correct 35 ms 2936 KB Output is correct
24 Correct 60 ms 9976 KB Output is correct
25 Correct 705 ms 80532 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 33 ms 8320 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 11 ms 2560 KB Output is correct
31 Correct 17 ms 1528 KB Output is correct
32 Correct 24 ms 3704 KB Output is correct
33 Correct 116 ms 27696 KB Output is correct
34 Correct 721 ms 80664 KB Output is correct
35 Correct 41 ms 4728 KB Output is correct
36 Correct 273 ms 37624 KB Output is correct
37 Correct 6 ms 640 KB Output is correct
38 Correct 30 ms 8320 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 3 ms 384 KB Output is correct