Submission #1265694

#TimeUsernameProblemLanguageResultExecution timeMemory
1265694martin_011Boxes with souvenirs (IOI15_boxes)C++20
0 / 100
1 ms328 KiB
#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(n, 0);
    for (int i=0; i<n; i++) a[i] = p[i];
    sort(a.begin(), a.end());
    for (int i=0; i<(n-1); i++) {
        res = min(res, 2 * (l - (a[i+1] - a[i])));
    }
    return res;
}
#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...