제출 #402439

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
402439		monus1042	선물상자 (IOI15_boxes)	C++17	10 / 100	1 ms	296 KiB

boxes

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

long long delivery(int N, int K, int L, int p[]) {
	ll answer = 0;
	for (int i=0; i<N; i++){
		answer = answer + min(p[i],L-p[i])*2;
	}
	if (K==1) return answer;
	answer = 0;
	if (L==1) return answer;
    int mxd = N/2;
	int cnt = 0, cntright = 0;
	for (int i=0; i<N; i++){
		if (p[i] <= mxd) cnt++;
		if ((p[i] == 0 || p[i] >= mxd+1) && N%2==1) cntright++;
		else if ((p[i] == 0 || p[i] >= mxd) && N%2==0) cntright++;
	}
	if (cnt == N) return 2LL*p[N-1];
	if (cntright == N) return 2LL*(L-p[0]);
	answer = L;
	ll maxleft, maxright;
	maxleft = maxright = 0;
    for (int i=0; i<N; i++){
		if (p[i] <= mxd){
			maxleft = max(maxleft,(ll)p[i]);
		}else{
			maxright = max(maxright, (ll)L-p[i]);
		}
	}
	ll answer2 = maxleft*2LL + maxright*2LL;
	answer = min(answer, answer2);
	return answer;
}

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