제출 #348265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
348265		MrDomino	Safety (NOI18_safety)	C++14	33 / 100	2085 ms	1476 KiB

safety

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define int ll

multiset<int> local_minimum(multiset<int> s, int h) {
  assert((int) s.size() % 2 == 0);
  multiset<int> s2;
  int slope = -(int) s.size() / 2;
  for (auto &x : s) {
    if (slope < 0) {
      s2.insert(x - h);
    }
    if (slope >= 0) {
      s2.insert(x + h);
    }
    slope++;
  }
  return s2;
}


int get(multiset<int> s, int a, int b) {
  int n = (int) s.size();
  vector<int> xs;
  for (auto &it : s) {
    xs.push_back(it);
  }
  for (int i = n - 1; i >= 0; i--) {
    b += xs[i];
    a--;
    if (a == 0) {
      return b;
    }
  }
  assert(0);
}



signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

  multiset<int> s;
  int n, h, x, b = 0;
  cin >> n >> h >> x;
  s.insert(x);
  s.insert(x);
  b = -x;

  for (int i = 2; i <= n; i++) {
    s = local_minimum(s, h);
    cin >> x;
    b -= (i - 1) * h; /// I have no clue why this happens lol
    s.insert(x);
    s.insert(x);
    auto it = s.end();
    it--;
    b -= x;
  }
  cout << get(s, (int) s.size() / 2, b) << "\n";
}

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