제출 #331095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
331095		Pety	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	584 ms	284816 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"

using namespace std;

const int N = 10000002;
long long dp[N], dp2[N], poz[N];

long long delivery (int n, int k, int l, int meh[]) {
  for (int i = 1; i <= n; i++)
    poz[i] = meh[i - 1];
  for (int i = 1; i <= n; i++)
    dp[i] = (i >= k ? dp[i - k] + 2 * poz[i] : 2 * poz[i]);
  for (int i = n; i >= 1; i--)
    dp2[i] = (i <= n - k ? dp2[i + k] + 2 * (l - poz[i]) : 2 * (l - poz[i]));
  long long ans = 1e18;
  for (int i = 0; i <= n; i++)
    ans =min(ans, dp[i] + dp2[i + 1]);
  for (int i = 0; i <= n - k; i++)
    ans = min(ans, dp[i] + dp2[i + k + 1] + l);
  return ans;
}

/*int main () {
  int aux[] = {1, 2, 5};
  cout << delivery(3, 2, 8, aux) << "\n";
}*/

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