제출 #681676

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681676		peijar	Cake 3 (JOI19_cake3)	C++17	0 / 100	1 ms	212 KiB

cake3

#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

int nbElem, nbVoulus;

struct Container {
  multiset<int> small, big;
  int sum = 0;

  Container() {}

  void fix() {
    while ((int)big.size() > nbVoulus - 2) {
      int toDel = *big.begin();
      sum -= toDel;
      big.erase(big.begin());
      small.insert(toDel);
    }
    while ((int)big.size() < nbVoulus - 2 and !small.empty()) {
      int toDel = *small.rbegin();
      small.erase(small.find(toDel));
      sum += toDel;
      big.insert(toDel);
    }
  }

  void add(int x) {
    if (small.empty())
      big.insert(x), sum += x;
    else if (big.empty())
      small.insert(x);
    else if (x < *small.rbegin())
      small.insert(x);
    else
      big.insert(x), sum += x;
    fix();
  }

  void del(int x) {
    if (big.count(x))
      big.erase(big.find(x));
    else
      small.erase(small.find(x));
    fix();
  }
};

const int INF = 1e18;

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

  cin >> nbElem >> nbVoulus;

  vector<pair<int, int>> arr(nbElem);
  for (auto &[V, C] : arr)
    cin >> V >> C;
  sort(arr.begin(), arr.end(), [&](auto l, auto r) {
    return pair(l.second, l.first) < pair(r.second, r.first);
  });

  int sol = 0;

  auto Solve = [&](auto solve, int deb, int fin, int optL, int optR) {
    if (deb == fin)
      return;
    int mid = (deb + fin) / 2;
    while (mid < fin and min(optR, mid) - optL < nbVoulus - 1)
      ++mid;
    if (mid == fin)
      return;
    Container container;
    for (int i = mid - 1; i >= optR; --i)
      container.add(arr[i].first);
    int opt = -1;
    int dp = -INF;

    for (int i = min(optR, mid) - 1; i >= optL; --i) {
      if ((int)container.big.size() == nbVoulus - 2) {
        int v = arr[mid].first + arr[i].first -
                2 * (arr[mid].second - arr[i].second) + container.sum;
        if (v > dp)
          opt = i, dp = v;
      }
      container.add(arr[i].first);
    }
    dbg(mid, dp);
    container.big.clear();
    container.small.clear();
    sol = max(sol, dp);
    solve(solve, deb, mid, optL, opt + 1);
    solve(solve, mid + 1, fin, opt, optR);
  };

  Solve(Solve, nbVoulus - 1, nbElem, 0, nbElem);
  cout << sol << endl;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 19
• Subtask 3: 0 / 76