verify/yosupo/data-structure/segment_add_get_min.test.cpp

View this file on GitHub
Last update: 2024-10-31 23:18:18+07:00
Problem: https://judge.yosupo.jp/problem/segment_add_get_min

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/segment_add_get_min"
#include "template.hpp"
#include "data-structure/convex/li-chao-tree.hpp"

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,q;
    cin >> n >> q;
    vector<tuple<ll,ll,ll,ll>> lines(n);
    vector<ll> xs;
    for(auto &[a,b,l,r]:lines){
        cin >> l >> r >> a >> b;
        r--;
        xs.emplace_back(l);
        xs.emplace_back(r);
    }
    vector<tuple<int,ll,ll,ll,ll>> qrs(q);
    for(auto &[op,a,b,l,r]:qrs){
        cin >> op;
        if(op){
            cin >> a;
            xs.emplace_back(a);
        }else{
            cin >> l >> r >> a >> b;
            r--;
            xs.emplace_back(l);
            xs.emplace_back(r);
        }
    }
    LiChaoTree<ll> lct(xs);
    for(auto [a,b,l,r]:lines)lct.insert_range(a,b,l,r);
    for(auto [op,a,b,l,r]:qrs){
        if(op){
            ll res=lct.query(a);
            if(res>=lct.INF)cout << "INFINITY\n";
            else cout << res << "\n";
        }else{
            lct.insert_range(a,b,l,r);
        }
    }
}

#line 1 "verify/yosupo/data-structure/segment_add_get_min.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/segment_add_get_min"
#line 1 "template.hpp"
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using db = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<db>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pdd = pair<db,db>;
const int INF=INT_MAX/2;
const int MOD=998244353;
const int MOD2=1000000007;
const ll LINF=LLONG_MAX/2;
const db DINF=numeric_limits<db>::infinity();
const db EPS=1e-9;
const db PI=acos(db(-1));

template<class T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T>
using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
#line 2 "data-structure/convex/li-chao-tree.hpp"

/**
 * Author: Teetat T.
 * Date: 2024-06-12
 * Description: Li-Chao Tree (minimize).
 */

template<class T>
struct LiChaoTree{
    static const T INF=numeric_limits<T>::max()/2;
    struct Line{
        T m,c;
        Line(T _m,T _c):m(_m),c(_c){}
        inline T eval(T x)const{return m*x+c;}
    };
    vector<T> xs;
    vector<Line> t;
    LiChaoTree(){}
    LiChaoTree(const vector<T> &x):xs(x){init(x);}
    LiChaoTree(int n):xs(n){
        vector<T> x(n);
        iota(x.begin(),x.end(),0);
        init(x);
    }
    void init(const vector<T> &x){
        xs=x;
        sort(xs.begin(),xs.end());
        xs.erase(unique(xs.begin(),xs.end()),xs.end());
        t.assign(4<<(31-__builtin_clz(xs.size())),Line(0,INF));
    }
    void insert(int l,int r,int i,Line v){
        int m=(l+r)/2;
        if(v.eval(xs[m])<t[i].eval(xs[m]))swap(t[i],v);
        if(v.eval(xs[l])<t[i].eval(xs[l]))insert(l,m,i*2,v);
        if(v.eval(xs[r])<t[i].eval(xs[r]))insert(m+1,r,i*2+1,v);
    }
    inline void insert(T m,T c){
        insert(0,(int)xs.size()-1,1,Line(m,c));
    }
    void insert_range(int l,int r,int i,T x,T y,Line v){
        if(y<xs[l]||xs[r]<x)return;
        if(x<=xs[l]&&xs[r]<=y)return insert(l,r,i,v);
        int m=(l+r)/2;
        insert_range(l,m,i*2,x,y,v);
        insert_range(m+1,r,i*2+1,x,y,v);
    }
    inline void insert_range(T m,T c,T x,T y){
        insert_range(0,(int)xs.size()-1,1,x,y,Line(m,c));
    }
    T query(int l,int r,int i,T x){
        if(l==r)return t[i].eval(x);
        int m=(l+r)/2;
        if(x<=xs[m])return min(t[i].eval(x),query(l,m,i*2,x));
        return min(t[i].eval(x),query(m+1,r,i*2+1,x));
    }
    inline T query(T x){
        return query(0,(int)xs.size()-1,1,x);
    }
};

#line 4 "verify/yosupo/data-structure/segment_add_get_min.test.cpp"

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,q;
    cin >> n >> q;
    vector<tuple<ll,ll,ll,ll>> lines(n);
    vector<ll> xs;
    for(auto &[a,b,l,r]:lines){
        cin >> l >> r >> a >> b;
        r--;
        xs.emplace_back(l);
        xs.emplace_back(r);
    }
    vector<tuple<int,ll,ll,ll,ll>> qrs(q);
    for(auto &[op,a,b,l,r]:qrs){
        cin >> op;
        if(op){
            cin >> a;
            xs.emplace_back(a);
        }else{
            cin >> l >> r >> a >> b;
            r--;
            xs.emplace_back(l);
            xs.emplace_back(r);
        }
    }
    LiChaoTree<ll> lct(xs);
    for(auto [a,b,l,r]:lines)lct.insert_range(a,b,l,r);
    for(auto [op,a,b,l,r]:qrs){
        if(op){
            ll res=lct.query(a);
            if(res>=lct.INF)cout << "INFINITY\n";
            else cout << res << "\n";
        }else{
            lct.insert_range(a,b,l,r);
        }
    }
}