Submission #832355

#TimeUsernameProblemLanguageResultExecution timeMemory
832355ttamxBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms212 KiB
#include "boxes.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; ll delivery(int N, int K, int L, int p[]) { vector<ll> dpl(N+2),dpr(N+2); for(int i=1;i<=N;i++)dpl[i]=dpl[max(0,i-K)]+2ll*p[i-1]; for(int i=N;i>=1;i--)dpr[i]=dpr[min(N+1,i+K)]+2ll*(L-p[i-1]); ll ans=LLONG_MAX; for(int i=0;i<=N;i++)ans=min(ans,dpl[i]+dpr[i+1]); return 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...