Submission #1173863

#TimeUsernameProblemLanguageResultExecution timeMemory
1173863ezzzaySafety (NOI18_safety)C++20
13 / 100
311 ms2832 KiB
#include<bits/stdc++.h> using namespace std; #define ff first #define int long long #define ss second #define pb push_back const int N=555; int dp[N][N]; int a[N]; signed main(){ int n,h; cin>>n>>h; for(int i=1;i<=n;i++)cin>>a[i]; for(int i=0;i<N;i++){ for(int j=0;j<N;j++){ dp[i][j]=1e15; } } for(int i=0;i<N;i++){ dp[1][i]=abs(a[1]-i); } for(int i=2;i<=n;i++){ for(int j=0;j<N;j++){ for(int l=0;l<N;l++){ if(abs(j-l)<=h){ dp[i][j]=min(dp[i][j],dp[i-1][l]+ abs(j-a[i])); } } } } int ans=1e15; for(int i=0;i<N;i++){ ans=min(ans,dp[n][i]); } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...