Submission #1298315

#	Time	Username	Problem	Language	Result	Execution time	Memory
1298315		the_commando_x	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1 ms	576 KiB

boxes

#include "boxes.h"
#include <algorithm>

long long delivery(int N, int K, int L, int p[])
{
    auto dist = [&](long long x)
    {
        return std::min(x, (long long)L - x);
    };

    long long ans = 0;
    if (K == 1)
        for (int i = 0; i < N; ++i)
            ans += 2LL * std::max(0ll, dist(p[i]));

    else if (K == N)
    {
        long long mxGap = 0;
        for (int i = 0; i < N; ++i)
            mxGap = std::max(mxGap, (long long)p[(i + 1) % N] - p[i]);

        return 2LL * (L - mxGap);
    }

    return ans;
}

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