Submission #1313620

#TimeUsernameProblemLanguageResultExecution timeMemory
1313620nikaa123Boxes with souvenirs (IOI15_boxes)C++20
100 / 100
353 ms196084 KiB
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;

long long delivery(int N, int K, int LEN1, int p[]) {
    long long LEN = LEN1;
    long long L[N];
    long long  R[N];
    for (int i = 0; i < K; i++) {
        L[i] = 2*p[i];
    }
    for (int i = K; i < N; i++) {
        L[i] = L[i-K] + 2*p[i];
    }
    for (int i = N-1; i >= N-K; i--) {
        R[i] = 2*(LEN - p[i]);
    }
    for (int i = N-K-1; i>= 0; i--) {
        R[i] = R[i+K] + 2*(LEN-p[i]);
    }
    long long ans = min(R[0],L[N-1]);
    for (int i = 0; i < N-2; i++) {
        ans = min(ans,L[i]+R[i+1]);
    }
    for (int i = 0; i < N-1; i++) {
        long long l = (i == 0?0:L[i-1]);
        long long r = (i+K >= N?0:R[i+K]);
        ans = min(ans,l+r+LEN);
    }
    return ans;
}
#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...