제출 #386656

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

boxes

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

typedef long long ll;
typedef pair<int, int> pii;
#define debug(x) {cerr<<#x<<"="<<x<<"\n";}
#define debug2(x, y) {cerr<<#x<<", "<<#y<<"="<<x<<", "<<y<<"\n";}
#define debugp(p) {cerr<<#p<<"={"<<p.first<<", "<<p.second<<"}\n";}
#define all(x) x.begin(), x.end()
#define pb push_back

const int MAXN=10000100;

int A[MAXN];
ll dp[MAXN], pd[MAXN], ans=1e18;

ll delivery(int n, int k, int L, int AA[]){
	for (int i=0; i<n; i++) A[i+1]=AA[i];
	sort(A+1, A+n+1);
	for (int i=1; i<=n; i++){
		dp[i]=dp[max(0, i-k)]+min(2*A[i], L);
	}
	for (int i=n; i; i--){
		pd[i]=pd[min(n+1, i+k)]+min(2*(L-A[i]), L);
	}
	for (int i=0; i<=n; i++) ans=min(ans, dp[i]+pd[i+1]);

    return ans;
}

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