Submission #1232498

#TimeUsernameProblemLanguageResultExecution timeMemory
123249812baaterBoxes with souvenirs (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h"
#include <algorithm>

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

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