제출 #807605

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
807605		peijar	Palembang Bridges (APIO15_bridge)	C++17	22 / 100	32 ms	7616 KiB

bridge

#include <bits/stdc++.h>
#define int long long
using namespace std;

string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
  bool first = true;
  string res = "[";
  for (const auto &x : v) {
    if (!first)
      res += ", ";
    first = false;
    res += to_string(x);
  }
  res += "]";
  return res;
}

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
  cout << ' ' << to_string(H);
  dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

struct Median {
  priority_queue<int> lower;
  priority_queue<int, vector<int>, greater<int>> upper;
  int sumLow, sumUp;

  Median() : sumLow(0), sumUp(0) {}

  void add(int x) {
    if (!lower.empty() and lower.top() < x)
      upper.push(x), sumUp += x;
    else
      lower.push(x), sumLow += x;
    while (upper.size() > lower.size()) {
      sumUp -= upper.top();
      sumLow += upper.top();
      lower.push(upper.top());
      upper.pop();
    }
    while (lower.size() > upper.size() + 1) {
      sumLow -= lower.top();
      sumUp += lower.top();
      upper.push(lower.top());
      lower.pop();
    }
  }

  int med() {
    if (lower.empty())
      return 0;
    int x = lower.top();
    return x * lower.size() - sumLow + sumUp - x * upper.size();
  }
};

signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int K, N;
  cin >> K >> N;

  vector<pair<int, int>> intervals;
  int sol = 0;
  for (int i = 0; i < N; ++i) {
    char c, d;
    int a, b;
    cin >> c >> a >> d >> b;
    if (a > b)
      swap(a, b);
    if (c == d) {
      sol += b - a;
      continue;
    }
    sol++;
    intervals.emplace_back(a, b);
  }
  if (K == 1) {
    Median med;
    for (auto [a, b] : intervals) {
      med.add(a);
      med.add(b);
    }
    dbg(sol, med.med());
    cout << sol + med.med() << endl;
  }
}

• Subtask 1: 8 / 8
• Subtask 2: 14 / 14
• Subtask 3: 0 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37