Submission #61725

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

boxes

#include "boxes.h"

long long delivery(int N, int K, int L, int p[]) {
	long long ans = (long long)(N + K - 1) / K * L;
	
	int i = 0;
	while(p[i] == 0)i++;
	i += K - 1;
	while(i < N && p[i] * 2 < L){
		ans = ans - L + p[i] * 2;
		i += K;
	}
	i = N - K;
	while(i >= 0 && (L -p[i]) * 2 < L){
		ans = ans - L + (L - p[i]) * 2;
		i -= K;
	}
	return ans;
}

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