제출 #742676

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

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
using ll = long long;
#define MAXN (1000005)

long long delivery(int N, int K, int L, int p[]) {
    ll minimum = 5e18;
    ll clockwise[N + 5];
    memset(clockwise,0,sizeof(clockwise));
    for(ll i = 0;i < N;i++){
		if(i < K){
			clockwise[i] = 2 * p[i];
		}else{
			clockwise[i] = clockwise[i - K] + (2 * p[i]);
		}
	}
	ll anticlockwise[N + 5];
	memset(anticlockwise,0,sizeof(anticlockwise));
	for(ll i = N - 1;i >= 0;i--){
		if(i >= N - K){
			anticlockwise[i] = 2 * (L - p[i]);
		}else{
			anticlockwise[i] = anticlockwise[i + K] + (2 * (L - p[i]));
		}
	}
	minimum = min(minimum,clockwise[N - 1]);
	minimum = min(minimum,anticlockwise[0]);
	for(ll i = 0;i < N - 1;i++){
		minimum = min(minimum,clockwise[i] + anticlockwise[i + 1]);
	}
	for(ll i = K - 1;i < N;i++){
		minimum = min(minimum,clockwise[i - K + 1] + anticlockwise[i + 1] + L);
	}
	return minimum;
}

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