제출 #54206

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
54206		WLZ	선물상자 (IOI15_boxes)	C++17	10 / 100	2 ms	380 KiB

boxes

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

using namespace std;

#ifdef DEBUG
#define debug(x) cout << #x << ' ' << x << '\n'
#else
#define debug(x)
#endif

long long delivery(int N, int K, int L, int p[]) {
  int idx = 0;
  int left = N;
  long long ans = 0ll;
  while (left > 0) {
    vector<int> cur;
    for (int i = idx; i < min(idx + K, N); i++) {
      cur.push_back(p[i]);
      left--;
    }
    idx += K;
    long long takeLeft = 0ll;
    long long takeRight = 0ll;

    {
      int pos = 0;
      for (auto& x : cur) {
        takeLeft += (long long) (x - pos);
        debug(takeLeft);
        pos = x;
      }
      takeLeft += (long long) (min(pos, L - pos));
    }

    {
      int pos = L;
      reverse(cur.begin(), cur.end());
      for (auto& x : cur) {
        takeRight += (long long) (pos - x);
        debug(takeRight);
        pos = x;
      }
      takeRight += (long long) (min(pos, L - pos));
    }
    ans += min(takeLeft, takeRight);
    debug(ans);
  }
  return ans;
}
/*
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k, l, p[1005];
  cin >> n >> k >> l;
  for (int i = 0; i < n; i++) {
    cin >> p[i];
  }
  cout << delivery(n, k, l, p) << endl;
  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