Submission #544123

#	Time	Username	Problem	Language	Result	Execution time	Memory
544123		krit3379	선물상자 (IOI15_boxes)	C++14	0 / 100	3 ms	468 KiB

boxes

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

long long dp1[N],dp2[N],ans=1e18;

long long delivery(int n,int k,int l,int pos[N]){
    int i;
    pos[n]=pos[0];
    sort(pos+1,pos+n+1);
    for(i=1;i<=n;i++){
        if(i>k)dp1[i]=dp1[i-k]+2*pos[i];
        else dp1[i]=2*pos[i];
    }
    for(i=n;i>0;i--){
        if(i+k<=n)dp2[i]=dp2[i+k]+2*(l-pos[i]);
        else dp2[i]=2*(l-pos[i]);
    }
    for(i=1;i+1<=n;i++)ans=min(ans,dp1[i]+dp2[i+1]);
    for(i=0;i<n;i++)ans=min(ans,dp1[i]+dp2[min(i+k+1,n+1)]+l);
    return ans;
}

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