Submission #416466

#	Time	Username	Problem	Language	Result	Execution time	Memory
416466		kevinxiehk	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	596 ms	372236 KiB

boxes

#include "boxes.h"
#include "bits/stdc++.h"
#define lint long long
using namespace std;

long long delivery(int n, int k, int l, int p[]) {
    lint le[n + 5], lcnt = 0;
    lint ri[n + 5], rcnt = 0;
    lint ii = 0;
    while(ii < n && p[ii] <= l / 2) {
        le[lcnt] = p[ii];
        lcnt++;
        ii++;
    }
    while(ii < n) {
        ri[rcnt] = l - p[ii];
        rcnt++;
        ii++;
    }
    reverse(ri, ri + rcnt);
    lint ll[lcnt + 5], rr[rcnt + 5];
    ll[0] = 0, rr[0] = 0;
    for(int i = 1; i <= lcnt; i++) {
        ll[i] = (i <= k ? le[i - 1] * 2 : ll[i - k] + le[i - 1] * 2);
    }
    for(int i = 1; i <= rcnt; i++) {
        rr[i] = (i <= k ? ri[i - 1] * 2 : rr[i - k] + ri[i - 1] * 2);
    }
    lint ans = ll[lcnt] + rr[rcnt];
    for(int i = 0; i <= k; i++) {
        int lef = i;
        int rig = k - i;
        ans = min(ans, l + ll[max(0LL, lcnt - lef)] + rr[max(0LL, rcnt - rig)]);
    }
    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