제출 #1034220

#제출 시각아이디문제언어결과실행 시간메모리
1034220vjudge1선물상자 (IOI15_boxes)C++17
100 / 100
464 ms294008 KiB
#include "boxes.h"

#include <bits/stdc++.h>
using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    int n=N,k=K;
    long long l[n+1],r[n+1];
    l[0]=0;
    for(int i=1;i<=k;i++){
        l[i]=min(p[i-1]*2,L);
    }
    for(int i=k+1;i<=n;i++){
        l[i]=l[i-k]+min(p[i-1]*2,L);
    }
    r[0]=0;
    for(int i=1;i<=k;i++){
        r[i]=min((L-p[n-i])*2,L);
    }
    for(int i=k+1;i<=n;i++){
        r[i]=r[i-k]+min((L-p[n-i])*2,L);
    }
    long long ans=LLONG_MAX;
    for(int i=0;i<=n;i++){
        ans=min(ans,l[i]+r[n-i]);
    }
    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...