Submission #392472

#	Time	Username	Problem	Language	Result	Execution time	Memory
392472		my99n	선물상자 (IOI15_boxes)	C++14	0 / 100	1 ms	204 KiB

boxes

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

long long cwtour[1000100], cwwtour[1000100];
long long delivery(int N, int K, int L, int p[]) {

  for (int i = 0; i < N; i++) cwtour[i] = p[i] + i>K?cwtour[i-K]:0;
  for (int i = N-1; i >= 0; i--) cwwtour[i] = L-p[i] + i+K>=N?cwwtour[i+K]:0;

  long long ans = 1e18;
  for (int i = 0; i < N-1; i++) ans = min(ans, 2*cwtour[i]+2*cwwtour[i+1]);
  for (int i = 0; i < N-K-1; i++) ans = min(ans, 2*cwtour[i]+2*cwwtour[i+K+1]+L);
  if (K > N) ans = min(ans, (long long)L);
  return ans;
}

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