Submission #1034063

#	Time	Username	Problem	Language	Result	Execution time	Memory
1034063		Zicrus	Boxes with souvenirs (IOI15_boxes)	C++17	20 / 100	1 ms	348 KiB

boxes

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

typedef long long ll;

ll delivery(int n, int k, int l, int p11[]) {
    vector<ll> p(n);
    for (int i = 0; i < n; i++) p[i] = p11[i];

    if (k == 1) {
        ll sum = 0;
        for (auto &e : p) sum += 2*min(e, l-e);
        return sum;
    }

    ll fR = lower_bound(p.begin(), p.end(), l/2) - p.begin();
    if (fR == 0) return 2*(l-p[fR]);
    ll fL = fR-1;
    if (fL == n-1) return 2*p[fL];

    return p[fL] + l-p[fR] + min(p[fR]-p[fL], l-(p[fR]-p[fL]));
}

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