#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll delivery(int N, int K, int L, int positions[]) {
ll time = 0;
int k = K, l = L;
vector<int> pos(N);
for (int i = 0; i < N; i++) {
pos[i] = positions[i];
}
if(k==1){
for (int i = N - 1; i >= 0; i -= K) {
time += 2 * min(pos[i], l-pos[i]);
}
return time;
}else if(k==N){
//la mas lejana
int mn = min(pos[N-1], L -pos[0]);
return mn;
}
return 0;
}
/*
int main() {
int positions[] = {1, 2, 7}; // Definir el array correctamente
cout << delivery(3, 3, 8, positions);
return 0;
}*/
# | 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... |