제출 #831476

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
831476		waldi	선물상자 (IOI15_boxes)	C++17	100 / 100	416 ms	40392 KiB

boxes

#include<bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
typedef long long ll;
using namespace std;

ll delivery(int n, int k, int l, int poz[]){
	ll wyn = ((ll)n)*((ll)l);
	FOR(off, 1, min(n, k)){
		ll twyn = 0ll;
		for(int i = off-1; 1; i += k){
			int poc = poz[max(i-k+1, 0)];
			int kon = poz[min(i, n-1)];
			
			if(kon <= l>>1) twyn += kon<<1;
			else if(poc >= (l+1)>>1) twyn += (l-poc)<<1;
			else twyn += l;
			
			if(i >= n-1) break;
		}
		wyn = min(wyn, twyn);
	}
	return wyn;
}

#ifdef LOCAL
#define maxn 1000
int main(){
	int n, k, l, p[maxn];
	scanf("%d%d%d", &n, &k, &l);
	REP(i, n) scanf("%d", &p[i]);
	ll wyn = delivery(n, k, l, p);
	printf("%lld\n", wyn);
}
#endif

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