# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
930597 |
2024-02-20T07:39:39 Z |
ArgoCahaya |
Stove (JOI18_stove) |
C++14 |
|
8 ms |
16472 KB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3;
const int INF = 2e9;
int n, k;
int a[MAXN + 5];
int dp[MAXN + 5][MAXN + 5][2];
int f(int idx, int cnt, int state)
{
if (cnt > k)
return INF;
if (idx == n)
{
if (state == 1)
return 0;
else
{
if (cnt < k)
return 1;
return INF;
}
}
int &ret = dp[idx][cnt][state];
if (ret != -1)
return ret;
ret = INF;
if (state)
{
ret = min(ret, f(idx + 1, cnt, 1) + (a[idx + 1] - a[idx]));
ret = min(ret, f(idx + 1, cnt, 0) + (a[idx + 1] - a[idx]));
}
else
{
ret = min(ret, f(idx + 1, cnt + 1, 1) + 1);
ret = min(ret, f(idx + 1, cnt + 1, 0) + 1);
}
return ret;
}
int main()
{
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
cout << f(0, 0, 0) << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
8284 KB |
Output is correct |
2 |
Correct |
2 ms |
8284 KB |
Output is correct |
3 |
Correct |
2 ms |
8284 KB |
Output is correct |
4 |
Correct |
2 ms |
8284 KB |
Output is correct |
5 |
Correct |
2 ms |
8280 KB |
Output is correct |
6 |
Correct |
2 ms |
8284 KB |
Output is correct |
7 |
Correct |
2 ms |
8284 KB |
Output is correct |
8 |
Correct |
2 ms |
8284 KB |
Output is correct |
9 |
Correct |
2 ms |
8280 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
8284 KB |
Output is correct |
2 |
Correct |
2 ms |
8284 KB |
Output is correct |
3 |
Correct |
2 ms |
8284 KB |
Output is correct |
4 |
Correct |
2 ms |
8284 KB |
Output is correct |
5 |
Correct |
2 ms |
8280 KB |
Output is correct |
6 |
Correct |
2 ms |
8284 KB |
Output is correct |
7 |
Correct |
2 ms |
8284 KB |
Output is correct |
8 |
Correct |
2 ms |
8284 KB |
Output is correct |
9 |
Correct |
2 ms |
8280 KB |
Output is correct |
10 |
Runtime error |
8 ms |
16472 KB |
Execution killed with signal 11 |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
8284 KB |
Output is correct |
2 |
Correct |
2 ms |
8284 KB |
Output is correct |
3 |
Correct |
2 ms |
8284 KB |
Output is correct |
4 |
Correct |
2 ms |
8284 KB |
Output is correct |
5 |
Correct |
2 ms |
8280 KB |
Output is correct |
6 |
Correct |
2 ms |
8284 KB |
Output is correct |
7 |
Correct |
2 ms |
8284 KB |
Output is correct |
8 |
Correct |
2 ms |
8284 KB |
Output is correct |
9 |
Correct |
2 ms |
8280 KB |
Output is correct |
10 |
Runtime error |
8 ms |
16472 KB |
Execution killed with signal 11 |
11 |
Halted |
0 ms |
0 KB |
- |