Submission #1034217

#TimeUsernameProblemLanguageResultExecution timeMemory
1034217vjudge1Boxes with souvenirs (IOI15_boxes)C++17
20 / 100
1 ms600 KiB
#include "boxes.h"

#include <bits/stdc++.h>
using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    int n=N,k=K;
    long long l[n+1],r[n+1];
    l[0]=0;
    for(int i=0;i<n;i+=k){
        for(int j=i+1;j<=n&&j<=i+k;j++){
            l[j]=l[i]+min(p[j-1]*2,L);
        }
    }
    r[0]=0;
    for(int i=0;i<n;i+=k){
        for(int j=i+1;j<=n&&j<=i+k;j++){
            r[j]=r[i]+min((L-p[n-j])*2,L);
        }
    }
    long long ans=LLONG_MAX;
    for(int i=0;i<=n;i++){
        ans=min(ans,l[i]+r[n-i]);
    }
    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...