제출 #321211

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
321211		wildturtle	선물상자 (IOI15_boxes)	C++14	10 / 100	1 ms	364 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,f,g,n,m,k,l,ans,dp[10000007],dp1[10000007];
long long delivery(int N, int K, int L, int p[]) {
    for(long long i=0;i<N;i++) {
        if(i<K) dp[i+1]=2*p[i];
        else dp[i+1]=2*p[i]+dp[i-K+1];
     //   cout<<dp[i+1]<<" ";
    }
    //cout<<endl;
    for(long long i=N-1;i>=0;i--) {
        if(i<N-K+1) dp1[i+1]=2*(L-p[i]);
        else dp1[i+1]=2*(L-p[i])+dp1[i+K+1];
      //  cout<<dp1[i+1]<<" ";
    }
    //cout<<endl;
    //cout<<ans<<endl;
    ans=min(dp[N],dp1[1]);
    for(long long i=1;i<=N-K+1;i++) {
        ans=min(ans,dp[i-1]+L+dp1[i+K]);
    }
    for(long long i=1;i<N;i++)
    ans=min(ans,dp[i]+dp1[i+1]);
    return ans;
}/*
int main() {
    int A[]={1,2,5};
    cout<<delivery(3,2,8,A);
}*/

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