Submission #1217026

#TimeUsernameProblemLanguageResultExecution timeMemory
1217026matereBoxes with souvenirs (IOI15_boxes)C++20
100 / 100
360 ms274396 KiB
#include "boxes.h" #include<bits/stdc++.h> #define ll long long using namespace std; ll a[10000005],dp1[10000005],dp2[10000005],n,k,l; ll delivery(int nn,int kk,int lll,int b[]){ n=nn,k=kk,l=lll; for(ll i=1;i<=n;i++){ a[i]=b[i-1]; dp1[i]=dp1[max(0ll,i-k)]+a[i]+min(a[i],(l-a[i])); // cout<<dp1[i]<<' '; } // cout<<endl; for(ll i=n;i>=1;i--){ dp2[i]=dp2[min(n+1,i+k)]+(l-a[i])+min(a[i],(l-a[i])); // cout<<dp2[i]<<' '; } ll ans=1e18; for(ll i=0;i<=n;i++){ ans=min(ans,dp1[i]+dp2[i+1]); } return ans; } // int main(){ // int nn,kk,lll; // cin>>nn>>kk>>lll; // int aa[nn]; // for(int i=0;i<nn;i++) cin>>aa[i]; // cout<<delivery(nn,kk,lll,aa); // }
#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...