tests/Line_Add_Get_Min.test.cpp

View this file on GitHub
Last update: 2025-11-28 02:09:51+07:00
Problem: https://judge.yosupo.jp/problem/line_add_get_min

Depends on

Code

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

#include "../misc/macros.h"
#include "../ds/LineContainer.h"

void solve() {
  int n, q;
  cin >> n >> q;
  LineContainer cht;
  for (int i = 0; i < n; ++i) {
    i64 a, b;
    cin >> a >> b;
    cht.add(-a, -b);
  }
  while (q--) {
    int cmd;
    cin >> cmd;
    if (cmd == 0) {
      i64 a, b;
      cin >> a >> b;
      cht.add(-a, -b);
    } else {
      i64 p;
      cin >> p;
      cout << -cht.query(p) << '\n';
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int tc = 1;
  // cin >> tc;
  for (int i = 1; i <= tc; ++i) {
    solve();
  }
}

#line 1 "tests/Line_Add_Get_Min.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/line_add_get_min"

#line 1 "misc/macros.h"
// #pragma GCC optimize("Ofast,unroll-loops")       // unroll long, simple loops
// #pragma GCC target("avx2,fma")                   // vectorizing code
// #pragma GCC target("lzcnt,popcnt,abm,bmi,bmi2")  // for fast bitset operation

#include <bits/extc++.h>
#include <tr2/dynamic_bitset>

using namespace std;
using namespace __gnu_pbds;  // ordered_set, gp_hash_table
// using namespace __gnu_cxx; // rope

// for templates to work
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define pb push_back
#define eb emplace_back
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using ld = long double;
using pii = pair<i32, i32>;
using vi = vector<i32>;

// fast map
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash {  // customize hash function for gp_hash_table
  int operator()(int x) const { return x ^ RANDOM; }
};
gp_hash_table<int, int, chash> table;

/* ordered set
    find_by_order(k): returns an iterator to the k-th element (0-based)
    order_of_key(k): returns the number of elements in the set that are strictly less than k
*/
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

/*  rope
    rope <int> cur = v.substr(l, r - l + 1);
    v.erase(l, r - l + 1);
    v.insert(v.mutable_begin(), cur);
*/
#line 1 "ds/LineContainer.h"
struct Line {
  mutable i64 k, m, p;
  bool operator<(const Line& o) const { return k < o.k; }
  bool operator<(i64 x) const { return p < x; }
};

struct LineContainer : multiset<Line, less<>> {
  // (for lds, use inf = 1/.0, div(a,b) = a/b)
  static const i64 inf = LLONG_MAX;
  i64 div(i64 a, i64 b) {  // floored division
    return a / b - ((a ^ b) < 0 && a % b);
  }
  bool isect(iterator x, iterator y) {
    if (y == end()) return x->p = inf, 0;
    if (x->k == y->k)
      x->p = x->m > y->m ? inf : -inf;
    else
      x->p = div(y->m - x->m, x->k - y->k);
    return x->p >= y->p;
  }
  void add(i64 k, i64 m) {
    auto z = insert({k, m, 0}), y = z++, x = y;
    while (isect(y, z)) z = erase(z);
    if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
    while ((y = x) != begin() && (--x)->p >= y->p) isect(x, erase(y));
  }
  i64 query(i64 x) { // return max
    assert(!empty());
    auto l = *lower_bound(x);
    return l.k * x + l.m;
  }
};
#line 5 "tests/Line_Add_Get_Min.test.cpp"

void solve() {
  int n, q;
  cin >> n >> q;
  LineContainer cht;
  for (int i = 0; i < n; ++i) {
    i64 a, b;
    cin >> a >> b;
    cht.add(-a, -b);
  }
  while (q--) {
    int cmd;
    cin >> cmd;
    if (cmd == 0) {
      i64 a, b;
      cin >> a >> b;
      cht.add(-a, -b);
    } else {
      i64 p;
      cin >> p;
      cout << -cht.query(p) << '\n';
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int tc = 1;
  // cin >> tc;
  for (int i = 1; i <= tc; ++i) {
    solve();
  }
}