# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321087 | fadi57 | Safety (NOI18_safety) | C++14 | 2079 ms | 10596 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=200009;
const int mod= 998244353;
const int inf=2*1e5+9;
ll n,h;
ll a[mx];ll c[mx];
bool chek(){
for(int i=1;i<n;i++){
if(abs(c[i]-c[i-1])>h){return 0;}
}
return 1;
}
int solve(int i,int last){
if(i==n){
return 0;
}ll ret=inf;
for(int j=-1;j<2;j++){
c[i]=j; ll neww=last+j;
if(last+j<0){continue;}
ret=min(ret,solve(i+1,last+j)+abs(a[i]-neww));
}
return ret;
}
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(n==1){cout<<0;return 0;}
ll ans=inf;for(int i=0;i<=4;i++){ans=min(ans,solve(1,i)+abs(a[0]-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... |