Submission #163591

#	Time	Username	Problem	Language	Result	Execution time	Memory
163591		shenxy	Boxes with souvenirs (IOI15_boxes)	C++11	10 / 100	2 ms	380 KiB

boxes

#include "boxes.h"
#include <algorithm>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
  if (K == 1) {
    long long ans = 0;
    for (int i = 0; i < N; ++i) ans += min(p[i] * 2, (L - p[i]) * 2);
    return ans;
  } else if (K == N) {
  	long long ans = min(L, min(2 * p[N - 1], 2 * (L - p[0])));
    int* x = lower_bound(p, p + N, L / 2);
    ans = min((int) ans, 2 * (*(x - 1)) + 2 * (L - *x));
    return ans;
  }
  else return 0;
}

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