Submission #213304

#	Time	Username	Problem	Language	Result	Execution time	Memory
213304		arman_ferdous	선물상자 (IOI15_boxes)	C++14	100 / 100	588 ms	293884 KiB

boxes

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

using ll = long long;

long long delivery(int n, int k, int l, int p[]) {
  ll dp1[n + 1], dp2[n + 1];
  dp1[0] = dp2[0] = 0;
  for(int i = 1; i <= n; i++) {
    dp1[i] = 2ll * p[i - 1] + (i - k >= 0 ? dp1[i - k] : 0);
    dp2[i] = 2ll * (l - p[n - i]) + (i - k >= 0 ? dp2[i - k] : 0);
  }
  ll ans = 1e18;
  for(int i = 0; i <= n; i++) {
    ans = min(ans, dp1[i] + dp2[n - i]);
    if(n - i - k >= 0) 
      ans = min(ans, dp1[i] + dp2[n - i - k] + 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: 30 / 30