oj.uz

Submission #955842

# Submission time Handle Problem Language Result Execution time Memory
955842 2024-03-31T15:08:26 Z gaoxam123 K blocks (IZhO14_blocks) C++14
0 / 100
 16 ms 41664 KB 
// https://oj.uz/problem/view/IZhO14_blocks
#include <bits/stdc++.h>
using namespace std;

int N, K;
int a[100005], dp[105][100005];

int main() {
    cin >> N >> K;
    memset(dp, 1000000, sizeof(dp));
    for(int i = 1; i <= N; i ++) {
        cin >> a[i];
    }
    // THIS VERSION IS NOT OPTIMIZED, BUT WORKS PROPERLY
    for(int i = 1; i <= K; i ++) {
        for(int j = i; j <= N; j ++) {
            if(i == 1) {
                if(j == 1) {
                    dp[i][j] = a[j];
                }
                else {
                    dp[i][j] = max(dp[i][j - 1], a[j]);
                }
            }
            else if(i == j) {
                dp[i][j] = dp[i - 1][j - 1] + a[j];
            }
            else {
                int mx = a[j];
                for(int k = j - 1; k >= i; k --) {
                    dp[i][j] = min(dp[i][j], dp[i - 1][k] + mx);
                    mx = max(mx, a[k]);
                }
            }       
        }
    }
    cout << dp[K][N];
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 41564 KB Output is correct
2 Correct 9 ms 41564 KB Output is correct
3 Correct 7 ms 41624 KB Output is correct
4 Correct 6 ms 41564 KB Output is correct
5 Correct 6 ms 41584 KB Output is correct
6 Correct 6 ms 41564 KB Output is correct
7 Correct 6 ms 41564 KB Output is correct
8 Correct 6 ms 41664 KB Output is correct
9 Correct 7 ms 41564 KB Output is correct
10 Correct 7 ms 41560 KB Output is correct
11 Incorrect 6 ms 41564 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 41632 KB Output is correct
2 Correct 5 ms 41564 KB Output is correct
3 Correct 6 ms 41564 KB Output is correct
4 Correct 6 ms 41564 KB Output is correct
5 Correct 6 ms 41624 KB Output is correct
6 Correct 6 ms 41564 KB Output is correct
7 Correct 6 ms 41564 KB Output is correct
8 Correct 6 ms 41564 KB Output is correct
9 Correct 6 ms 41564 KB Output is correct
10 Correct 6 ms 41564 KB Output is correct
11 Incorrect 6 ms 41564 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 41564 KB Output is correct
2 Correct 9 ms 41564 KB Output is correct
3 Correct 7 ms 41624 KB Output is correct
4 Correct 6 ms 41564 KB Output is correct
5 Correct 6 ms 41584 KB Output is correct
6 Correct 6 ms 41564 KB Output is correct
7 Correct 6 ms 41564 KB Output is correct
8 Correct 6 ms 41664 KB Output is correct
9 Correct 7 ms 41564 KB Output is correct
10 Correct 7 ms 41560 KB Output is correct
11 Incorrect 6 ms 41564 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 41564 KB Output is correct
2 Correct 9 ms 41564 KB Output is correct
3 Correct 7 ms 41624 KB Output is correct
4 Correct 6 ms 41564 KB Output is correct
5 Correct 6 ms 41584 KB Output is correct
6 Correct 6 ms 41564 KB Output is correct
7 Correct 6 ms 41564 KB Output is correct
8 Correct 6 ms 41664 KB Output is correct
9 Correct 7 ms 41564 KB Output is correct
10 Correct 7 ms 41560 KB Output is correct
11 Incorrect 6 ms 41564 KB Output isn't correct
12 Halted 0 ms 0 KB -