Submission #770031

#	Time	Username	Problem	Language	Result	Execution time	Memory
770031		teokakabadze	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	1396 ms	380108 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define ll long long
#define NN 10000007
#define pii pair<int, int>
using namespace std;

ll n, k, a[NN], dp[NN], dp1[NN], ans, i, l;
deque<pair<ll, ll> > d;

long long delivery(int N, int K, int L, int p[])
{
    n = N, k = K, l = L;
    for(i = 0; i < n; i++)
    a[i] = p[i];
    d.pb({0, -1});
    for(i = 0; i < n; i++)
    {
        if(d.front().s == i - k - 1) d.pop_front();
        dp[i] = min(l, 2 * a[i]) + d.front().f;
        while(d.size() && d.front().f >= dp[i]) d.pop_front();
        d.pb({dp[i], i});
    }
    while(d.size()) d.pop_back();
    d.pb({0, n});
    for(i = n - 1; i >= 0; i--)
    {
        if(d.front().s == i + k + 1) d.pop_front();
        dp1[i] = min(l, 2 * (L - a[i])) + d.front().f;
        while(d.size() && d.front().f >= dp1[i]) d.pop_front();
        d.pb({dp1[i], i});
    }
    ans = 1e18;
    for(i = 0; i < n; i++)
    ans = min(ans, dp[i] + dp1[(i + 1) % n]);
    return min(min(dp[n - 1], dp1[0]), 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