Submission #470773

#	Time	Username	Problem	Language	Result	Execution time	Memory
470773		nobik	Safety (NOI18_safety)	C++14	0 / 100	349 ms	37808 KiB

safety

// https://oj.uz/problem/view/NOI18_safety
#include <bits/stdc++.h>
// #include <atcoder/all>

using namespace std;
// using namespace atcoder;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SZ(a) ((int)(a).size())
#define ALL(a) (a).begin(), (a).end()

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
// using mint = modint998244353;

constexpr int kInf = 1000 * 1000 * 1000 + 7;
constexpr long long kInfLL = 1e18;

struct TaggedSet {
  multiset<long long> s;
  long long add{};

  void Insert(long long x) { s.insert(x - add); }
  void Erase(long long x) { s.erase(s.find(x - add)); }
  long long Min() { return *s.begin() + add; }
  long long Max() { return *s.rbegin() + add; }
  void Add(long long x) { add += x; }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n, h;
  cin >> n >> h;

  vi a(n);
  REP(i, n) cin >> a[i];

  TaggedSet neg, pos;
  REP(i, 2 * n + 1) neg.Insert(a[0]), pos.Insert(a[0]);

  long long result{};
  for (int i = 1; i < n; ++i) {
    neg.Add(-h); pos.Add(h);
    long long mn = pos.Min();
    int l = a[i], r = a[i];
    if (l <= mn) {
      neg.Insert(l);
    } else {
      pos.Insert(l);
      pos.Erase(mn);
      neg.Insert(mn);
      result += l - mn;
    }
    long long mx = neg.Max();
    if (mx <= r) {
      pos.Insert(r);
    } else {
      neg.Insert(r);
      neg.Erase(mx);
      pos.Insert(mx);
      result += mx - r;
    }
  }

  cout << result << '\n';
}

• 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