Submission #1298281

#TimeUsernameProblemLanguageResultExecution timeMemory
1298281the_commando_x선물상자 (IOI15_boxes)C++17
0 / 100
1 ms568 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 < L; ++i)
            ans += 2 * std::min((long long)p[i], (long long)N - 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...