Submission #1298275

#TimeUsernameProblemLanguageResultExecution timeMemory
1298275the_commando_xBoxes with souvenirs (IOI15_boxes)C++17
0 / 100
1 ms572 KiB
#include "boxes.h"

#include <bits/stdc++.h>
using namespace std;

using l = long long;
using vl = vector<l>;

long long delivery(int N, int K, int L, int p[])
{
    l ans = 0;
    if (K == 1)
        for (int i = 0; i < L; ++i)
            ans += 2 * min(p[i], 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...