Submission #1164782

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1164782	2025-03-10 08:29:05	Ghulam_Junaid	Rabbit Carrot (LMIO19_triusis)	C++20	35 / 100	124 ms	196232 KiB

triusis

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 5005;
ll n, m, ans, a[N], dp[N][N];
int main(){
    cin >> n >> m;
    for (ll i = 1; i <= n; i ++)
        cin >> a[i];
    for (ll i = m + 1; i < N; i ++)
        dp[0][i] = 1e9;
    for (ll i = 1; i <= n; i ++){
        for (ll x = 0; x < N; x ++)
            dp[i][x] = dp[i - 1][x] + (x != a[i]);
        for (ll x = N - 1 - m; x < N; x ++)
            dp[i][N - 1] = min(dp[i][N - 1], dp[i][x]);
        for (ll x = N - 2; x >= 0; x --)
            dp[i][x] = min(dp[i][x + 1], dp[i][max(0ll, x - m)]);
    }
    cout << dp[n][0] << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37