oj.uz

Submission #637944

# Submission time Handle Problem Language Result Execution time Memory
637944 2022-09-03T16:36:46 Z Iwanttobreakfree Rabbit Carrot (LMIO19_triusis) C++17
14 / 100
 1 ms 348 KB 
#include <iostream>
#include <vector>
using namespace std;
int best=1e9;
vector<vector<int>> dp(100,vector<int> (100,-1));
int DP(int i,int h,vector<int>& v,int m){
    if(i<0)return 1e9;
    if(dp[i][h]!=-1)return dp[i][h];
    dp[i][h]=1e9;
    for(int j=max(0,h-m);j<100;j++){
        dp[i][h]=min(dp[i][h],DP(i-1,j,v,m)+(j!=v[i-1]));
    }
    return dp[i][h];
}
int main(){
    int n,m,ans=1e9;
    cin>>n>>m;
    vector<int> v(n+1);
	dp[0][0]=0;
    for(int i=1;i<=n;i++)cin>>v[i];
    for(int i=0;i<100;i++){
        ans=min(ans,DP(n,i,v,m)+(i!=v[n]));
    }
    cout<<ans<<'\n';
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Incorrect 1 ms 340 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

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

Subtask #4
0 / 37.0

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