Submission #197320

#	Time	Username	Problem	Language	Result	Execution time	Memory
197320		Juney	선물상자 (IOI15_boxes)	C++14	0 / 100	2 ms	376 KiB

boxes

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

typedef long long ll;

const int MAXN = 1e7 + 5;

int N, K, L;
ll dp1[MAXN], dp2[MAXN], ans;

ll delivery(int _N, int _K, int _L, int p[]) {
	N = _N; K = _K; L = _L;
    for(int i=0; i<N; i++) {
		if(i >= K) dp1[i] = dp1[i-K] + 2 * p[i]; 
		else dp1[i] = 2 * p[i];
	}
    for(int i=N-1; i>=0; i--) {
		if(i+K < N) dp2[i] = dp2[i+K] + 2 * (L - p[i]); 
		else dp2[i] = 2 * (L - p[i]);
	}
	ans = min(dp1[N-1], dp2[0]);
	for(int i=0; i<N-1; i++) ans = min(ans, dp1[i] + dp2[i+1]);
	for(int i=0; i+K+1<N; i++) {
		ans = min(ans, dp1[i] + dp2[i+K+1]);
	}
	return ans;
}

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