Submission #248883

#	Time	Username	Problem	Language	Result	Execution time	Memory
248883		kshitij_sodani	선물상자 (IOI15_boxes)	C++14	50 / 100	2077 ms	21752 KiB

boxes

#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
//#include "boxes.h"
llo dp[10000001];
long long delivery(int n, int k, int ll, int it[]) {
	sort(it,it+n);
	for(int i=0;i<n;i++){
		dp[i]=-1;
	}
	llo l=ll;
	for(int i=0;i<n;i++){
		for(int j=max(0,i-k+1);j<=i;j++){
			llo cost=l;
			cost=min(cost,it[i]*(llo)2);
			cost=min(cost,(l-it[j])*(llo)2);
			if(j>0){
				cost+=dp[j-1];
			}
			if(dp[i]==-1){
				dp[i]=cost;
			}
			dp[i]=min(dp[i],cost);
		}
	}



    return dp[n-1];
}


/*int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);


	return 0;
}*/

/*
g++  -o aa -O2 box.cpp grader.cpp -std=c++14
*/

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