제출 #209639

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
209639		Kenzo_1114	선물상자 (IOI15_boxes)	C++17	10 / 100	5 ms	376 KiB

boxes

#include<bits/stdc++.h>
#include "boxes.h"
using namespace std;
const int MAXN = 10000010;
const long long int INF = 1e18 + 7;
 
int N, K, L, POSITIONS[MAXN];
long long int clk[MAXN], cnt[MAXN], pos[MAXN];
 
long long int delivery(int n, int k, int l, int positions[])
{	
	for(int i = 0; i < n; i++) pos[i + 1] = positions[i];
		
	for(int i = 1; i <= n; i++)
		cnt[i] = 2 * pos[i] + cnt[(i / k) * k];
	
	for(int i = n; i > 0; i--)
		clk[i] = 2 * (l - pos[i]) + clk[n + 1 - ((n - i + 1) / k) * k];
	
	long long int ans = INF;

	for(int i = 0; i <= n; i++)
		ans = min(ans, cnt[i] + clk[i + 1]);

	for(int i = 0; i + k + 1 <= n + 1; i++)
		ans = min(ans, cnt[i] + l + clk[i + k + 1]);
 
//	long long int ANS2 = ans[id1] + l + ans[id1 + k + 1];
//	long long int ANS3 = ans[id2] + l + ans[id2 - k - 1];
//	printf("ans[%d](%lld) + %d + ans[%d](%lld)\n", id2, ans[id2], l, id2 - k - 1, ans[id2 - k - 1]);
 
//	printf("ans = %lld  ans2 = %lld ans3 = %lld\n", ANS, ANS2, ANS3);
 
	return	ans;
}
/*
int main ()
{
	scanf("%d %d %d", &N ,&K, &L);
	
	for(int i = 0; i < N; i++)	scanf("%d", &POSITIONS[i]);
	
	printf("%lld\n",delivery(N, K, L, POSITIONS));
}
*/
 
/*
	4 2 8 
	1 2 3 5
*/

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