Submission #425536

#TimeUsernameProblemLanguageResultExecution timeMemory
425536haxormanBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms204 KiB
#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 = 0, half_2 = 0;
        for (int i = 0; i < n; ++i) {
            if (p[i] <= l / 2) {
                half_1 = p[i];
            }
            else {
                if (!half_2) {
                    half_2 = p[i];
                }
                half_2 = min(half_2, (long long) p[i]);
            }
        }

        ans = min((long long) l, 2 * half_1 + 2 * ((l - 1) - half_2 + 1));
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...