oj.uz

Submission #53372

# Submission time Handle Problem Language Result Execution time Memory
53372 2018-06-29T15:18:40 Z MatheusLealV K blocks (IZhO14_blocks) C++17
0 / 100
 83 ms 95476 KB 
#include <bits/stdc++.h>
#define N 100010
#define K 110
#define inf 200000000000000000LL
using namespace std;
typedef long long ll;

ll n, k, v[N], pref[N], dp[N][K], best[N][K];

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

	cin>>n>>k;

	for(int i = 1; i <= n; i++) cin>>v[i];

	for(int i = 0; i < N; i++)
		for(int j = 0; j < K; j++)
			dp[i][j] = inf;

	dp[0][1] = 0;

	for(int i = 1; i <= n; i++)
	{
		dp[i][1] = max(dp[i - 1][1], v[i]);

		best[i][1] = dp[i][1];

		pref[i] = pref[i - 1] + v[i];
	}

	dp[0][0] = 0;

	dp[0][1] = inf;

	for(int q = 2; q <= k; q++)
	{
		for(int i = 1; i <= n; i++)
		{
			/*ll maior = v[i];

			for(int j = i; j >= 1; j--)
			{
				maior = max(maior, v[j]);

				dp[i][q] = min(dp[i][q], dp[j - 1][q - 1] + maior);
			}
			if(i < q) dp[i][q] = inf;

			if(i == q)
			{
				dp[i][q] = pref[i];

				best[i][q] = v[i];

				continue;
			}*/

			ll A = dp[i - 1][q] + max(v[i] - best[i - 1][q], 0LL);

			ll B = dp[i - 1][q - 1] + v[i];

			if(A < B or (A == B and max(v[i], best[i - 1][q]) >= v[i])) best[i][q] = max(v[i], best[i - 1][q]);

			else best[i][q] = v[i];

			dp[i][q] = min(A, B);
		}
	}

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

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 86520 KB Output is correct
2 Correct 83 ms 86620 KB Output is correct
3 Correct 67 ms 86620 KB Output is correct
4 Correct 63 ms 86620 KB Output is correct
5 Correct 64 ms 86620 KB Output is correct
6 Correct 62 ms 86620 KB Output is correct
7 Correct 61 ms 86620 KB Output is correct
8 Correct 59 ms 86680 KB Output is correct
9 Correct 72 ms 86680 KB Output is correct
10 Correct 76 ms 86680 KB Output is correct
11 Incorrect 61 ms 86684 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 86684 KB Output is correct
2 Correct 60 ms 86684 KB Output is correct
3 Correct 64 ms 86684 KB Output is correct
4 Correct 67 ms 86812 KB Output is correct
5 Correct 64 ms 86892 KB Output is correct
6 Correct 59 ms 86892 KB Output is correct
7 Correct 69 ms 86892 KB Output is correct
8 Correct 69 ms 86892 KB Output is correct
9 Correct 62 ms 86892 KB Output is correct
10 Correct 62 ms 86892 KB Output is correct
11 Incorrect 64 ms 86892 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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