Submission #305470

#	Time	Username	Problem	Language	Result	Execution time	Memory
305470		vipghn2003	선물상자 (IOI15_boxes)	C++14	100 / 100	916 ms	266028 KiB

boxes

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

long long delivery(int n,int k,int L,int pos[])
{
    vector<long long>l(n+1),r(n+1);
    sort(pos,pos+n);
    int cntl=0;
    for(int i=0;i<n;i++)
    {
        cntl++;
        if(cntl>=k) l[cntl]=l[cntl-k]+2ll*pos[i];
        else l[cntl]=2ll*pos[i];
    }
    int cntr=0;
    for(int i=n-1;i>=0;i--)
    {
        cntr++;
        if(cntr>=k) r[cntr]=r[cntr-k]+2ll*(L-pos[i]);
        else r[cntr]=2ll*(L-pos[i]);
    }
    long long res=1e18;
    for(int i=0;i<=n;i++)
    {
        res=min(res,l[i]+r[n-i]);
        if(n-i-k>=0) res=min(res,l[i]+r[n-i-k]+L);
    }
    return res;
}

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