Submission #1084890

#	Time	Username	Problem	Language	Result	Execution time	Memory
1084890		the_coding_pooh	선물상자 (IOI15_boxes)	C++14	20 / 100	1 ms	348 KiB

boxes

#include "boxes.h"

#include <bits/stdc++.h>
#define uwu return ans;

using namespace std;


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

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