제출 #427732

#제출 시각아이디문제언어결과실행 시간메모리
427732Dan4LifeBoxes with souvenirs (IOI15_boxes)C++17
0 / 100
1 ms292 KiB
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll delivery(int n, int k, int l, int a[])
{
    ll left[n+1], right[n+1];
    left[0]=right[0]=0ll;
    for(int i = 1; i <= n; i++)
    {
        left[i] = 2*a[i-1];
        if(i>=k)left[i] += left[i-k];
    }
    for(int i = n-1; i>=0; i--)
    {
        right[n-i] = 2*(l-a[i]);
        if(i+k<=n)right[n-i] += right[n-i+k];
    }
    ll ans = 10000000000;
    for(int i = 0; i <= n; i++)
        ans = min(ans, left[i]+right[n-i]);
    for(int i = 0; i <= n-k; i++)
        ans = min(ans, left[i]+right[n-i-k]+l);
    return ans;
}
#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...