Submission #514985

#	Time	Username	Problem	Language	Result	Execution time	Memory
514985		CrouchingDragon	Safety (NOI18_safety)	C++17	100 / 100	67 ms	6300 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;
  auto add_left = [&](int64_t x) {
    right.push(x - offset);
    int64_t y = right.top() + offset;
    right.pop();
    cost += x - y;
    left.push(y + offset);
  };
  auto add_right = [&](int64_t x) {
    left.push(x + offset);
    int64_t y = left.top() - offset;
    left.pop();
    cost += y - x;
    right.push(y - offset);
  };
  for (int i = 0; i < N; ++i) {
    int64_t x = S[i];
    add_left(x);
    add_right(x);
    offset += H;
  }
  std::cout << cost << '\n';
  exit(0);
}

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