Submission #1232508

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232508		12baater	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	0 ms	328 KiB

boxes

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

long long delivery(int N, int K, int L, int p[]) {

    int maxUnder = 0, minOver = 2000000000;
    for (int i = 0; i < N; i++) {
        if (p[i] > L/2) {
            minOver = std::min(minOver, p[i]);
        } else {
            maxUnder = std::max(maxUnder, p[i]);
        }
    }

    long long total = 0;
    if (p[N-1] <= L/2) {
        total = p[N-1] * 2;
    } else if (p[0] > L/2) {
        total = (L - p[0]) * 2;
    } else {
        total = L;
    }
    return std::min(total, static_cast<long long>(2*maxUnder + 2*(L-minOver)));

}

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