# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1008030 | Mardonbekhazratov | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 348 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 "boxes.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll INFLL=1e18;
long long delivery(int N, int K, int L, int p[]) {
if(K==1){
ll ans=0;
for(int i=0;i<N;i++) ans+=min(p[i],L-p[i])*2;
return ans;
}
if(K==N){
ll ans=L;
for(int i=0;i<N;i++){
ans=min(ans,2ll*p[i-1]+(L-p[i])*2);
}
ans=min(ans,2LL*min({L-p[0],p[N-1]}));
return ans;
}
vector<ll>pref(N+1),suff(N+2);
pref[0]=suff[N+1]=0;
ll sl=0,sr=0;
for(int i=0;i<N;i++){
pref[i+1]=2*p[i];
suff[N-i]=2*(L-p[N-i-1]);
if(i>=K) pref[i+1]+=pref[i-K+1],suff[N-i]+=suff[N-i+K];
}
ll ans=INFLL;
for(int i=1;i<=N+1;i++){
ans=min(ans,pref[i-1]+suff[i]);
}
return 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... |