제출 #853705

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

bridge

#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

multiset<int> lo, hi; 

void ins(int x) {
  if (!lo.empty() && x >= *lo.rbegin()) {
    hi.insert(x);
  } else {
    lo.insert(x); 
  }
  if (lo.size() > hi.size() + 1) {
    int tmp = *lo.rbegin();
    lo.erase(lo.find(tmp)); 
    hi.insert(tmp); 
  } 
  if (hi.size() > lo.size()) {
    int tmp = *hi.begin();
    hi.erase(hi.find(tmp));
    lo.insert(tmp); 
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int k, n;
  cin >> k >> n;
  long long ans = 0; 
  vector<pair<int,int>> vec; 
  for (int i = 0; i < n; ++i) {
    char z, z2;
    int x, x2;
    cin >> z >> x >> z2 >> x2;
    if (z == z2) {
      ans += abs(x - x2); 
    } else {
      ins(x);
      ins(x2); 
      vec.emplace_back(x, x2); 
    }
  }
  if (k == 1) {
    if (vec.size()) {
      int med = *lo.rbegin(); 
      for (int i = 0; i < (int) vec.size(); ++i) {
        auto [x, x2] = vec[i];
        ans += abs(x - med) + abs(x2 - med); 
      }
      ans += vec.size();       
    }
    cout << ans << '\n'; 
  }
  return 0;
}

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