제출 #707663

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
707663		SamNguyen	선물상자 (IOI15_boxes)	C++14	0 / 100	1 ms	300 KiB

boxes

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

const long long INF = 1e18;

template <class T1, class T2>
inline bool minimise(T1 &x, T2 y) {
	if (x > y) { x = y; return true; }
	return false;
}

long long delivery(int N, int K, int L, int pos[]) {
	vector<int> lefts, rights;
	for (int i = 0; i < N; i++) {
		if (2 * pos[i] < L)
			lefts.push_back(pos[i]);
		else
			rights.push_back(L - pos[i]);
	}

	sort(lefts.begin(), lefts.end(), greater<int>());	
	sort(rights.begin(), rights.end(), greater<int>());	

	vector<long long> sum_lefts(lefts.size()), sum_rights(rights.size());
	for (int i = int(lefts.size() - 1); i >= 0; i--) {
		sum_lefts[i] = lefts[i];
		if (i + K < int(lefts.size()))
			sum_lefts[i] += sum_lefts[i + K];
	}

	for (int i = int(rights.size() - 1); i >= 0; i--) {
		sum_rights[i] = rights[i];
		if (i + K < int(rights.size()))
			sum_rights[i] += sum_rights[i + K];
	}

	long long ans = INF;
	for (int i = 0; i <= K; i++) {
		long long cur = 1LL * L;
		if (i < int(lefts.size()))
			cur += 2 * sum_lefts[i];
		if (K - i < int(rights.size()))
			cur += 2 * sum_rights[K - i];

		minimise(ans, cur);
	}

    return ans;
}

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