Submission #1293352

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293352		goulthen	Boxes with souvenirs (IOI15_boxes)	C++20	35 / 100	1 ms	580 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define per(i,a,b) for (int i = a; i >= b; i--)
#define pb push_back

long long delivery(int N, int K, int L, int p[]) {
    vector<int> np;
    vector<ll> dp(K,0LL), dp2(K,0LL);

    per(i,N-1,0LL) np.pb(p[i]);
    per(i,N-1,0LL) np.pb(L-p[i]);

    rep(i,0,N-1) dp[i%K]+=np[i];

    ll ans = 2*dp[0];
    rep(r,N,2*N-1) {
        int l = (r)%N;
        dp[l%K] -= np[l];
        dp2[r%K] += np[r];
        ans = min(ans, 2*(dp[(l+1)%K] + dp2[r%K]));
    }
    if(K==N) ans = min(ans, (ll)L);
    else if(2*K >= N) ans = min(ans, (ll)min(L+2*np[N+K-1],L+2*np[K]));

    return ans;
}

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