Submission #1034220

#	Time	Username	Problem	Language	Result	Execution time	Memory
1034220		vjudge1	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	464 ms	294008 KiB

boxes

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

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30