Submission #1305175

#TimeUsernameProblemLanguageResultExecution timeMemory
1305175mary-_-bogdanovaBoxes with souvenirs (IOI15_boxes)C++20
10 / 100
1 ms576 KiB
#include "boxes.h"
#include <bits/stdc++.h>
using ll = long long;
using namespace std;

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