Submission #1203098

#	Time	Username	Problem	Language	Result	Execution time	Memory
1203098		lance0	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	0 ms	328 KiB

boxes

#include <bits/stdc++.h>
using namespace std;
long long delivery(int N, int K, int L, int positions[]) {
	long long rot1[N+1] = {};
	long long rot2[N] = {};
	for (int i = 0; i < min(K,N); i++) {
		//wack st5 edge case 
		rot1[i+1] = 2ll*(long long)positions[i];
		rot2[i+1] = 2ll*(long long)(L-positions[N-i-1]);
	}
	for (int i = K; i < N; i++) {
		int x = (i-1)/K;
		x *= K;
		rot1[i+1] = rot1[x]+2ll*(long long)positions[i];
		rot2[i+1] = rot2[x]+2ll*(long long)(L-positions[N-i-1]);
	}
	long long ans = 1e18;
	for (int i = 0; i <= N; i++) {
		ans = min(ans,rot1[i]+rot2[N-i]);
	}
	for (int i = 0; i <= N-K; i++) {
		ans = min(ans,rot1[i]+rot2[N-i-K]+L);
	}
	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