oj.uz

Submission #470773

# Submission time Handle Problem Language Result Execution time Memory
470773 2021-09-05T14:14:38 Z nobik Safety (NOI18_safety) C++14
0 / 100
 349 ms 37808 KB 
// 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.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 349 ms 37808 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -