#define PROBLEM "https://judge.yosupo.jp/problem/segment_add_get_min" #include "../li_chao_tree.hpp" #include "../../util/template.hpp" int main(){ lint n,q; cin>>n>>q; LHT<lint>lht; while(n--){ lint l,r,s,t; cin>>l>>r>>s>>t; lht.add_segment(l,r,s,t); } while(q--){ lint c; cin>>c; if(c==0){ lint l,r,s,t; cin>>l>>r>>s>>t; lht.add_segment(l,r,s,t); }else{ lint x; cin>>x; lint t=lht.get(x); if(t==std::numeric_limits<lint>::max())cout<<"INFINITY"<<endl; else cout<<t<<endl; } } }
#line 1 "data_structure/test/LC_segment_add_get_min.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/segment_add_get_min" #line 2 "data_structure/li_chao_tree.hpp" #include<limits> #include<cmath> #include<algorithm> /** * @brief LiChaoTree */ template<typename T> class LHT{ using lint = long long; struct node; using np = node*; struct node{ T a,b; np ch[2]={nullptr,nullptr}; node(T a,T b):a(a),b(b){} }; np root=nullptr; T sign(T x){return (x>0)-(x<0);} np update(T a,T b,lint p,lint q,lint l,lint r,np t){ if(!t)t=new node(0,std::numeric_limits<T>::max()); //区間外 if(r<=p||q<=l)return t; //全て区間内 if(p<=l&&r<=q){ lint m=(l+r)/2; if(a*m+b<=(t->a)*m+(t->b)){ std::swap(a,t->a); std::swap(b,t->b); } if(r-l==1||a==t->a)return t; if(sign((a-t->a)*l+(b-t->b))*sign((a-t->a)*m+(b-t->b))<=0)t->ch[0]=update(a,b,p,q,l,m,t->ch[0]); if(sign((a-t->a)*m+(b-t->b))*sign((a-t->a)*r+(b-t->b))<=0)t->ch[1]=update(a,b,p,q,m,r,t->ch[1]); return t; } //一部区間内 t->ch[0]=update(a,b,p,q,l,(l+r)/2,t->ch[0]); t->ch[1]=update(a,b,p,q,(l+r)/2,r,t->ch[1]); return t; } T get(lint x,lint l,lint r,np t){ if(!t)return std::numeric_limits<T>::max(); if(r-l==1)return t->a*x+t->b; lint m=(l+r)/2; if(l<=x&&x<m)return std::min(t->a*x+t->b,get(x,l,m,t->ch[0])); else return std::min(t->a*x+t->b,get(x,m,r,t->ch[1])); } lint mn; lint mx; public: LHT(lint mn=-1LL<<30,lint mx=1LL<<30):mn(mn),mx(mx){} T get(lint x){ return get(x,mn,mx,root); } void add_line(T a,T b){ root=update(a,b,mn,mx,mn,mx,root); } void add_segment(lint l,lint r,T a,T b){ root=update(a,b,l,r,mn,mx,root); } }; #line 2 "util/template.hpp" #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC target("avx2") #include<bits/stdc++.h> using namespace std; struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__; typedef long long lint; #define INF (1LL<<60) #define IINF (1<<30) #define EPS (1e-10) #define endl ('\n') typedef vector<lint> vec; typedef vector<vector<lint>> mat; typedef vector<vector<vector<lint>>> mat3; typedef vector<string> svec; typedef vector<vector<string>> smat; template<typename T>using V=vector<T>; template<typename T>using VV=V<V<T>>; template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;} template<typename T>inline void output2(T t){for(auto i:t)output(i);} template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;} template<typename T>inline void debug2(T t){for(auto i:t)output(i);} #define loop(n) for(long long _=0;_<(long long)(n);++_) #define _overload4(_1,_2,_3,_4,name,...) name #define __rep(i,a) repi(i,0,a,1) #define _rep(i,a,b) repi(i,a,b,1) #define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c) #define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__) #define _overload3_rev(_1,_2,_3,name,...) name #define _rep_rev(i,a) repi_rev(i,0,a) #define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i) #define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__) // #define rep(i,...) for(auto i:range(__VA_ARGS__)) // #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__))) // #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i) // #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i) // #define irep(i) for(lint i=0;;++i) // inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;} // inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;} // inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;} // template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;} #define all(n) begin(n),end(n) template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;} template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;} const vector<lint> dx={1,0,-1,0,1,1,-1,-1}; const vector<lint> dy={0,1,0,-1,1,-1,1,-1}; #define SUM(v) accumulate(all(v),0LL) template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));} #define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__})) #define bit(n,a) ((n>>a)&1) vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;} using graph=vector<vector<int>>; template<typename T>using graph_w=vector<vector<pair<int,T>>>; template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;} constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;} #line 4 "data_structure/test/LC_segment_add_get_min.test.cpp" int main(){ lint n,q; cin>>n>>q; LHT<lint>lht; while(n--){ lint l,r,s,t; cin>>l>>r>>s>>t; lht.add_segment(l,r,s,t); } while(q--){ lint c; cin>>c; if(c==0){ lint l,r,s,t; cin>>l>>r>>s>>t; lht.add_segment(l,r,s,t); }else{ lint x; cin>>x; lint t=lht.get(x); if(t==std::numeric_limits<lint>::max())cout<<"INFINITY"<<endl; else cout<<t<<endl; } } }