# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
550427 | elazarkoren | Boxes with souvenirs (IOI15_boxes) | C++17 | 1 ms | 308 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 <bits/stdc++.h>
#include "boxes.h"
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
long long delivery(int n, int k, int l, int p[]) {
ll ans = l;
sort(p, p + n);
for (int i = 0; i < n - 1; i++) {
chkmin(ans, ll(2) * (p[i] + (l - p[i + 1])));
}
chkmin(ans, ll(2) * p[n - 1]);
chkmin(ans, ll(2) * (l - p[0]));
// for (int i = 0; i < n; i++) {
// ans += 2 * min(p[i], l - p[i]);
// }
return ans;
}
//3 2 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... |