제출 #63308

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

boxes

#include<bits/stdc++.h>
#include "boxes.h"
using namespace std;
#define MAX 1000006
#define ll long long
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define inf 100000000000000000

int Left[MAX],Right[MAX];
ll sumR[MAX],sumL[MAX];

long long delivery(int N, int K, int L, int P[]) {

	int curL=0,curR=0;
	int pro=0;

	for(int i=0;i<N;i++) {

		if(P[i]==0) continue ;

		if(P[i]<=(L-1)/2) {

			Left[curL++]=P[i];

		}
		else if(P[i]>=(L%2?(L+1)/2:L/2+1)) {

			Right[curR++]=P[i];

		}
		else {

			pro++;

		}

	}

	//printf("PRO-->%d\n",pro);

	//printf("curL-->%d curR-->%d\n",curL,curR);

	reverse(Right,Right+curR);

	for(int i=0;i<curR;i++) {

		if(i-K>=0) sumR[i]=sumR[i-K]+(L-Right[i])*2;
		else sumR[i]=(L-Right[i])*2;

	}

	for(int i=0;i<curL;i++) {

		if(i-K>=0) sumL[i]=sumL[i-K]+Left[i]*2;
		else sumL[i]=Left[i]*2;

	}	

	for(int i=0;i<curL;i++) {

	//	printf("sumL[%d]-->%lld\n",i,sumL[i]);
	//	printf("Left[%d]-->%d\n",i,Left[i]);

	}
	
	for(int i=0;i<curR;i++) {

	//	printf("sumR[%d]-->%lld\n",i,sumR[i]);
	//	printf("Right[%d]-->%d\n",i,Right[i]);

	}

	ll ans=(pro+K-1)/K*L;

	//printf("FIRST ANS-->%lld\n",ans);

	int rem=(pro?K-pro%K:0);

	ll add=inf;

	int curpR=curR-1;
	int curpL=curL-1;

	for(int i=0;;i++,rem+=K) {

		if(curpR<0 && curpL<0) break ;

		while(rem>0) {

			if(curpR>=0 && sumR[curpR]-(curpR-1>=0?sumR[curpR-1]:0)>sumL[curpL]-(curpL-1>=0?sumL[curpL-1]:0)) curpR--;
			else if(curpL>=0) curpL--;

			rem--;

		}

		umin(add,1ll*L*i+(curpR>=0?sumR[curpR]:0)+(curpL>=0?sumL[curpL]:0));

	}

	return ans+add;

}

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