Submission #1040901

#	Time	Username	Problem	Language	Result	Execution time	Memory
1040901		c2zi6	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	437 ms	325668 KiB

boxes

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<typename T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "boxes.h"

int n, k;
ll l;

ll delivery(int N_ARG, int K_ARG, int L_ARG, int POS_ARG[]) {
    n = N_ARG;
    k = K_ARG;
    l = L_ARG;
    VL pos;
    pos.pb(0);
    rep(i, n) pos.pb(POS_ARG[i]);
    pos.pb(l);
    n += 2;
    VL f(n);
    replr(i, 0, n-1) {
        f[i] = 2*pos[i];
        if (i-k >= 0) f[i] += f[i-k];
    }
    VL g(n);
    reprl(j, n-1, 0) {
        g[j] = 2*(l-pos[j]);
        if (j+k < n) g[j] += g[j+k];
    }
    auto func = [&](int i, int j) {
        return (j-i-1 + k-1) / k * l + g[j] + f[i];
    };

    ll ans = min(f[n-1], g[0]);
    replr(i, 0, n-1) {
        if (i+k+1 < n) setmin(ans, func(i, i+k+1));
        if (i+1 < n) setmin(ans, func(i, i+1));
    }
    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