oj.uz

Submission #241115

# Submission time Handle Problem Language Result Execution time Memory
241115 2020-06-22T18:28:07 Z Jorge213 K blocks (IZhO14_blocks) C++14
0 / 100
 30 ms 45568 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int K = 105;
int n, k, dp[N][K], a[N], mx[N][K];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	cin >> n >> k;

	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}

	memset(dp, 1, sizeof dp);

	dp[1][1] = a[1];
	mx[1][1] = a[1];
	for (int i = 2; i <= n; i++) {
		for (int j = 1; j <= min(k, i); j++) {
			int can1 = dp[i - 1][j];
			if (mx[i - 1][j] < a[i]) {
				can1 = dp[i - 1][j] - mx[i - 1][j] + a[i];
			}

			int can2 = INT_MAX;
			if (j > 1) {
				can2 = dp[i - 1][j - 1] + a[i];
			}

			if (can1 < can2) {
				dp[i][j] = can1;
				mx[i][j] = max(mx[i - 1][j], a[i]);
			}
			else {
				dp[i][j] = can2;
				mx[i][j] = a[i];
			}
		}
	}

	cout << dp[n][k] << '\n';

	return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 41472 KB Output is correct
2 Correct 25 ms 41472 KB Output is correct
3 Correct 23 ms 41472 KB Output is correct
4 Correct 24 ms 41472 KB Output is correct
5 Correct 25 ms 41472 KB Output is correct
6 Correct 24 ms 41464 KB Output is correct
7 Correct 25 ms 41472 KB Output is correct
8 Correct 23 ms 41472 KB Output is correct
9 Correct 24 ms 41472 KB Output is correct
10 Correct 24 ms 41472 KB Output is correct
11 Incorrect 23 ms 41472 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

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

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 41472 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 45568 KB Output isn't correct
2 Halted 0 ms 0 KB -