제출 #296834

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

boxes

#include "boxes.h"
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

ll delivery(int N, int K, int L, int p[]) {
	vl a(N+1),b(N+1);
	sort(p,p+N);
	for(int i=0;i<N;i++) a[i+1]=(i+1-K>=0?a[i+1-K]:0)+p[i];
	for(int i=N-1;i>=0;i--) b[N-i]=(N-i-K>=0?b[N-i-K]:0)+L-p[i];
	ll res=INF;
	auto f=[&](ll i,ll j){
		return a[i]*2+b[j]*2+(ll)(N-i-j+K-1)/K*L;
	};
	for(int i=1;i<=N;i++) res=min({res,f(i,0),f(0,i)});
	for(int i=0;i<=N;i++){
		ll l=0,r=(N-i)/K;
		while(r-l>3){
			ll ml=(r-l)/3+l,mr=(ml+r)/2;
			if(f(i,N-i-ml)>f(i,N-i-mr)) l=ml;
			else r=mr;
		}
		while(r>l){
			res=min(res,f(i,r));
			r--;
		}
	}
	return res;
}

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