Submission #444488

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

boxes

#include<bits/stdc++.h>
#include "boxes.h"
using namespace std;
typedef long long ll;
long long subtask2(int N, int L, int p[]) {
	long long A = (L - p[0])*2;
	long long B = p[N-1]*2;
	return min(A+A, min(B+B, ll(L)));
}
long long subtask1(int N,int L, int p[]) {
	long long sum = 0;
	for(int i = 0;i<N;i++) {
		sum += min(p[i], L-p[i])*2;
	}
	return sum;
}
long long delivery(int N, int K, int L, int p[]) {
	if(K == 1) {
		sort(p, p+N);
		return subtask1(N,L,p);
	}
	if(K == N) {
		sort(p, p+N);
		return subtask2(N, L, p);
	}
	return 0;
}
/*int main () {
	int p[2] = {1, 3};
	cout<<delivery(2, 2, 4, p);
	return 0;
}*/

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