oj.uz

답안 #614176

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
614176 2022-07-30T21:08:23 Z tvladm K개의 묶음 (IZhO14_blocks) C++14
53 / 100
 240 ms 262144 KB 
#include <iostream>
#include <stack>

using namespace std;

const int MAX_N = 1e5;
const int MAX_K = 1e3;
const int MAX_L = 17;
const int INF = (1 << 30);
int a[MAX_N + 1], l[MAX_N + 1];
int dp[MAX_N + 1][MAX_K + 1], rmq[MAX_L + 1][MAX_N + 1], log[MAX_N + 1];
int n, k;

void precalc() {
    stack<int> st;
    for (int i = 1; i <= n; i++) {
        while (!st.empty() && a[i] >= a[st.top()]) {
            st.pop();
        }
        if (st.empty()) {
            l[i] = 0;
        } else {
            l[i] = st.top();
        }
        st.push(i);
    }
}

void build()  {
    for (int i = 1; i <= MAX_L; i++) {
        for (int j = 1; j <= n; j++) {
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
        }
    }
}

int query(int l, int r) {
    int p = log[r - l + 1];
    return min(rmq[p][l], rmq[p][r - (1 << p) + 1]);
}

int main() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            dp[i][j] = INF;
        }
    }
    int mx = 0;
    for (int i = 1; i <= n; i++) {
        mx = max(mx, a[i]);
        dp[i][1] = mx;
    }
    precalc();
    for (int i = 2; i <= MAX_N; i++) {
        log[i] = log[i >> 1] + 1;
    }
    for (int blocks = 2; blocks <= k; blocks++) {
        for (int i = 1; i <= n; i++) {
            rmq[0][i] = dp[i][blocks - 1];
        }
        build();
        for (int i = blocks; i <= n; i++) {
            if (l[i] == 0) {
                dp[i][blocks] = a[i] + query(1, i - 1);
            } else {
                dp[i][blocks] = min(dp[l[i]][blocks], a[i] + query(l[i], i - 1));
            }
        }
    }
    cout << dp[n][k];
    return 0;
}

Compilation message

blocks.cpp:11:58: warning: built-in function 'log' declared as non-function [-Wbuiltin-declaration-mismatch]
   11 | int dp[MAX_N + 1][MAX_K + 1], rmq[MAX_L + 1][MAX_N + 1], log[MAX_N + 1];
      |                                                          ^~~

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 688 KB Output is correct
4 Correct 1 ms 688 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 692 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 820 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 1072 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 692 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 824 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 1 ms 852 KB Output is correct
35 Correct 1 ms 820 KB Output is correct
36 Correct 1 ms 852 KB Output is correct
37 Correct 1 ms 852 KB Output is correct
38 Correct 1 ms 852 KB Output is correct
39 Correct 1 ms 1080 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 1 ms 688 KB Output is correct
42 Correct 1 ms 724 KB Output is correct
43 Correct 1 ms 724 KB Output is correct
44 Correct 1 ms 724 KB Output is correct
45 Correct 1 ms 692 KB Output is correct
46 Correct 1 ms 724 KB Output is correct
47 Correct 1 ms 824 KB Output is correct
48 Correct 1 ms 724 KB Output is correct
49 Correct 1 ms 816 KB Output is correct
50 Correct 1 ms 824 KB Output is correct
51 Correct 1 ms 1072 KB Output is correct
52 Correct 1 ms 1108 KB Output is correct
53 Correct 1 ms 1108 KB Output is correct
54 Correct 1 ms 1108 KB Output is correct
55 Correct 1 ms 1108 KB Output is correct
56 Correct 1 ms 1108 KB Output is correct
57 Correct 1 ms 1108 KB Output is correct

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 688 KB Output is correct
4 Correct 1 ms 688 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 692 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 820 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 1072 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 692 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 824 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 1 ms 852 KB Output is correct
35 Correct 1 ms 820 KB Output is correct
36 Correct 1 ms 852 KB Output is correct
37 Correct 1 ms 852 KB Output is correct
38 Correct 1 ms 852 KB Output is correct
39 Correct 1 ms 1080 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 1 ms 688 KB Output is correct
42 Correct 1 ms 724 KB Output is correct
43 Correct 1 ms 724 KB Output is correct
44 Correct 1 ms 724 KB Output is correct
45 Correct 1 ms 692 KB Output is correct
46 Correct 1 ms 724 KB Output is correct
47 Correct 1 ms 824 KB Output is correct
48 Correct 1 ms 724 KB Output is correct
49 Correct 1 ms 816 KB Output is correct
50 Correct 1 ms 824 KB Output is correct
51 Correct 1 ms 1072 KB Output is correct
52 Correct 1 ms 1108 KB Output is correct
53 Correct 1 ms 1108 KB Output is correct
54 Correct 1 ms 1108 KB Output is correct
55 Correct 1 ms 1108 KB Output is correct
56 Correct 1 ms 1108 KB Output is correct
57 Correct 1 ms 1108 KB Output is correct
58 Correct 26 ms 40788 KB Output is correct
59 Correct 79 ms 175408 KB Output is correct
60 Correct 99 ms 178676 KB Output is correct
61 Correct 240 ms 178592 KB Output is correct
62 Runtime error 129 ms 262144 KB Execution killed with signal 9
63 Halted 0 ms 0 KB -