Submission #213267

#	Time	Username	Problem	Language	Result	Execution time	Memory
213267		arman_ferdous	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	5 ms	384 KiB

boxes

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

using ll = long long;
const int N = 1e7+10;
int n, k; ll l;
ll dp1[N], dp2[N];

long long delivery(int _n, int _k, int _l, int p[]) {
  n = _n, k = _k, l = _l;
  for(int i = 0; i < n; i++) {
    if(i < k) dp1[i] = 2ll * p[i];
    else dp1[i] = 2ll * p[i] + dp1[i - k];
  }
  for(int i = n - 1; i >= 0; i--) {
    if(n - 1 < i + k) dp2[i] = 2ll * (p[i] == 0 ? 0 : l - p[i]);
    else dp2[i] = 2ll * (p[i] == 0 ? 0 : l - p[i]) + dp2[i + k];
  }
  ll ans = min(dp1[n - 1], dp2[0]);
  for(int i = 0; i + 1 < n; i++)
    ans = min(ans, dp1[i] + dp2[i + 1]);
  for(int i = 0; i < n; i++) {
    ll one = (i ? dp1[i - 1] : 0);
    ll two = (i + k < n ? dp2[i + k] : 0);
    ans = min(ans, l + one + two);
  }
  return ans;
}

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