Submission #1298291

#TimeUsernameProblemLanguageResultExecution timeMemory
1298291the_commando_xBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
0 ms576 KiB
#include "boxes.h"
#include <algorithm>

long long delivery(int N, int K, int L, int p[])
{
    long long ans = 0;
    if (K == 1)
        for (int i = 0; i < N; ++i)
            ans += 2LL * std::min((long long)p[i], std::max(0LL,(long long)L - p[i]));

    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...