제출 #296172

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
296172		Hemimor	선물상자 (IOI15_boxes)	C++14	10 / 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);
	sort(p,p+N);
	ll t=0;
	for(int i=0;i<N;i++){
		a[i+1]=t+p[i];
		if((i+1)%K==0) t+=p[i];
	}
	t=0;
	for(int i=N-1;i>=0;i--){
		a[i]+=t+L-p[i];
		if((N-i)%K==0) t+=L-p[i];
	}
	ll res=INF;
	for(auto i:a) res=min(res,i);
	return res*2;
}

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