Submission #895062

# Submission time Handle Problem Language Result Execution time Memory
895062 2023-12-29T11:28:11 Z MongHwa None (JOI16_ho_t1) C++17
100 / 100
110 ms 2508 KB
#include <iostream>
#include <cstring>
using namespace std;

#define ll long long
#define INF 1e16

int n, m, k;
ll arr[20001], dp[20001];

ll go(int pos)
{
	if(pos == n)
		return 0;

	ll& ret = dp[pos];
	if(ret != -1)
		return ret;

	ret = INF;
	ll mx = arr[pos], mn = arr[pos];
	for(int i = pos; i < min(n, pos+m); i++)
	{
		mx = max(mx, arr[i]);
		mn = min(mn, arr[i]);
		ret = min(ret, (i-pos+1)*(mx-mn)+k + go(i+1));
	}

	return ret;
}

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

	memset(dp, -1, sizeof(dp));

	cin >> n >> m >> k;
	for(int i = 0; i < n; i++)
		cin >> arr[i];

	cout << go(0) << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 616 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 616 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 624 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 804 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 636 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 616 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 616 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 624 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 2 ms 804 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 636 KB Output is correct
25 Correct 2 ms 600 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 2 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 49 ms 2504 KB Output is correct
32 Correct 49 ms 2452 KB Output is correct
33 Correct 110 ms 2392 KB Output is correct
34 Correct 94 ms 2396 KB Output is correct
35 Correct 48 ms 2504 KB Output is correct
36 Correct 93 ms 2500 KB Output is correct
37 Correct 92 ms 2392 KB Output is correct
38 Correct 106 ms 2508 KB Output is correct
39 Correct 93 ms 2504 KB Output is correct
40 Correct 86 ms 2396 KB Output is correct
41 Correct 48 ms 2284 KB Output is correct
42 Correct 108 ms 2392 KB Output is correct
43 Correct 50 ms 2396 KB Output is correct
44 Correct 74 ms 2492 KB Output is correct
45 Correct 57 ms 2392 KB Output is correct