Submission #1095606

#	Time	Username	Problem	Language	Result	Execution time	Memory
1095606		Aviansh	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	457 ms	293976 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"

using namespace std;

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