Submission #521020

#TimeUsernameProblemLanguageResultExecution timeMemory
521020ColourAttilaBoxes with souvenirs (IOI15_boxes)C++17
20 / 100
1 ms304 KiB
#include "boxes.h"
#include<bits/stdc++.h>

using namespace std;

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

    sort(p, p+N);

    long long ret = min((long long)L, min(p[N-1]*2ll, (L-p[0])*2ll));
    for(int i = 0; i < N-1; i++) {
        ret = min(ret, (p[i] + L - p[i+1])*2ll);
    }
    return ret;
}
#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...