Submission #793553

#	Time	Username	Problem	Language	Result	Execution time	Memory
793553		UltraFalcon	Boxes with souvenirs (IOI15_boxes)	C++17	20 / 100	1 ms	212 KiB

boxes

// pragmas
#ifndef DEBUG

#endif

#include <bits/stdc++.h>
#include "boxes.h"

// #define int long long
using ll = long long;

using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    
    vector<ll> cost_pref(N, 0);
    for (int i=0; i<N; i++) {
        if (i>=K) cost_pref[i] = cost_pref[i-K];
        cost_pref[i] += 2*p[i];
    }

    vector<ll> cost_suff(N, 0);
    for (int i=N-1; i>=0; i--) {
        if (i+K < N) cost_suff[i] = cost_suff[i+K];
        cost_suff[i] += 2*(L-p[i]);
    }

    // for (auto &x : cost_pref) {
    //     cerr << x << " ";
    // }

    ll res = min(cost_pref[N-1], cost_suff[0]);

    if (K >= N) res = min(res, (ll)L);
    res = min(res, (ll)L+cost_suff[min(N-1, K)]);
    res = min(res, (ll)L+cost_pref[min(N-1, N-K)]);
    for (int i=0; i<N; i++) {
        res = min(res, cost_pref[i]+(ll)L+cost_suff[min(N-1, i+K+1)]);

        res = min(res, cost_pref[i]+cost_suff[min(N-1, i+1)]);
    }

    return res;
}

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