Submission #1028465

#	Time	Username	Problem	Language	Result	Execution time	Memory
1028465		pcc	Boxes with souvenirs (IOI15_boxes)	C++17	20 / 100	1 ms	348 KiB

boxes

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

#define ll long long

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

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