Submission #783229

#	Time	Username	Problem	Language	Result	Execution time	Memory
783229		shezitt	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1 ms	212 KiB

boxes

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

using ll = long long;

long long delivery(int N, int K, int L, int p[]){
	// SUBTASK 1
	if(K == 1){
		ll ans = 0;
		for(int i=0; i<N; ++i){
			ans += min(p[i], L - p[i]) * 2;
		}
		return ans;	
	}
	
	// SUBTASK 2
	if(K == N){
		ll ans = 0;
		sort(p, p+N);
		
		// opcion 1
		ans = p[N-1] * 2;
		
		// opcion 2
		ans = min(ans, (L - p[0])*2ll);
		
		// opcion 3
		ans = min(ans, 1ll*L);
	}
	
	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