답안 #639653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
639653	2022-09-10T19:19:14 Z	Sofiatpc	Rabbit Carrot (LMIO19_triusis)	C++14	14 / 100	196 ms	98492 KB

triusis

#include <bits/stdc++.h>

using namespace std;

const int MAXN =  5005;
int N,M, dp[MAXN][MAXN], h[MAXN];

int fazdp(int i, int cur)
{
    if(i==N)return dp[i][cur]=0;
    if(dp[i][cur]!=-1)return dp[i][cur];

    dp[i][cur]=fazdp(i+1,cur+M)+1;
    if(h[i+1] <= cur+M )dp[i][cur]=min(dp[i][cur],fazdp(i+1,h[i+1]));
    return dp[i][cur];
}

int main()
{
    cin>>N>>M;
    for(int i = 1; i <= N; i++)cin>>h[i];

    for(int i = 1; i <= N; i++)
        for(int cur = 0; cur <= 5000; cur++)dp[i][cur]=-1;

    h[0]=0;
    int ans = fazdp(1,M)+1;
    if(h[1]<=h[0]+M)ans=min(fazdp(1,h[1]),ans);


    cout<<ans<<"\n";
}

Subtask #1

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	468 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	0 ms	468 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	0 ms	468 KB	Output is correct
10	Correct	0 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	0 ms	468 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	0 ms	468 KB	Output is correct

Subtask #2

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	468 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	0 ms	468 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	0 ms	468 KB	Output is correct
10	Correct	0 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	0 ms	468 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	0 ms	468 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	196 ms	79828 KB	Output is correct
21	Incorrect	148 ms	98492 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3

0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	196 ms	79828 KB	Output is correct
5	Incorrect	148 ms	98492 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #4

0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	196 ms	79828 KB	Output is correct
5	Incorrect	148 ms	98492 KB	Output isn't correct
6	Halted	0 ms	0 KB	-