Submission #1155181

#TimeUsernameProblemLanguageResultExecution timeMemory
1155181aarb_.tomatexdBoxes with souvenirs (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#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;
    
    // Ordenamos las posiciones de los equipos
    vector<int> pos(N);
    for (int i = 0; i < N; i++) {
        pos[i] = positions[i];
    }
    sort(pos.begin(), pos.end());

    // Vamos recorriendo en grupos de tamaño máximo K
    for (int i = N - 1; i >= 0; i -= K) {
        time += 2 * min(pos[i], L-pos[i]); // Ida y vuelta al punto más lejano en este viaje
    }
    
    return time;
}
#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...