제출 #514976

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
514976		CrouchingDragon	Safety (NOI18_safety)	C++17	0 / 100	18 ms	5412 KiB

safety

#include <bits/stdc++.h>

template <typename T>
using minpq = std::priority_queue<T, std::vector<T>, std::greater<T>>;

constexpr int64_t inf = std::numeric_limits<int64_t>::max() / 2;

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int N, H;
  std::cin >> N >> H;
  std::vector<int> S(N);
  for (int i = 0; i < N; ++i) {
    std::cin >> S[i];
  }
  std::priority_queue<int64_t> left;
  minpq<int64_t> right;
  left.push(-inf);
  right.push(+inf);
  int64_t cost = 0, offset = 0;
  for (int i = 0; i < N; ++i) {
    int64_t x = S[i];
    int64_t l = left.top() - offset, r = right.top() + offset;
    if (l <= x && x <= r) {
      left.push(x + offset);
      right.push(x - offset);
    } else if (x < l) {
      cost += l - x;
      left.push(x + offset);
      right.push(l - offset);
    } else {
      cost += x - r;
      left.push(r + offset);
      right.push(x - offset);
    }
    assert(left.top() - offset <= right.top() + offset);
    offset += H;
  }
  std::cout << cost << '\n';
  exit(0);
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 4
• Subtask 3: 0 / 9
• Subtask 4: 0 / 5
• Subtask 5: 0 / 6
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 22
• Subtask 9: 0 / 29