Submission #431158

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

boxes

#include <bits/stdc++.h>
#include "boxes.h"

#define see(x) cerr<<#x<<"="<<"\n";

using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    if (K == 1) {
        long long ans = 0;
        for (int i = 0; i < N; i ++) {
            if (p[i] <= L / 2) {
                ans += 2 * p[i];
            }
            else {
                ans += 2 * (L - p[i]);
            }
        }
        return ans;
    }
    if (K == N) {
        long long ans = L;
        long long pos1 = 0, pos2 = L;
        for (int i = 0; i < N; i ++) {
            if (p[i] <= L / 2) pos1 = p[i];
            else if (pos2 == L) pos2 = p[i];
        }
        ans = min(ans, 2 * pos1 + 2 * (L - pos2));
        return ans;
    }
    return 0;
}

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