제출 #1216109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1216109		lopkus	Cake 3 (JOI19_cake3)	C++20	100 / 100	726 ms	107748 KiB

cake3

#include <bits/stdc++.h>

class WaveletTree {
private:
  std::vector<std::vector<int>> left;
  std::vector<std::vector<int64_t>> psum;
  std::vector<std::pair<int, int>> c;
  std::vector<int> a, orig;
  int n;

  std::pair<int64_t, int> sum(int v, int tl, int tr, int l, int r, int k) {
    if (k < tl) {
      return {0, 0};
    }
    if (tr <= k) {
      return {psum[v][r] - psum[v][l - 1], r - l + 1};
    }
    int tm = (tl + tr) / 2;
    auto [s1, c1] = sum(2 * v, tl, tm, left[v][l - 1] + 1, left[v][r], k);
    auto [s2, c2] = sum(2 * v + 1, tm + 1, tr, l - left[v][l - 1], r - left[v][r], k);
    return {s1 + s2, c1 + c2};
  }

public:
  WaveletTree(const std::vector<int> &_a) : a(_a), n(0) {
    c.resize(_a.size());
    for (int i = 0; i < _a.size(); ++i) {
      c[i] = {_a[i], i};
    }
    std::sort(c.begin(), c.end());
    std::vector<int> a(_a.size());
    orig.resize(_a.size());
    for (int i = 0; i < _a.size(); ++i) {
      if (i != 0 and c[i].first != c[i - 1].first) {
        orig[n++] = c[i - 1].first;
      }
      a[c[i].second] = n;
    }
    orig[n++] = c.back().first;

    left.resize(4 * n), psum.resize(4 * n);
    construct(1, 0, n - 1, a.begin(), a.end());
  }

  void construct(int v, int tl, int tr, std::vector<int>::iterator l,
                 std::vector<int>::iterator r) {
    left[v].resize(r - l + 1), psum[v].resize(r - l + 1);
    int tm = tl + (tr - tl) / 2;
    for (auto it = l; it != r; ++it) {
      left[v][it - l + 1] = left[v][it - l] + (*it <= tm);
      psum[v][it - l + 1] = psum[v][it - l] + orig[*it];
    }
    if (tl != tr and l != r) {
      auto it = std::stable_partition(l, r, [&](int x) { return x <= tm; });
      construct(2 * v, tl, tm, l, it);
      construct(2 * v + 1, tm + 1, tr, it, r);
    }
  }

  int kth(int v, int tl, int tr, int l, int r, int k) {
    if (tl == tr) {
      return tl;
    }
    int tm = (tl + tr) / 2;
    int cnt = left[v][r] - left[v][l - 1];
    if (k <= cnt) {
      return kth(2 * v, tl, tm, left[v][l - 1] + 1, left[v][r], k);
    }
    return kth(2 * v + 1, tm + 1, tr, l - left[v][l - 1], r - left[v][r], k - cnt);
  }
  int kth(int l, int r, int k) { return kth(1, 0, n - 1, l + 1, r + 1, k); }

  int64_t sum_k(int l, int r, int k) {
    int i = kth(l, r, k);
    auto [s, c] = sum(1, 0, n - 1, l + 1, r + 1, i - 1);
    return s + orig[i] * (k - c);
  }
};

inline int next_int() {
  int64_t x = 0, c = getchar_unlocked();
  for (; c < '0' or c > '9'; c = getchar_unlocked()) {}
  for (; c >= '0' and c <= '9'; c = getchar_unlocked()) { x = x * 10 + c - '0'; }
  return x;
}

int main() {
  int n = next_int(), m = next_int();
  std::vector<std::pair<int64_t, int64_t>> a(n);
  for (auto &[c, v] : a) {
    v = next_int(), c = next_int() << 1;
  }
  std::sort(a.begin(), a.end());
  
  const int64_t inf = 1e15;
  int64_t ans = -inf;
  std::vector<int> b(n);
  for (int i = 0; i < n; ++i) {
    b[i] = -a[i].second;
  }
  WaveletTree wv(b);
  auto solve = [&](auto &&self, int tl, int tr, int l, int r) -> void {
    int tm = (tl + tr) / 2;
    std::pair<int64_t, int> opt = {-inf, -1};
    for (int i = std::max(l, m + tm - 1); i <= r; ++i) {
      opt = std::max(opt, {a[i].second - a[i].first - wv.sum_k(tm + 1, i - 1, m - 2), i});
    }
    ans = std::max(ans, opt.first + a[tm].first + a[tm].second);
    if (tl != tr) {
      self(self, tl, tm, l, opt.second);
      self(self, tm + 1, tr, opt.second, r);
    }
  };
  solve(solve, 0, n - m, 0, n - 1);
  std::cout << ans << '\n';
}

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