# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920031 | coding_snorlax | Boxes with souvenirs (IOI15_boxes) | C++14 | 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>
#define ll long long int
using namespace std;
vector<ll> P;
ll n,k,l;
long long split(int C){
ll answer = 0;
answer = 2*(P[C]+(l-P[C+1]));
//cout << answer << " ";
return answer;
}
long long delivery(int N, int K, int L, int p[]) {
for(int i=0;i<N;i++) P.push_back((ll)p[i]);
sort(P.begin(),P.end());
ll answer = L,Max=0,Min=L;
n=N;k=K;l=L;
for(int i:P) {Max = max(Max,(ll)i),Min = min(Min,(ll)i);}
for(int i=0;i<N-1;i++){
answer = min(split(i),answer);
}
answer = min(answer,2*min(Max,(ll)L-Min));
return answer;
}
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... |