oj.uz

Submission #53387

# Submission time Handle Problem Language Result Execution time Memory
53387 2018-06-29T16:28:20 Z MatheusLealV K blocks (IZhO14_blocks) C++17
0 / 100
 75 ms 95428 KB 
#include <bits/stdc++.h>
#define N 100010
#define K 110
#define inf 200000000000000000LL
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;

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++)
	{
		stack < pii > W;

		for(int i = 1; i <= n; i++)
		{
			ll opt = dp[i - 1][q - 1];

			while(!W.empty() and W.top().f < v[i])
			{
				opt = min(opt, W.top().s);

				W.pop();
			}

			if(W.empty() or opt + v[i] < W.top().f + W.top().s) W.push({v[i], opt});

			dp[i][k] = W.top().f + W.top().s;
		}
	}

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

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 86392 KB Output is correct
2 Correct 61 ms 86500 KB Output is correct
3 Correct 60 ms 86576 KB Output is correct
4 Correct 61 ms 86712 KB Output is correct
5 Correct 69 ms 86712 KB Output is correct
6 Correct 61 ms 86712 KB Output is correct
7 Correct 62 ms 86712 KB Output is correct
8 Correct 67 ms 86712 KB Output is correct
9 Incorrect 64 ms 86712 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 86712 KB Output is correct
2 Correct 62 ms 86784 KB Output is correct
3 Correct 74 ms 86792 KB Output is correct
4 Correct 66 ms 86792 KB Output is correct
5 Correct 60 ms 86792 KB Output is correct
6 Correct 62 ms 86792 KB Output is correct
7 Correct 63 ms 86792 KB Output is correct
8 Correct 62 ms 86792 KB Output is correct
9 Incorrect 61 ms 86792 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 61 ms 86792 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 95428 KB Output isn't correct
2 Halted 0 ms 0 KB -