oj.uz

Submission #1092519

# Submission time Handle Problem Language Result Execution time Memory
1092519 2024-09-24T10:01:39 Z K30_Thua_Phong K blocks (IZhO14_blocks) C++17
53 / 100
 1000 ms 12136 KB 
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
using namespace std;
const int N = 100005;
ll n, k, amax = 0;
ll a[N + 2], dp[N + 2][150];
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    //freopen("blocks.inp", "r", stdin);
    //freopen("blocks.out", "w", stdout);
    cin >> n >> k;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        dp[i][1] = max(dp[i - 1][1], a[i]);
    }
    for(int i = 1; i <= n; i++)
    {
        for(int d = 2; d <= k; d++)
            dp[i][d] = INT_MAX;
    }
    for(int d = 2; d <= k; d++)
    {
        for(int i = d; i <= n; i++)
        {
            amax = a[i];
            for(int j = i - 1; j >= d - 1; j--) {
                dp[i][d] = min(dp[i][d], dp[j][d - 1] + amax);
                amax = max(amax, a[j]);
            }
        }
    }
    cout << dp[n][k];
    return 0;
}
/*
5 2
1 2 3 4 5
*/

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 360 KB Output is correct
8 Correct 0 ms 360 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 0 ms 360 KB Output is correct
11 Correct 0 ms 360 KB Output is correct
12 Correct 0 ms 360 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 0 ms 360 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 0 ms 360 KB Output is correct
19 Correct 0 ms 360 KB Output is correct
20 Correct 0 ms 360 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 360 KB Output is correct
26 Correct 0 ms 360 KB Output is correct
27 Correct 0 ms 360 KB Output is correct
28 Correct 0 ms 360 KB Output is correct
29 Correct 0 ms 360 KB Output is correct
30 Correct 0 ms 360 KB Output is correct
31 Correct 0 ms 360 KB Output is correct
32 Correct 1 ms 360 KB Output is correct
33 Correct 1 ms 360 KB Output is correct
34 Correct 0 ms 360 KB Output is correct
35 Correct 0 ms 360 KB Output is correct
36 Correct 0 ms 360 KB Output is correct
37 Correct 0 ms 360 KB Output is correct
38 Correct 0 ms 360 KB Output is correct
39 Correct 1 ms 360 KB Output is correct
40 Correct 0 ms 360 KB Output is correct
41 Correct 0 ms 360 KB Output is correct
42 Correct 1 ms 476 KB Output is correct
43 Correct 1 ms 360 KB Output is correct
44 Correct 0 ms 360 KB Output is correct
45 Correct 0 ms 360 KB Output is correct
46 Correct 0 ms 360 KB Output is correct
47 Correct 0 ms 360 KB Output is correct
48 Correct 1 ms 472 KB Output is correct
49 Correct 0 ms 360 KB Output is correct
50 Correct 0 ms 360 KB Output is correct
51 Correct 0 ms 360 KB Output is correct
52 Correct 1 ms 360 KB Output is correct
53 Correct 1 ms 360 KB Output is correct
54 Correct 1 ms 612 KB Output is correct
55 Correct 1 ms 360 KB Output is correct
56 Correct 0 ms 360 KB Output is correct
57 Correct 0 ms 360 KB Output is correct

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 360 KB Output is correct
26 Correct 0 ms 360 KB Output is correct
27 Correct 0 ms 360 KB Output is correct
28 Correct 0 ms 360 KB Output is correct
29 Correct 0 ms 360 KB Output is correct
30 Correct 0 ms 360 KB Output is correct
31 Correct 0 ms 360 KB Output is correct
32 Correct 1 ms 360 KB Output is correct
33 Correct 1 ms 360 KB Output is correct
34 Correct 0 ms 360 KB Output is correct
35 Correct 0 ms 360 KB Output is correct
36 Correct 0 ms 360 KB Output is correct
37 Correct 0 ms 360 KB Output is correct
38 Correct 0 ms 360 KB Output is correct
39 Correct 1 ms 360 KB Output is correct
40 Correct 0 ms 360 KB Output is correct
41 Correct 0 ms 360 KB Output is correct
42 Correct 1 ms 476 KB Output is correct
43 Correct 1 ms 360 KB Output is correct
44 Correct 0 ms 360 KB Output is correct
45 Correct 0 ms 360 KB Output is correct
46 Correct 0 ms 360 KB Output is correct
47 Correct 0 ms 360 KB Output is correct
48 Correct 1 ms 472 KB Output is correct
49 Correct 0 ms 360 KB Output is correct
50 Correct 0 ms 360 KB Output is correct
51 Correct 0 ms 360 KB Output is correct
52 Correct 1 ms 360 KB Output is correct
53 Correct 1 ms 360 KB Output is correct
54 Correct 1 ms 612 KB Output is correct
55 Correct 1 ms 360 KB Output is correct
56 Correct 0 ms 360 KB Output is correct
57 Correct 0 ms 360 KB Output is correct
58 Execution timed out 1045 ms 12136 KB Time limit exceeded
59 Halted 0 ms 0 KB -