| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1193598 | ElayV13 | 선물상자 (IOI15_boxes) | C++20 | 0 ms | 0 KiB |
//#include "boxes.h"
#include "bits/stdc++.h"
using namespace std;
const long long INF = 1e18;
long long delivery(int n , int k , int l , int p[])
{
long long res = INF;
for(int bit = 0;bit < (1 << (n - 1));++bit)
{
vector < bool > r(n , false);
for(int i = 0;i < n - 1;i++) r[i] = 0;
for(int i = 0;i < n - 1;i++)
{
if((1 << i) & bit)
{
r[i] = 1;
}
}
vector < int > cur;
vector < vector < int > > A;
for(int i = 0;i < n;i++)
{
if(i == 0){
cur.push_back(p[i]);
continue;
}
if(r[i - 1] == 1)
{
A.push_back(cur);
cur.clear();
cur.push_back(p[i]);
}
else cur.push_back(p[i]);
}
if(cur.size()) A.push_back(cur);
bool can = 1;
for(vector < int > v : A) if((int)v.size() > k) can = 0;
long long cost = 0;
for(vector < int > v : A){
if(!v.size()) continue;
int first = v[0];
int last = v[v.size() - 1];
cost = cost + (min(l - first , last) * 2);
}
for(vector < int > v : A){
for(int i : v){
//cout << i << ' ';
}
//cout << endl;
}
//cout << "Cost" << ' ' << cost << ' ' << can << endl;
if(can)
res = min(res , cost);
}
return res;
}
signed main()
{
int n , k , l;
cin >> n >> k >> l;
int p[n];
for(int i = 0;i < n;i++) cin >> p[i];
cout << delivery(n , k , l , p) << endl;
}