tests/ds/li_chao_tree.test.cpp

View this file on GitHub
Last update: 2021-09-12 23:20:08-04: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 "../../template.hpp"
#include "../test_utils.hpp"
#include "../../ds/li_chao_tree.hpp"

int main() {
    fast_io();
    int N = readi(), Q = readi();
    LiChaoTree<ll, -ll(1e9), ll(1e9)> li;
    for (auto [m, b] : readv<pll>(N))
        li.insert({m, b});
    while (Q--) {
        if (readi() == 0) {
            ll a = readl(), b = readl();
            li.insert({a, b});
        }
        else {
            int p = readi();
            print(li.query(p));
        }
    }
}

#line 1 "tests/ds/li_chao_tree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/line_add_get_min"
#line 2 "template.hpp"
#include <bits/stdc++.h>
#define DEBUG 1
using namespace std;

// Defines
#define fs first
#define sn second
#define pb push_back
#define eb emplace_back
#define mpr make_pair
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
// Basic type definitions
#if __cplusplus == 201703L // CPP17 only things
template <typename T> using opt_ref = optional<reference_wrapper<T>>; // for some templates
#endif
using ll = long long; using ull = unsigned long long; using ld = long double;
using pii = pair<int, int>; using pll = pair<long long, long long>;
#ifdef __GNUG__
// PBDS order statistic tree
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T, class comp = less<T>> using os_tree = tree<T, null_type, comp, rb_tree_tag, tree_order_statistics_node_update>;
template <typename K, typename V, class comp = less<K>> using treemap = tree<K, V, comp, rb_tree_tag, tree_order_statistics_node_update>;
// HashSet
#include <ext/pb_ds/assoc_container.hpp>
template <typename T, class Hash> using hashset = gp_hash_table<T, null_type, Hash>;
template <typename K, typename V, class Hash> using hashmap = gp_hash_table<K, V, Hash>;
const ll RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash { ll operator()(ll x) const { return x ^ RANDOM; } };
#endif
// More utilities
int SZ(string &v) { return v.length(); }
template <typename C> int SZ(C &v) { return v.size(); }
template <typename C> void UNIQUE(vector<C> &v) { sort(v.begin(), v.end()); v.resize(unique(v.begin(), v.end()) - v.begin()); }
template <typename T, typename U> void maxa(T &a, U b) { a = max(a, b); }
template <typename T, typename U> void mina(T &a, U b) { a = min(a, b); }
const ll INF = 0x3f3f3f3f, LLINF = 0x3f3f3f3f3f3f3f3f;
#line 3 "tests/test_utils.hpp"

// I/O
template <typename T> void print(T v) {
    cout << v << '\n';
}

template <typename T, typename... Rest> void print(T v, Rest... vs) {
    cout << v << ' ';
    print(vs...);
}

void fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

// Reading operators
template <typename T, typename U> istream& operator>>(istream& in, pair<T, U> &o) {
    return in >> o.first >> o.second;
}

// Read helpers
int readi() {
    int x; cin >> x;
    return x;
}

ll readl() {
    ll x; cin >> x;
    return x;
}

template <typename T> vector<T> readv(int n) {
    vector<T> res(n);
    for (auto &x : res) cin >> x;
    return res;
}

// Functional stuff
template <typename T> vector<pair<int, T>> enumerate(vector<T> v, int start = 0) {
    vector<pair<int, T>> res;
    for (auto &x : v)
        res.emplace_back(start++, x);
    return res;
}

#line 1 "ds/li_chao_tree.hpp"
template <typename T> struct Line {
    T m, b;
    Line(T m0, T b0) : m(m0), b(b0) {}
    T eval(T x) { return x * m + b; }
};
template <typename T, ll MINX = (ll)-1e6, ll MAXX = (ll)1e6> struct LiChaoTree { // Just *-1 if you want to do max lol
    using line = Line<T>;
    struct Node {
        Node *l = nullptr, *r = nullptr;
        line val{0, LLINF};
        Node(Node *l0, Node *r0, line v0) : l(l0), r(r0), val(v0) {}
    };
    Node *rt = nullptr;
    void _insert(line ln, Node *&n, ll l, ll r) {
        if (l > r) return;
        if (!n) {
            n = new Node(nullptr, nullptr, ln);
            return;
        }
        ll mid = (l + r) / 2;
        bool lDom = ln.eval(l) < n->val.eval(l), mDom = ln.eval(mid) < n->val.eval(mid);
        if (mDom) swap(ln, n->val);
        if (l == r) return; // base case
        if (lDom != mDom) _insert(ln, n->l, l, mid);
        else _insert(ln, n->r, mid + 1, r);
    }
    ll _query(ll x, Node *n, ll l, ll r) {
        if (!n) return LLINF;
        ll res = n->val.eval(x), mid = (l + r) / 2;
        if (l != r) {
            if (x < mid) res = min(res, _query(x, n->l, l, mid));
            else res = min(res, _query(x, n->r, mid + 1, r));
        }
        return res;
    }
    void insert(line ln) { _insert(ln, rt, MINX, MAXX); }
    ll query(ll x) { return _query(x, rt, MINX, MAXX); }
};
#line 5 "tests/ds/li_chao_tree.test.cpp"

int main() {
    fast_io();
    int N = readi(), Q = readi();
    LiChaoTree<ll, -ll(1e9), ll(1e9)> li;
    for (auto [m, b] : readv<pll>(N))
        li.insert({m, b});
    while (Q--) {
        if (readi() == 0) {
            ll a = readl(), b = readl();
            li.insert({a, b});
        }
        else {
            int p = readi();
            print(li.query(p));
        }
    }
}