Submission #61749

#	Time	Username	Problem	Language	Result	Execution time	Memory
61749		nvmdava	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	2 ms	380 KiB

boxes

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

long long l[10000050],r[10000050];

long long delivery(int n, int k, int len, int p[]) {
	int i;
	for(i = 1;i <= n; i++) l[i] = l[max(i - k, 0)] + min(p[i - 1] * 2, len);
	for(i = n;i >= 1; i--) r[i] = r[min(i + k, n + 1)] + min(len * 2 - p[i - 1] * 2, len);
	long long ans = 1e18;
	for(i = 1;i <= n; i++){
		ans = min(ans , l[i] + r[i + 1]);
	}
	return ans;
}

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