제출 #63301

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
63301		hamzqq9	선물상자 (IOI15_boxes)	C++14	0 / 100	3 ms	424 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++;

		}

	}

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

		if(i-K>=0) sumR[i]=sumR[i-K]+Right[i]*2;
		else sumR[i]=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;

	}	

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

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

	ll add=inf;

	for(int i=0;i<=(N-pro+K-1)/K;i++) {

		int use=min(rem+i*K,N-pro);

		ll cev=inf;

		for(int j=0;j<=use;j++) {

			umin(cev,(curR-1-j>=0?sumR[curR-1-j]:0)+(curL-1-use+j>=0?sumL[curL-1-use+j]:0));

		}

		umin(add,cev+1ll*L*i);

	}

	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