test/verify/yosupo-line-add-get-min.test.cpp

• View this file on GitHub
• Last update: 2026-08-10 15:44:16+00:00
• Problem: https://judge.yosupo.jp/problem/line_add_get_min

Depends on

• Dynamic Li Chao Tree (structure/convex-hull-trick/dynamic-li-chao-tree.hpp)

Code

// clang-format off
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/line_add_get_min
// clang-format on

#include <algorithm>
#include <iostream>
#include <vector>

#include "../../structure/convex-hull-trick/dynamic-li-chao-tree.hpp"

using namespace std;

constexpr long long kInf = (1LL << 62) - 1;

int main() {
  int N, Q;
  cin >> N >> Q;
  const long long MAX_P = 1000000000;
  DynamicLiChaoTree<long long, -MAX_P, MAX_P, kInf> cht;
  for (int i = 0; i < N; i++) {
    long long a, b;
    cin >> a >> b;
    cht.add_line(a, b);
  }
  while (Q--) {
    int T;
    cin >> T;
    if (T == 0) {
      long long A, B;
      cin >> A >> B;
      cht.add_line(A, B);
    } else {
      long long P;
      cin >> P;
      cout << cht.query(P) << "\n";
    }
  }
}

#line 1 "test/verify/yosupo-line-add-get-min.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/line_add_get_min
// clang-format on

#include <algorithm>
#include <iostream>
#include <vector>

#line 2 "structure/convex-hull-trick/dynamic-li-chao-tree.hpp"

#line 4 "structure/convex-hull-trick/dynamic-li-chao-tree.hpp"
#include <utility>

/**
 * @brief Dynamic-Li-Chao-Tree
 *
 */
template <typename T, T x_low, T x_high, T id>
struct DynamicLiChaoTree {
  struct Line {
    T a, b;

    Line(T a, T b) : a(a), b(b) {}

    inline T get(T x) const { return a * x + b; }
  };

  struct Node {
    Line x;
    Node *l, *r;

    Node(const Line& x) : x{x}, l{nullptr}, r{nullptr} {}
  };

  Node* root;

  DynamicLiChaoTree() : root{nullptr} {}

  Node* add_line(Node* t, Line& x, const T& l, const T& r, const T& x_l,
                 const T& x_r) {
    if (!t) return new Node(x);

    T t_l = t->x.get(l), t_r = t->x.get(r);

    if (t_l <= x_l && t_r <= x_r) {
      return t;
    } else if (t_l >= x_l && t_r >= x_r) {
      t->x = x;
      return t;
    } else {
      T m = (l + r) / 2;
      if (m == r) --m;
      T t_m = t->x.get(m), x_m = x.get(m);
      if (t_m > x_m) {
        std::swap(t->x, x);
        if (x_l >= t_l)
          t->l = add_line(t->l, x, l, m, t_l, t_m);
        else
          t->r = add_line(t->r, x, m + 1, r, t_m + x.a, t_r);
      } else {
        if (t_l >= x_l)
          t->l = add_line(t->l, x, l, m, x_l, x_m);
        else
          t->r = add_line(t->r, x, m + 1, r, x_m + x.a, x_r);
      }
      return t;
    }
  }

  void add_line(const T& a, const T& b) {
    Line x(a, b);
    root = add_line(root, x, x_low, x_high, x.get(x_low), x.get(x_high));
  }

  Node* add_segment(Node* t, Line& x, const T& a, const T& b, const T& l,
                    const T& r, const T& x_l, const T& x_r) {
    if (r < a || b < l) return t;
    if (a <= l && r <= b) {
      Line y{x};
      return add_line(t, y, l, r, x_l, x_r);
    }
    if (t) {
      T t_l = t->x.get(l), t_r = t->x.get(r);
      if (t_l <= x_l && t_r <= x_r) return t;
    } else {
      t = new Node(Line(0, id));
    }
    T m = (l + r) / 2;
    if (m == r) --m;
    T x_m = x.get(m);
    t->l = add_segment(t->l, x, a, b, l, m, x_l, x_m);
    t->r = add_segment(t->r, x, a, b, m + 1, r, x_m + x.a, x_r);
    return t;
  }

  void add_segment(const T& l, const T& r, const T& a, const T& b) {
    Line x(a, b);
    root = add_segment(root, x, l, r - 1, x_low, x_high, x.get(x_low),
                       x.get(x_high));
  }

  T query(const Node* t, const T& l, const T& r, const T& x) const {
    if (!t) return id;
    if (l == r) return t->x.get(x);
    T m = (l + r) / 2;
    if (m == r) --m;
    if (x <= m)
      return std::min(t->x.get(x), query(t->l, l, m, x));
    else
      return std::min(t->x.get(x), query(t->r, m + 1, r, x));
  }

  T query(const T& x) const { return query(root, x_low, x_high, x); }
};
#line 10 "test/verify/yosupo-line-add-get-min.test.cpp"

using namespace std;

constexpr long long kInf = (1LL << 62) - 1;

int main() {
  int N, Q;
  cin >> N >> Q;
  const long long MAX_P = 1000000000;
  DynamicLiChaoTree<long long, -MAX_P, MAX_P, kInf> cht;
  for (int i = 0; i < N; i++) {
    long long a, b;
    cin >> a >> b;
    cht.add_line(a, b);
  }
  while (Q--) {
    int T;
    cin >> T;
    if (T == 0) {
      long long A, B;
      cin >> A >> B;
      cht.add_line(A, B);
    } else {
      long long P;
      cin >> P;
      cout << cht.query(P) << "\n";
    }
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	2 ms	4 MB
g++	half_00	AC	299 ms	4 MB
g++	hand_max_00	AC	711 ms	13 MB
g++	max_random_00	AC	391 ms	4 MB
g++	max_random_01	AC	598 ms	4 MB
g++	max_random_02	AC	594 ms	4 MB
g++	no_output_00	AC	328 ms	4 MB
g++	parabola_random_00	AC	712 ms	13 MB
g++	parabola_random_01	AC	482 ms	13 MB
g++	parabola_random_02	AC	649 ms	13 MB
g++	random_00	AC	274 ms	4 MB
g++	random_01	AC	445 ms	4 MB
g++	random_02	AC	184 ms	4 MB
g++	small_00	AC	2 ms	4 MB
g++	small_01	AC	2 ms	4 MB
clang++	example_00	AC	2 ms	4 MB
clang++	half_00	AC	313 ms	4 MB
clang++	hand_max_00	AC	524 ms	13 MB
clang++	max_random_00	AC	467 ms	4 MB
clang++	max_random_01	AC	388 ms	4 MB
clang++	max_random_02	AC	490 ms	4 MB
clang++	no_output_00	AC	331 ms	4 MB
clang++	parabola_random_00	AC	480 ms	13 MB
clang++	parabola_random_01	AC	506 ms	13 MB
clang++	parabola_random_02	AC	486 ms	13 MB
clang++	random_00	AC	278 ms	4 MB
clang++	random_01	AC	292 ms	3 MB
clang++	random_02	AC	184 ms	4 MB
clang++	small_00	AC	2 ms	4 MB
clang++	small_01	AC	2 ms	4 MB

Back to top page