Submission #425569

#	Time	Username	Problem	Language	Result	Execution time	Memory
425569		haxorman	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	1 ms	204 KiB

boxes

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

int n, k, l;

long long delivery(int N, int K, int L, int p[]) {
    n = N, k = K, l = L;

    long long ans = 0;

    if (k == 1) {
        for (int i = 0; i < n; ++i) {
            ans += min(p[i], (l - 1) - p[i] + 1) * 2;
        }
    }
    else if (k == n) {
        long long half_1 = -1, half_2 = -1;
        for (int i = 0; i < n; ++i) {
            if (i) {
                assert(p[i] >= p[i - 1]);
            }

            if (p[i] <= l / 2) {
                half_1 = p[i];
            }
            else if (half_2 == -1) {
                half_2 = p[i];
            }
        }

        if (half_1 != -1) {
            ans += 2 * half_1;
        }

        if (half_2 != -1) {
            ans += 2 * ((l - 1) - half_2 + 1);
        }

        ans = min(ans, (long long) l);
    }
    else {

        int cnt_1 = 0, cnt_2 = 0;
        for (int i = 0; i < n; ++i) {
            if (p[i] <= l / 2) {
                ++cnt_1;
            }
            else {
                ++cnt_2;
            }
        }
        int pos = 0, cur = k;
        for (int i = 0; i < n && p[i] <= l / 2; ++i) {
            ans += p[i] - pos;
            pos = p[i];

            --cur;
            --cnt_1;

            if ((!cur && cnt_1) || (cnt_1 <= k && cnt_1 > cur)) {
                ans += 2 * pos;
                cur = k;
            }
        }
        ans += pos;

        pos = 0, cur = k;
        for (int i = n - 1; i >= 0 && p[i] > l / 2; --i) {
            if (!pos) {
                ans += ((l - 1) - p[i] + 1);
                pos = p[i];
            }
            else {
                ans += abs(p[i] - pos);
            }

            --cur;
            --cnt_2;

            if ((!cur && cnt_2) || (cnt_2 <= k && cnt_2 > cur)) {
                ans += 2 * ((l - 1) - pos + 1);
                cur = k;
            }
        }
        ans += ((l - 1) - pos + 1);
    }
    return ans;
}

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