# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993051 | Mr_Husanboy | Boxes with souvenirs (IOI15_boxes) | C++17 | 1 ms | 348 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;
#define ll long long
long long delivery(int n, int k, int l, int p[]) {
ll ans = 0;
if(k == n){
int mx = p[n - 1], mn = p[0];
int ans = min({l, 2 * mx, 2 * (l - mn)});
for(int i = 1; i < n; i ++){
ans = min(ans, 2 * (p[i - 1] + l - p[i]));
}
return ans;
}
assert(k == 1);
for(int i = 0; i < n; i ++){
ans += min(p[i], l - p[i]) * 2;
}
return ans;
}
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... |