제출 #744448

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

boxes

#include <bits/stdc++.h>
#include "boxes.h"
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
using namespace std;
long long delivery(int n, int k, int l, int p[]) {
    ll ans = 2e18;
    vl clockwise(n+5,0);
    for(ll i = 0;i < n;i++){
		if(i < k){
			clockwise[i + 1] = 2 * p[i];
		}else{
			clockwise[i + 1] = clockwise[i + 1 - k] + (2 * p[i]);
		}
	}
	vl anticlockwise(n+5, 0);
	for(ll i = n - 1;i >= 0;i--){
		if(i >= n - k + 1){
			anticlockwise[i + 1] = 2 * (l - p[i]);
		}else{
			anticlockwise[i + 1] = anticlockwise[i + 1 + k] + (2 * (l - p[i]));
		}
	}
	for(ll i = 0;i <= n;i++){
		ans = min(ans,clockwise[i] + anticlockwise[i + 1]);
	}
	for(ll i = 0;i <=n-k;i++){
		ans = min(ans,clockwise[i] + anticlockwise[i + 1 + k]);
	}
	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