Submission #425497

#TimeUsernameProblemLanguageResultExecution timeMemory
425497haxormanBoxes with souvenirs (IOI15_boxes)C++14
0 / 100
1 ms204 KiB
#include "boxes.h"
#include "bits/stdc++.h"
using namespace std;

int n, k, l;

long long delivery(int N, int K, int L, int p[]) {
    n = N, k = K, l = L;

    long long ans = 0;
    for (int i = 0; i < n; ++i) {
        ans += min(p[i], (l - 1) - p[i] + 1);
    }
    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...