Submission #420166

#	Time	Username	Problem	Language	Result	Execution time	Memory
420166		Maqsut_03	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	1 ms	204 KiB

boxes

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

long long ans = 0;

long long delivery(int N, int K, int L, int p[]) 
{
    if(K == N) return min(p[N-1] + min(p[N-1], L - p[N-1]), L - p[0] + min(L - p[0], p[0]));
	if(K == 1)
	{
		for (int i=0; i<N; i++) ans += p[i] + min(p[i], L - p[i]);
		return ans;
	} 
	return 0;
}

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