Submission #1338574

#	Time	Username	Problem	Language	Result	Execution time	Memory
1338574		piolk	선물상자 (IOI15_boxes)	C++20	50 / 100	38 ms	27800 KiB

boxes

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

constexpr long long inf=2e18;

long long delivery(int N,int K,int L,int p[]){
    vector<int> a(N),arev(N);
    for (int i=0;i<N;i++){
        a[i]=p[i];
        arev[i]=L-p[N-i-1];
    }
    vector<long long> l(N+1),r(N+1);
    for (int i=1;i<=N;i++){
        if (i>=K) l[i]=l[i-K]+2*a[i-1];
        else l[i]=2*a[i-1];
    }
    for (int i=1;i<=N;i++){
        if (i>=K) r[i]=r[i-K]+2*arev[i-1];
        else r[i]=2*arev[i-1];
    }

    long long ans=inf;
    for (int i=0;i<=N;i++){
        ans=min(ans,l[i]+r[N-i]);
        ans=min(ans,l[i]+L+r[N-K-i]);
    }
    return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30