verify/data-structure/LC_segment_add_get_min.dynamic_li_chao_tree.test.cpp

• View this file on GitHub
• Last update: 2026-08-11 23:01:09+09:00
• Problem: https://judge.yosupo.jp/problem/segment_add_get_min

Depends on

• Dynamic Li Chao Tree (data-structure/dynamic-li-chao-tree.hpp)
• template/debug.hpp
• template/inout.hpp
• template/macro.hpp
• template/template.hpp
• template/util.hpp

Code

#define PROBLEM "https://judge.yosupo.jp/problem/segment_add_get_min"

#include "template/template.hpp"
#include "data-structure/dynamic-li-chao-tree.hpp"

int main() {
  constexpr ll C = 1000000000;
  const ll INF = 1LL << 62;
  int n, q;
  in(n, q);
  DynamicLiChaoTree<ll> cht(-C, C + 1, INF);
  rep(i, 0, n) {
    ll l, r, a, b;
    in(l, r, a, b);
    cht.add_segment(l, r, a, b);
  }
  while (q--) {
    int type;
    in(type);
    if (type == 0) {
      ll l, r, a, b;
      in(l, r, a, b);
      cht.add_segment(l, r, a, b);
    } else {
      ll p;
      in(p);
      ll ans = cht.get(p);
      if (ans == INF)
        out("INFINITY");
      else
        out(ans);
    }
  }
}

#line 1 "verify/data-structure/LC_segment_add_get_min.dynamic_li_chao_tree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/segment_add_get_min"

#line 2 "template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#line 2 "template/macro.hpp"
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; i >= (a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())
#define YN(b) cout << ((b) ? "YES" : "NO") << "\n";
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define yn(b) cout << ((b) ? "yes" : "no") << "\n";
#line 6 "template/template.hpp"

#line 2 "template/util.hpp"
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
template <class T>
using priority_queue_asc = priority_queue<T, vector<T>, greater<T>>;

template <class T, class S = T>
S SUM(const vector<T>& a) {
  return accumulate(ALL(a), S(0));
}
template <class T1, class T2>
inline bool chmin(T1& a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmax(T1& a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmin_opt(optional<T1>& a, T2 b) {
  if (!a || a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmax_opt(optional<T1>& a, T2 b) {
  if (!a || a < b) {
    a = b;
    return true;
  }
  return false;
}

template <class T>
int popcnt(T x) {
  return __builtin_popcountll(x);
}
template <class T>
int topbit(T x) {
  return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <class T>
int lowbit(T x) {
  return (x == 0 ? -1 : __builtin_ctzll(x));
}
#line 8 "template/template.hpp"

#line 2 "template/inout.hpp"
struct Fast {
  Fast() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} fast;

ostream& operator<<(ostream& os, __uint128_t x) {
  char buf[40];
  size_t k = 0;
  while (x > 0) buf[k++] = (char)(x % 10 + '0'), x /= 10;
  if (k == 0) buf[k++] = '0';
  while (k) os << buf[--k];
  return os;
}
ostream& operator<<(ostream& os, __int128_t x) {
  return x < 0 ? (os << '-' << (__uint128_t)(-x)) : (os << (__uint128_t)x);
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a);
template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << " " << p.second;
}
template <class T>
istream& operator>>(istream& is, vector<T>& a) {
  for (auto& v : a) is >> v;
  return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& a) {
  for (auto it = a.begin(); it != a.end();) {
    os << *it;
    if (++it != a.end()) os << " ";
  }
  return os;
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a) {
  for (auto it = a.begin(); it != a.end();) {
    os << *it;
    if (++it != a.end()) os << " ";
  }
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& st) {
  os << "{";
  for (auto it = st.begin(); it != st.end();) {
    os << *it;
    if (++it != st.end()) os << ",";
  }
  os << "}";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2>& mp) {
  os << "{";
  for (auto it = mp.begin(); it != mp.end();) {
    os << it->first << ":" << it->second;
    if (++it != mp.end()) os << ",";
  }
  os << "}";
  return os;
}

void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
  cin >> t;
  in(u...);
}
template <class... T>
void in_zip(int n, T&... t) {
  assert(n >= 0 && ((size(t) >= static_cast<size_t>(n)) && ...));
  for (int i = 0; i < n; i++) in(t[i]...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T& t, const U&... u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}
template <class T, class U>
void out_opt(const optional<T>& opt, const U& fallback, ostream& os = cout) {
  if (opt.has_value())
    os << opt.value();
  else
    os << fallback;
  os << "\n";
}
template <class T, class U>
void out_opt(const vector<optional<T>>& vec, const U& fallback, ostream& os = cout) {
  for (auto it = vec.begin(); it != vec.end();) {
    if ((*it).has_value())
      os << (*it).value();
    else
      os << fallback;
    if (++it != vec.end()) os << " ";
  }
  os << "\n";
}

namespace IO {
template <class T, class... U>
T read(U&&... u) {
  T t = T(forward<U>(u)...);
  in(t);
  return t;
}
namespace Graph {
vector<vector<int>> unweighted(int n, int m, bool directed = false, int offset = 1) {
  vector<vector<int>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    u -= offset, v -= offset;
    g[u].push_back(v);
    if (!directed) g[v].push_back(u);
  }
  return g;
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, int m, bool directed = false, int offset = 1) {
  vector<vector<pair<int, T>>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    T w;
    cin >> u >> v >> w;
    u -= offset, v -= offset;
    g[u].push_back({v, w});
    if (!directed) g[v].push_back({u, w});
  }
  return g;
}
}  // namespace Graph
namespace Tree {
vector<vector<int>> unweighted(int n, bool directed = false, int offset = 1) {
  return Graph::unweighted(n, n - 1, directed, offset);
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, bool directed = false, int offset = 1) {
  return Graph::weighted<T>(n, n - 1, directed, offset);
}
vector<vector<int>> rooted(int n, bool to_root = true, bool to_leaf = true, int offset = 1) {
  vector<vector<int>> g(n);
  for (int i = 1; i < n; i++) {
    int p;
    cin >> p;
    p -= offset;
    if (to_root) g[i].push_back(p);
    if (to_leaf) g[p].push_back(i);
  }
  return g;
}
}  // namespace Tree
}  // namespace IO
#line 10 "template/template.hpp"

#line 2 "template/debug.hpp"
#ifdef LOCAL
#define debug 1
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define debug 0
#define show(...) true
#endif
template <class T>
void _show(int, T) {
  cerr << '\n';
}
template <class T1, class T2, class... T3>
void _show(int i, const T1& a, const T2& b, const T3&... c) {
  for (; a[i] != ',' && a[i] != '\0'; i++) cerr << a[i];
  cerr << ":" << b << " ";
  _show(i + 1, a, c...);
}
#line 2 "data-structure/dynamic-li-chao-tree.hpp"

template <class T>
struct DynamicLiChaoTree {
  struct Line {
    T a, b;
    Line() : a(0), b(0) {}
    Line(T a_, T b_) : a(a_), b(b_) {}
    T get(T x) const { return a * x + b; }
  };

 private:
  struct Node {
    Line line;
    int l, r;
    Node(Line line_) : line(line_), l(-1), r(-1) {}
  };

  T xl, xr, inf;
  vector<Node> nodes;
  int root;

 public:
  DynamicLiChaoTree() : DynamicLiChaoTree(0, 1) {}
  DynamicLiChaoTree(T xl_, T xr_, T inf_ = numeric_limits<T>::max() / 4)
      : xl(xl_), xr(xr_), inf(inf_), root(-1) {
    assert(xl < xr);
  }

  void add_line(T a, T b) { add_line(Line(a, b)); }
  void add_line(Line line) { root = add_line(root, xl, xr, line); }
  void add_segment(T l, T r, T a, T b) { add_segment(l, r, Line(a, b)); }
  void add_segment(T l, T r, Line line) {
    l = max(l, xl);
    r = min(r, xr);
    if (l >= r) return;
    root = add_segment(root, xl, xr, l, r, line);
  }
  T get(T x) const {
    assert(xl <= x && x < xr);
    return get(root, xl, xr, x);
  }
  T query(T x) const { return get(x); }
  int node_count() const { return nodes.size(); }

 private:
  int new_node(Line line) {
    nodes.emplace_back(line);
    return (int)nodes.size() - 1;
  }
  int add_line(int k, T l, T r, Line line) {
    if (k == -1) {
      return new_node(line);
    }
    T m = l + (r - l) / 2;
    T rr = r - 1;
    Line low = nodes[k].line, high = line;
    if (low.get(m) > high.get(m)) swap(low, high);
    nodes[k].line = low;
    if (r - l == 1) return k;
    if (low.get(l) > high.get(l)) {
      nodes[k].l = add_line(nodes[k].l, l, m, high);
    } else if (low.get(rr) > high.get(rr)) {
      nodes[k].r = add_line(nodes[k].r, m, r, high);
    }
    return k;
  }
  int add_segment(int k, T l, T r, T ql, T qr, Line line) {
    if (qr <= l || r <= ql) return k;
    if (ql <= l && r <= qr) {
      return add_line(k, l, r, line);
    }
    if (k == -1) k = new_node(Line(0, inf));
    T m = l + (r - l) / 2;
    nodes[k].l = add_segment(nodes[k].l, l, m, ql, qr, line);
    nodes[k].r = add_segment(nodes[k].r, m, r, ql, qr, line);
    return k;
  }
  T get(int k, T l, T r, T x) const {
    if (k == -1) return inf;
    T ret = nodes[k].line.get(x);
    if (r - l == 1) return ret;
    T m = l + (r - l) / 2;
    if (x < m) return min(ret, get(nodes[k].l, l, m, x));
    return min(ret, get(nodes[k].r, m, r, x));
  }
};

/**
 * @brief Dynamic Li Chao Tree
 * @docs docs/data-structure/dynamic-li-chao-tree.md
 */
#line 5 "verify/data-structure/LC_segment_add_get_min.dynamic_li_chao_tree.test.cpp"

int main() {
  constexpr ll C = 1000000000;
  const ll INF = 1LL << 62;
  int n, q;
  in(n, q);
  DynamicLiChaoTree<ll> cht(-C, C + 1, INF);
  rep(i, 0, n) {
    ll l, r, a, b;
    in(l, r, a, b);
    cht.add_segment(l, r, a, b);
  }
  while (q--) {
    int type;
    in(type);
    if (type == 0) {
      ll l, r, a, b;
      in(l, r, a, b);
      cht.add_segment(l, r, a, b);
    } else {
      ll p;
      in(p);
      ll ans = cht.get(p);
      if (ans == INF)
        out("INFINITY");
      else
        out(ans);
    }
  }
}

Back to top page