제출 #954397

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

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<ll, ll>
const ll mod = 1e9 + 7;
const ll mxN = 1e7 + 5;
using namespace std;
ll dpL[mxN], dpR[mxN];
long long delivery(int N, int K, int L, int p[])
{
    ll ans = 1e18;
    ll num = 0;
    ll k = K;
    for (int i = 0; i < N; i++)
    {
        if (i >= k)
        {
            num = dpL[i - k];
        }
        dpL[i] = num + (ll)min(2 * p[i], L);
        // cout << dpL[i] << ' ';
    }
    // cout << '\n';
    ans = dpL[N - 1];
    num = 0;
    k = K;
    for (int i = N - 1; i >= 0; i--)
    {
        if (N - i - 1 >= k)
        {
            num = dpR[i + k];
        }
        dpR[i] = num + (ll)min((L - p[i]) * 2, L);
        // cout << dpR[i] << ' ';
        if (i)
            ans = min(ans, dpR[i] + dpL[i - 1]);
        else
            ans = min(ans, dpR[i]);
    }
    return ans;
}

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