Submission #206933

#	Time	Username	Problem	Language	Result	Execution time	Memory
206933		Kenzo_1114	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	6 ms	376 KiB

boxes

#include<bits/stdc++.h>
#include"boxes.h"
using namespace std;
const int MAXN = 10000010;

int N, K, L, POSITIONS[MAXN], pos[MAXN];
long long int ans[MAXN];

long long int delivery(int n, int k, int l, int positions[])
{
	int id1 = 0, id2 = 0;
	
	for(int i = 0; i < n; i++) pos[i + 1] = positions[i];
	
	for(int i = 1; i <= n; i++)	
		if(pos[i] > l / 2)
		{	id1 = i - 1; id2 = i;	break;	}
		
	for(int i = 1; i <= id1; i++)
		ans[i] = 2 * pos[i] + ans[(i / k) * k];
	
	for(int i = n; i > id1; i--)
		ans[i] = 2 * (l - pos[i]) + ans[n + 1 - ((n - i + 1) / k) * k];
		
	long long int ANS = ans[id1] + ans[id2];
	
	id1 = (id1 / k) * k;

	long long int ANS2 = ans[id1] + l + ans[id1 + k + 1];
//	printf("ans[%d](%lld) + %d + ans[%d](%lld)\n", id1, ans[id1], l, id1 + k + 1, ans[id1 + k + 1]);

//	printf("ans = %lld  ans2 = %lld\n", ANS, ANS2);

	return min(ANS, ANS2);
}
/*
int main ()
{
	scanf("%d %d %d", &N ,&K, &L);
	
	for(int i = 0; i < N; i++)	scanf("%d", &POSITIONS[i]);
	
	printf("%lld\n",delivery(N, K, L, POSITIONS));
}
*/

/*
	4 2 8 
	1 2 3 5
*/

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