제출 #1332592

#제출 시각아이디문제언어결과실행 시간메모리
1332592Gabriel선물상자 (IOI15_boxes)C++20
20 / 100
1 ms344 KiB
#include "boxes.h"
#include "bits/stdc++.h"
using namespace std;
long long delivery(int n, int k, int l, int p[]){
    long long r = 22222222222222222, _ltimoi = 0, _ltimod = 0;
    vector<long long> Izquierda(n), Derecha(n);
    for(int i = 0; i < n; i++){
        Izquierda[i] = (long long)(p[i] + min(p[i], l - p[i])) + _ltimoi;
        Derecha[n - i - 1] = (long long)(l - p[n - i - 1] + min(p[n - i - 1], l - p[n - i - 1])) + _ltimod;
        if((i + 1) % k == 0){
            _ltimoi = Izquierda[i];
            _ltimod = Derecha[n - i - 1];
        }
    }
    for(int i = 0; i < n; i++) r = min(r, Izquierda[i] + (i < n - 1 ? Derecha[i + 1] : 0LL));
    r = min(r, Derecha[0]);
    return r;
}
#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...