제출 #63322

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

boxes

#include<bits/stdc++.h>
#include "boxes.h"
using namespace std;
#define MAX 1000006
#define ll long long
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define inf 100000000000000000

long long delivery(int N, int K, int L, int P[]) {

	ll ans1=0,ans2=0;

	int start=0;

	while(P[start]==0) start++;

	for(int i=start;i<N;i+=K) {

		int last=min(N-1,i+K-1);

		ll cost=min(1ll*L,min(2ll*P[last],2ll*(L-P[i])));

		ans1+=cost;

	}

	for(int i=N-1;i>=start;i-=K) {

		int last=max(start,i-K+1);

		ll cost=min(1ll*L,min(2ll*P[i],2ll*(L-P[last])));

		ans2+=cost;

	}

	return min(ans1,ans2);

}

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