Submission #1084878

#	Time	Username	Problem	Language	Result	Execution time	Memory
1084878		the_coding_pooh	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 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 += min(p[i], L - p[i]);
		}
	}
	else if(K == N){
		int mn = 1e9 + 7, mx = 0;
		for(int i = 0; i < N; i++){
			mn = min(mn, p[i]);
			mx = max(mx, p[i]);
		}
		ans = min({L, 2 * (L - mn), 2 * mx});
	}
	uwu
}

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