제출 #79386

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
79386		Plurm	선물상자 (IOI15_boxes)	C++11	0 / 100	2 ms	504 KiB

boxes

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

long long delivery(int N, int K, int L, int p[]) {
	vector<int> v;
	for(int i = 0; i < N; i++){
		v.emplace_back(min(p[i],L-p[i]));
	}
	sort(v.begin(),v.end());
	deque<int> dq;
	vector<long long> dp;
	dp.resize(N);
	dp[0] = 2ll*v[0];
	dq.push_back(0);
	long long mn = (long long)(N+K-1)/(long long)K*(long long)L;
	for(int i = 1; i < N; i++){
		mn = min(mn,dp[i-1] + (long long)(N-i+K-1)/(long long)K*(long long)L);
		while(!dq.empty() && i - dq.front() >= K) dq.pop_front();
		dp[i] = dp[dq.front()] + 2ll*(long long)v[i];
		while(!dq.empty() && dp[i] < dp[dq.back()]) dq.pop_back();
		dq.push_back(i);
	}
	mn = min(mn,dp[N-1]);
	return mn;
}

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