# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321207 | fadi57 | Safety (NOI18_safety) | C++14 | 8 ms | 6124 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mx=600;
const int mod= 998244353;
const int inf=2*1e16+9;
ll n,h;
ll a[mx];ll c[mx];
ll dp[mx][mx];
int main() {
cin>>n>>h;
ll sum=0;ll mxx=0;
for(int i=0;i<n;i++){
cin>>a[i];
mxx=max(mxx,a[i]);
}
if(h>mxx){cout<<0;return 0;}
memset(dp,inf,sizeof(dp));
for(int i=0;i<mxx;i++){
dp[0][i]=abs(a[0]-i);
}
for(int i=1;i<n;i++){
for(int j=0;j<mxx;j++){
for(int jj=j;jj<=j+h;jj++){
dp[i][j]=min(dp[i][j],dp[i-1][jj]+abs(a[i]-j));
}
for(int jj=j-1;jj>=(j-h)&&jj>=0;jj--){
dp[i][j]=min(dp[i][j],dp[i-1][jj]+abs(a[i]-j));
}
}
}
ll ans=inf;
for(int i=0;i<=mxx;i++){ans=min(ans,dp[n-1][i]);}cout<<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |