Submission #341039

#	Time	Username	Problem	Language	Result	Execution time	Memory
341039		12tqian	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	651 ms	72108 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
typedef long long ll;
const ll INF = 1e18;
template <class T> struct MinDeque {
    int lo = 0, hi = -1;
    std::deque<std::pair<T, int>> d;
    void ins(T x) { // add to back
        while ((d).size() && d.back().first >= x) d.pop_back();
        d.push_back({x, ++hi});
    }
    void del() { // delete from front
        if (d.front().second == lo++) d.pop_front();
    }
    T get() {
        return (d).size() ? d.front().first : std::numeric_limits<T>::max();
    }
};

long long delivery(int N, int K, int L, int p[]) {
    using namespace std;
    ll ans = INF;
    MinDeque<ll> D1;
    MinDeque<ll> D2;
    D1.ins(0);
    D2.ins(2 * (L-p[0]));
    for (int i = 0; i < N; i++) {
        ll res = INF;
        res = min(res, D2.get());
        res = min(res, D1.get() + min(L, 2*p[i]));
        if (i != N-1) {
            D1.ins(res);
            D2.ins(res+2*L-2*p[i+1]);
        }
        if (i >= K-1 && i != N-1) {
            D1.del();
            D2.del();
        }
        if (i == N-1) ans = res;
    }
    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