Submission #912244

#	Time	Username	Problem	Language	Result	Execution time	Memory
912244		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	35 / 100	195 ms	197812 KiB

triusis

#include <bits/stdc++.h>
#define f first
#define s second	
#define ent '\n'
#define int long long

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

using namespace std;
typedef long long ll;
const int mx=1e6+12;
const int mod=1e9+7;
int dx[]={1,-1,0,0,1,-1,1,-1};
int dy[]={0,0,1,-1,1,-1,-1,1};

int dp[5001][5001];
int a[mx];
int n,m,k;

void Press_Fn_with_F11(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int x=1;x<=5000;x++){
		dp[0][x]=1e18;
	}
	dp[0][0]=0;
	for(int i=1;i<=n;i++){
		for(int x=0;x<=5000;x++){
			dp[i][x]=dp[i-1][max(0ll,x-m)]+(a[i]!=x);
		}
		for(int x=4999;x>=0;x--){
			dp[i][x]=min(dp[i][x+1],dp[i][x]);
		}
	}
	cout<<dp[n][0]<<ent;
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int Alikhan_abi_crush=1;
	// cin>>Alikhan_abi_crush;
	while(Alikhan_abi_crush--){
		Press_Fn_with_F11();
	}
}

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