제출 #138270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
138270		neki	Boxes with souvenirs (IOI15_boxes)	C++14	70 / 100	520 ms	155576 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define maxn 1010000
#define loop(i, a, b) for(int i=a;i<b;i++)
using namespace std;
typedef long long ll;
ll dsp[maxn], dod[maxn], arr[maxn];

ll min (ll a, ll b){return (a<b) ? a:b;}
ll max (ll a, ll b){return (a>b) ? a:b;}

long long delivery(int N, int K, int L, int p[]) {
    loop(i, 0, N) arr[i+1]=p[i];
    dod[0]=0;dsp[N+1]=0;
    loop(i, 1, N+1) dod[i]=dod[max(0, i-K)]+2* arr[i];
    for(int i=N;i>0;i--) dsp[i]=dsp[min(N+1, i+K)]+2*(L-arr[i]);
    ll ans=LLONG_MAX;
    loop(i, 0, N+1) ans=min(ans, dod[i]+dsp[i+1]);
    loop(i, 0, N-K+1) ans=min(ans, dod[i]+dsp[i+K+1]+L);
    return ans;
}

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