oj.uz

Submission #971501

# Submission time Handle Problem Language Result Execution time Memory
971501 2024-04-28T16:56:03 Z njoop K blocks (IZhO14_blocks) C++14
0 / 100
 39 ms 86872 KB 
#include <bits/stdc++.h>

using namespace std;

int n, k, arr[100010];
pair<int, int> dp[100010][110];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k;
    for(int i=1; i<=n; i++) {
        cin >> arr[i];
    }
    for(int i=0; i<100010; i++) {
        for(int j=0; j<110; j++) {
            dp[i][j] = {1e9, 1e9};
        }
    }
    dp[1][1] = {arr[1], arr[1]};
    for(int i=1; i<n; i++) {
        for(int j=1; j<=k; j++) {
            if(dp[i+1][j+1].first > dp[i][j].first + arr[i+1]) {
                dp[i+1][j+1].first = dp[i][j].first + arr[i+1];
                dp[i+1][j+1].second = arr[i+1];
            }
            if(dp[i+1][j].first > dp[i][j].first) {
                dp[i+1][j].first = dp[i][j].first;
                if(dp[i][j].second < arr[i+1]) {
                    dp[i+1][j].first += arr[i+1] - dp[i][j].second;
                    dp[i][j].second = arr[i+1];
                }
            }
        }
    }
    cout << dp[n][k].first;
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 86608 KB Output is correct
2 Correct 32 ms 86616 KB Output is correct
3 Correct 32 ms 86608 KB Output is correct
4 Correct 31 ms 86612 KB Output is correct
5 Correct 30 ms 86872 KB Output is correct
6 Correct 39 ms 86640 KB Output is correct
7 Correct 31 ms 86620 KB Output is correct
8 Correct 31 ms 86804 KB Output is correct
9 Correct 31 ms 86608 KB Output is correct
10 Correct 32 ms 86608 KB Output is correct
11 Incorrect 31 ms 86612 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 86728 KB Output is correct
2 Correct 37 ms 86608 KB Output is correct
3 Correct 32 ms 86732 KB Output is correct
4 Correct 30 ms 86612 KB Output is correct
5 Correct 31 ms 86612 KB Output is correct
6 Correct 30 ms 86620 KB Output is correct
7 Correct 31 ms 86760 KB Output is correct
8 Correct 32 ms 86620 KB Output is correct
9 Correct 32 ms 86608 KB Output is correct
10 Correct 30 ms 86612 KB Output is correct
11 Incorrect 31 ms 86608 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 86608 KB Output is correct
2 Correct 32 ms 86616 KB Output is correct
3 Correct 32 ms 86608 KB Output is correct
4 Correct 31 ms 86612 KB Output is correct
5 Correct 30 ms 86872 KB Output is correct
6 Correct 39 ms 86640 KB Output is correct
7 Correct 31 ms 86620 KB Output is correct
8 Correct 31 ms 86804 KB Output is correct
9 Correct 31 ms 86608 KB Output is correct
10 Correct 32 ms 86608 KB Output is correct
11 Incorrect 31 ms 86612 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 86608 KB Output is correct
2 Correct 32 ms 86616 KB Output is correct
3 Correct 32 ms 86608 KB Output is correct
4 Correct 31 ms 86612 KB Output is correct
5 Correct 30 ms 86872 KB Output is correct
6 Correct 39 ms 86640 KB Output is correct
7 Correct 31 ms 86620 KB Output is correct
8 Correct 31 ms 86804 KB Output is correct
9 Correct 31 ms 86608 KB Output is correct
10 Correct 32 ms 86608 KB Output is correct
11 Incorrect 31 ms 86612 KB Output isn't correct
12 Halted 0 ms 0 KB -