제출 #410019

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

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define debug(args...) fprintf(stderr, args)
using namespace std;
const int maxn = 2e7, INF = 1e9;
int n, k, m, dp1[maxn], dp2[maxn], ini[maxn], fim[maxn], resp;

long long delivery(int N, int K, int L, int p[])
{
	n = N; m = L; k = K; resp = INF;
	
	for(int x = 0; x < n; x++)
		ini[x] = 2*p[x] + ((x > k)?ini[x-k]:0);
	for(int x = n-1; x >= 0; x--)
		fim[x] = 2*(m-p[x]) + ((x < (n-k))?ini[x+k]:0);
	
//	resp = min(ini[0], fim[n-1]);
	for(int x = 0; x < n-1; x++)
		resp = min(resp, ini[x]+fim[x+1]);
	for(int x = 1; x+k < n; x++)
		resp = min(resp, ini[x]+m+fim[x+k+1]);
	if(k == n)	resp = min(resp, m);
	else	resp = min(resp, min(ini[0]+m, m+fim[n-k+1]));
	
	debug("%d\n",resp);
	return resp;
}

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