Submission #580348

#	Time	Username	Problem	Language	Result	Execution time	Memory
580348		alirezasamimi100	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	2080 ms	340 KiB

boxes

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

#define pb push_back
#define F first
#define S second

using namespace std;
using ll = long long int;
using pll = pair<ll, ll>;

ll delivery(int N, int K, int L, int p[]) {
    ll dp[N + 2], pd[N + 2], ans = 1e18;
    vector<ll> vec = {-1};
    set<pll> st;
    for(int i = 0; i < N; i++) if(p[i]) vec.pb(p[i]);
    dp[0] = pd[vec.size()] = 0;
    st.insert({0, 0});
    for(int i = 1; i < (int)vec.size(); i++){
        while(st.begin()->S < i - K) st.erase(st.begin());
        dp[i] = st.begin()->F + vec[i] + min(vec[i], L - vec[i]);
        st.insert({dp[i], i});
    }
    st.clear();
    st.insert({0, N + 1});
    for(int i = (int)vec.size() - 1; i; i--){
        while(st.begin()->S > i + K) st.erase(st.begin());
        pd[i] = st.begin()->F + L - vec[i] + min(vec[i], L - vec[i]);
        st.insert({pd[i], i});
    }
    for(ll i = 0; i < (int)vec.size(); i++) ans = min(ans, dp[i] + pd[i + 1]);
    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