Submission #291428

#	Time	Username	Problem	Language	Result	Execution time	Memory
291428		Berted	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	1 ms	384 KiB

boxes

#include "boxes.h"
#include <iostream>
#include <assert.h>
#include <utility>
#include <algorithm>

using namespace std;

long long delivery(int N, int K, int L, int p[]) 
{
	long long res = 0; int i, j, Lsz = 0, Rsz = 0;
	for (i = 0; i < N && p[i] == 0; i++);
	for (; i < N && p[i] <= L / 2; i++)
	{
		Lsz++;
		if (Lsz == K) {res += 2 * p[i]; Lsz = 0;}
	}
	for (j = N - 1; j >= 0 && p[j] > L / 2; j--)
	{
		Rsz++;
		if (Rsz == K) {res += 2 * (L - p[j]); Rsz = 0;}
	}
	i--; j++;
	long long temp = 0;
	if (Lsz) 
	{
		assert(i >= 0);
		temp += 2 * p[i];
	}
	if (Rsz) 
	{
		assert(j < N);
		temp += 2 * (L - p[j]);
	}
	res += min(temp, (long long)(Lsz + Rsz + K - 1) / K * L);
    return res;
}

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