제출 #138829

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
138829		dnass	선물상자 (IOI15_boxes)	C++14	100 / 100	1079 ms	305972 KiB

boxes

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

int n, k, l;
vector<int> lhalf, rhalf;
int lsize, rsize;
vector<lld> beg_l, beg_r, new_beg_r;
lld min_new_beg_r_mod_k[10000002];

int myceil(int x, int y){
	if(x%y==0) return x/y;
	return (x/y)+1;
}

long long delivery(int N, int K, int L, int p[]){
	lld cost = 1e18;
	n = N; k = K; l = L;
	if(n==1) return min((lld)2*p[0], (lld)2*(l-p[0]));
	for(int i=0;i<n&&2*p[i]<=l;i++){
		lhalf.push_back(p[i]);
	}
	lsize = (int) lhalf.size();
	for(int i=n-1;i>=0&&2*(l-p[i])<l;i--){
		rhalf.push_back(l-p[i]);
	}
	rsize = (int) rhalf.size();
	beg_l.push_back(0);
	for(int i=0;i<lsize;i++){
		beg_l.push_back(2*((lld)lhalf[i])+beg_l[max(0, i-k+1)]);
	}
	beg_r.push_back(0);
	for(int i=0;i<rsize;i++){
		beg_r.push_back(2*((lld)rhalf[i])+beg_r[max(0, i-k+1)]);
	}
	cost = *beg_l.rbegin()+*beg_r.rbegin();
	for(int i=rsize;i>=0;i--){
		new_beg_r.push_back(beg_r[i]+(lld)myceil(rsize-i, k)*((lld) l));
	}
	/*
	for(auto x:beg_r) printf("%lld ", x);
		printf("\n");
	for(auto x:new_beg_r) printf("%lld ", x);
		printf("\n");
	for(auto x:beg_l) printf("%lld ", x);
		printf("\n");
		*/
	for(int i=0;i<k;i++){
		min_new_beg_r_mod_k[i] = 1e18;
	}
	for(int i=0;i<=rsize;i++){
		min_new_beg_r_mod_k[i%k] = min(min_new_beg_r_mod_k[i%k], new_beg_r[i]);
	}
	for(int i=lsize;i>=0;i--){
		cost = min(cost, ((lld)((lsize-i)/k))*((lld)l)+min_new_beg_r_mod_k[(k-((lsize-i)%k))%k]+beg_l[i]);
	}
	return cost;
}

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