#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
long long delivery(int n, int k, int l, int p[]) {
ll res = l;
vll a;
set<ll> s;
a.push_back(0);
a.push_back(l);
s.insert(0);
s.insert(l);
for (int i=0; i<n; i++) {
ll t = s.size();
s.insert(p[i]);
if (s.size() > t) a.push_back(p[i]);
}
ll tam = a.size();
sort(a.begin(), a.end());
for (int i=0; i<(tam-1); i++) {
res = min(res, 2 * (l - (a[i+1] - a[i])));
}
return res;
}
# | 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... |