# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
54450 | MoNsTeR_CuBe | Boxes with souvenirs (IOI15_boxes) | C++17 | 3 ms | 376 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>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
if(K == 1){
long long tot = 0;
for(int i = 0; i < N; i++){
long long cost = min(p[i], L-p[i]);
tot+=(cost*2);
}
return tot;
}else if(K == N){
sort(p, p+N);
int mid = L/2;
int sum = 0;
for(int i = 0; i < N; i++){
if(p[i] <= mid){
sum = p[i]*2;
}
}
for(int i = 0; i < N; i++){
if(p[i] > mid){
sum+=(p[i]*2);
break;
}
}
return min(sum, L);
}
}
/*
int main(){
int N, K, L;
cin >> N >> K >> L;
int tab[N];
for(int i = 0; i < N; i++){
cin >> tab[i];
}
cout << delivery(N,K,L,tab) << endl;
}
*/
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... |