Submission #1265678

#TimeUsernameProblemLanguageResultExecution timeMemory
1265678martin_011Boxes with souvenirs (IOI15_boxes)C++20
0 / 100
0 ms328 KiB
#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

long long delivery(int n, int k, int l, int p[]) {
    ll res = 0;
    int mn=1e9, mx=-1;
    for (int i=0; i<n; i++) {
        mn = min(mn, p[i]);
        mx = max(mx, p[i]);
    }
    res = min(l-mn, mx);
    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...