oj.uz

답안 #745184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
745184 2023-05-19T14:19:29 Z Desh03 K개의 묶음 (IZhO14_blocks) C++17
53 / 100
 1000 ms 2388 KB 
#include <bits/stdc++.h>
using namespace std;

struct segtree {
    vector<int> st;
    int sz;
    void init(int n) {
        sz = n;
        st.resize(sz << 1);
    }
    void upd(int u, int x) {
        for (st[u += sz] = x; u >>= 1;) st[u] = max(st[u << 1], st[u << 1 | 1]);
    }
    int qry(int l, int r) {
        int mx = 0;
        for (l += sz, r += sz + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) mx = max(mx, st[l++]);
            if (r & 1) mx = max(mx, st[--r]);
        }
        return mx;
    }
} st;

vector<vector<long long>> dp;
int n;

void dnc(int k, int l, int r, int optl, int optr) {
    if (l > r) return;
    int mid = l + r >> 1;
    int opt = -1;
    for (int j = 0; j <= mid - 1; j++) {
        int mx = st.qry(j + 1, mid);
        if (dp[k][mid] > dp[k - 1][j] + mx)
            dp[k][mid] = dp[k - 1][j] + mx, opt = j;
    }
    dnc(k, l, mid - 1, optl, opt == -1 ? mid - 2 : opt);
    dnc(k, mid + 1, r, opt == -1 ? 0 : opt, optr);
}

int main() {
    int k, x;
    cin >> n >> k;
    st.init(n);
    dp = vector<vector<long long>> (k, vector<long long> (n, 1e18));
    for (int i = 0; i < n; i++) cin >> x, st.upd(i, x);
    for (int i = 0; i < n; i++) dp[0][i] = st.qry(0, i);
    for (int i = 1; i < k; i++) dnc(i, 0, n - 1, 0, n - 2);
    cout << dp[k - 1][n - 1] << '\n';
}

Compilation message

blocks.cpp: In function 'void dnc(int, int, int, int, int)':
blocks.cpp:29:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 296 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 300 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 296 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 9 ms 340 KB Output is correct
40 Correct 1 ms 296 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 304 KB Output is correct
49 Correct 1 ms 296 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 4 ms 212 KB Output is correct
52 Correct 4 ms 300 KB Output is correct
53 Correct 14 ms 340 KB Output is correct
54 Correct 15 ms 388 KB Output is correct
55 Correct 8 ms 340 KB Output is correct
56 Correct 13 ms 384 KB Output is correct
57 Correct 15 ms 340 KB Output is correct

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 296 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 300 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 296 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 9 ms 340 KB Output is correct
40 Correct 1 ms 296 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 304 KB Output is correct
49 Correct 1 ms 296 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 4 ms 212 KB Output is correct
52 Correct 4 ms 300 KB Output is correct
53 Correct 14 ms 340 KB Output is correct
54 Correct 15 ms 388 KB Output is correct
55 Correct 8 ms 340 KB Output is correct
56 Correct 13 ms 384 KB Output is correct
57 Correct 15 ms 340 KB Output is correct
58 Execution timed out 1069 ms 2388 KB Time limit exceeded
59 Halted 0 ms 0 KB -