# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64912 | Inovak | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long ans;
long long delivery(int n, int k, int l, int p[]) {
for(int i = 0; i < n; i++) {
ans += min(p[i], l - p[i]) * 2;
}
return ans;
}
//
//int main() {
// int n, k, l, p[100];
// cin >> n >> k >> l;
// for(int i = 0; i < n; i++) {
// cin >> p[i];
// }
// cout << delivery(n, k, l, p) << endl;
//}
/**
3 1 8
1 2 5
**/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |