Submission #692052

#	Time	Username	Problem	Language	Result	Execution time	Memory
692052		zeroesandones	선물상자 (IOI15_boxes)	C++17	10 / 100	1 ms	352 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;

using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;

#define pb emplace_back

ll delivery(int N, int K, int L, int p[]) {
    ll pref[N + 1] = {};
    ll suff[N + 1] = {};

    for(int i = 1; i <= N; ++i) {
        if((i - 1) % K == 0) {
            // have to start a new trip
            pref[i] = 2 * p[i - 1];
        } else {
            // can continue the last trip
            pref[i] = 2 * (p[i - 1] - p[i - 2]) + pref[i - 1];
        }
    }

    suff[0] = 0;
    for(int i = 1; i <= N; ++i) {
        if((i - 1) % K == 0) {
            // have to start a new trip
            suff[i] = 2 * (L - p[N - i]);
        } else {
            // can continue the last trip
            suff[i] = 2 * (p[N - (i - 1)] - p[N - i]) + suff[i - 1];
        }
    }

    ll ans = LLONG_MAX;
    for(int i = 0; i <= N; ++i) {
        ans = min(ans, pref[i] + suff[N - i]);
        if(N - i - K >= 0)
            ans = min(ans, pref[i] + suff[N - i - K] + L);
    }

    return ans;
}

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