제출 #1350093

#제출 시각아이디문제언어결과실행 시간메모리
1350093mydkn선물상자 (IOI15_boxes)C++17
0 / 100
0 ms348 KiB
#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int maxn = 1e7 + 5;
const ll inf = 9e18;

ll dpl[maxn], dpr[maxn];
ll mn = inf;

ll delivery(int n, int k, int l, int p[]){
	for(int i=0;i<n;++i){
		dpl[i] = (i >= k ? dpl[i-k] : 0) + p[i]*2;
	}
	for(int i=n-1;i>=0;--i){
		dpr[i] = (n - i - 1 >= k ? dpr[i+k] : 0) + (l - p[i])*2;
	}
	for(int i=0;i<n-1;++i){
		mn = min(mn, dpl[i] + dpr[i+1]);
	}
	return mn;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...