Submission #138465

#	Time	Username	Problem	Language	Result	Execution time	Memory
138465		Diuven	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	611 ms	292636 KiB

boxes

#include "boxes.h"

typedef long long lint;
const int MAX = 1e7+10;

inline lint _min(lint a, lint b){ return a<b ? a : b; }

lint A[MAX], B[MAX];

lint delivery(int n, int k, int L, int p[]) {
	for(int i=1; i<=n; i++) A[i] = (i-k>=0 ? A[i-k] : 0) + p[i-1] + _min(p[i-1], L-p[i-1]);
	for(int i=n; i>=1; i--) B[i] = (i+k<=n+1 ? B[i+k] : 0) + L-p[i-1] + _min(p[i-1], L-p[i-1]);
	lint ans = 2e18;
	for(int i=0; i<=n; i++) ans = _min(ans, A[i]+B[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