Submission #520997

#	Time	Username	Problem	Language	Result	Execution time	Memory
520997		szekelymilan	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	1 ms	204 KiB

boxes

#include <iostream>
#include <algorithm>
#include <vector>
#include "boxes.h"

long long delivery(int N, int K, int L, int p[]) {
  if (K == 1) {
    int ans = 0;
    for (int i = 0; i < N; i++)
      ans += 2 * std::min(p[i], L - p[i]);
    return ans;
  }

  std::vector<int> v(N);
  for (int i = 0; i < N; i++) v[i] = p[i];

  std::sort(v.begin(), v.end());
  int ans = std::min(v[N - 1], (v[N - 1] == 0 ? 0 : L - *std::upper_bound(v.begin(), v.end(), 0)));
  for (int i = 0; i < N - 1; i++)
    ans = std::min(ans, (v[i] == v[N - 1] ? v[i] : 2 * v[i] + 2 * L - *std::upper_bound(v.begin(), v.end(), v[i])));

  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