# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
930150 |
2024-02-18T17:18:14 Z |
takeonicky |
Stove (JOI18_stove) |
C++14 |
|
23 ms |
40536 KB |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e3;
const long long INF = 1e9+7;
int n, k;
int a[MAXN+5];
int dp[MAXN+5][MAXN+5][5];
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 |
3 ms |
20060 KB |
Output is correct |
2 |
Correct |
3 ms |
20060 KB |
Output is correct |
3 |
Correct |
3 ms |
20060 KB |
Output is correct |
4 |
Correct |
3 ms |
20056 KB |
Output is correct |
5 |
Correct |
3 ms |
20060 KB |
Output is correct |
6 |
Correct |
4 ms |
20060 KB |
Output is correct |
7 |
Correct |
4 ms |
20116 KB |
Output is correct |
8 |
Correct |
3 ms |
20060 KB |
Output is correct |
9 |
Correct |
3 ms |
20060 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
20060 KB |
Output is correct |
2 |
Correct |
3 ms |
20060 KB |
Output is correct |
3 |
Correct |
3 ms |
20060 KB |
Output is correct |
4 |
Correct |
3 ms |
20056 KB |
Output is correct |
5 |
Correct |
3 ms |
20060 KB |
Output is correct |
6 |
Correct |
4 ms |
20060 KB |
Output is correct |
7 |
Correct |
4 ms |
20116 KB |
Output is correct |
8 |
Correct |
3 ms |
20060 KB |
Output is correct |
9 |
Correct |
3 ms |
20060 KB |
Output is correct |
10 |
Runtime error |
23 ms |
40536 KB |
Execution killed with signal 11 |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
20060 KB |
Output is correct |
2 |
Correct |
3 ms |
20060 KB |
Output is correct |
3 |
Correct |
3 ms |
20060 KB |
Output is correct |
4 |
Correct |
3 ms |
20056 KB |
Output is correct |
5 |
Correct |
3 ms |
20060 KB |
Output is correct |
6 |
Correct |
4 ms |
20060 KB |
Output is correct |
7 |
Correct |
4 ms |
20116 KB |
Output is correct |
8 |
Correct |
3 ms |
20060 KB |
Output is correct |
9 |
Correct |
3 ms |
20060 KB |
Output is correct |
10 |
Runtime error |
23 ms |
40536 KB |
Execution killed with signal 11 |
11 |
Halted |
0 ms |
0 KB |
- |