# Submit Info #2590

Problem Lang User Status Time Memory
Segment Add Get Min cpp Nyaan AC 582 ms 43.35 MiB

ケース詳細
Name Status Time Memory
all_twice_00 AC 298 ms 34.72 MiB
example_00 AC 7 ms 0.55 MiB
example_01 AC 6 ms 0.59 MiB
max_random_00 AC 560 ms 43.27 MiB
max_random_01 AC 582 ms 43.35 MiB
max_random_02 AC 569 ms 43.34 MiB
random_00 AC 387 ms 35.64 MiB
random_01 AC 404 ms 36.60 MiB
random_02 AC 214 ms 20.61 MiB
small_00 AC 6 ms 0.62 MiB
small_01 AC 7 ms 0.64 MiB

#include <bits/stdc++.h> #define pb push_back #define eb emplace_back #define fi first #define se second #define rep(i,N) for(long long i = 0; i < (long long)(N); i++) #define repr(i,N) for(long long i = (long long)(N) - 1; i >= 0; i--) #define rep1(i,N) for(long long i = 1; i <= (long long)(N) ; i++) #define repr1(i,N) for(long long i = (N) ; (long long)(i) > 0 ; i--) #define each(x,v) for(auto& x : v) #define all(v) (v).begin(),(v).end() #define sz(v) ((int)(v).size()) #define ini(...) int __VA_ARGS__; in(__VA_ARGS__) #define inl(...) long long __VA_ARGS__; in(__VA_ARGS__) #define ins(...) string __VA_ARGS__; in(__VA_ARGS__) using namespace std; void solve(); using ll = long long; template<class T = ll> using V = vector<T>; using vi = V<int>; using vl = V<>; using vvi = V< V<int> >; constexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1; struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya; template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; } template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; } template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; } template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; } void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);} void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);} template<typename T>void die(T x){out(x); exit(0);} #ifdef NyaanDebug #include "NyaanDebug.h" #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0) #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0) #else #define trc(...) #define trca(...) int main(){solve();} #endif using P = pair<ll,ll>; using vp = V<P>; constexpr int MOD = /**/ 1000000007; //*/ 998244353; ////////// template<typename T, T INF> struct LiChaoTree{ struct Line{ T slope , intercept; Line(T slope,T intercept) : slope(slope),intercept(intercept){} inline T get(T x) const{ return slope * x + intercept; } inline bool over(const Line& other , const T &x) const{ return get(x) < other.get(x); } }; // remind セグ木は0-indexedの実装 vector<T> xset; vector<Line> seg; int _size; // 引数xにはx座標の集合を入れる LiChaoTree(const vector<T> &x) : xset(x) { sort( xset.begin() , xset.end() ); xset.erase( unique(xset.begin() , xset.end() ) , xset.end() ); _size = 1; while( _size < (int)xset.size() ) _size <<= 1; while( (int)xset.size() < _size ) xset.push_back(xset.back() + 1); seg.assign( 2 * _size , Line(0, INF) ); } // 以上 xset[max]以下であることを仮定 int get_more_idx(T k){ return lower_bound( xset.begin() , xset.end() , k ) - xset.begin(); } // 以下 xset[0]以上であることを仮定 int get_less_idx(T k){ int ret = upper_bound( xset.begin() , xset.end() , k ) - xset.begin(); return max(0 , ret - 1); } // 内部用 void inner_update(T a, T b, int left, int right, int seg_idx){ Line line(a , b); while(1){ int mid = (left + right) >> 1; bool l_over = line.over(seg[seg_idx], xset[left] ); bool r_over = line.over(seg[seg_idx], xset[right-1] ); if(l_over == r_over){ if(l_over) swap(seg[seg_idx] , line); return; } bool m_over = line.over(seg[seg_idx], xset[mid] ); if(m_over) swap(seg[seg_idx], line); if(l_over != m_over) seg_idx = (seg_idx << 1) , right = mid; else seg_idx = (seg_idx<<1) | 1 , left = mid; } } // 内部用 void inner_update(T a, T b, int seg_idx){ int left , right; int upper_bit = 31 - __builtin_clz(seg_idx); left = (_size >> upper_bit) * (seg_idx - (1 << upper_bit) ); right = left + (_size >> upper_bit); inner_update(a , b , left , right , seg_idx); } // y = ax + bなる直線を追加 void update(T a, T b){ inner_update(a , b , 0 , _size , 1); } // 閉区間x in [left , right]に線分y = ax + bを追加するクエリ void update_line_segment(T a,T b,T low,T high){ int left = get_more_idx(low) + _size; int right= get_less_idx(high)+ _size + 1; for( ; left < right; left >>= 1 , right >>= 1){ if(left & 1) inner_update(a , b , left++); if(right& 1) inner_update(a , b , --right); } } T inner_query(int x , int segidx){ T ret = seg[segidx].get(x); while(segidx > 1){ segidx = segidx >> 1; ret = min(ret , seg[segidx].get(x) ); } return ret; } // x = xset[k]なる点における最小値クエリ T query_idx(int k) { const T x = xset[k]; k += _size; return inner_query(x , k); } // xにおける最小クエリ T query(T x){ return query_idx( get_more_idx(x) ); } }; void solve(){ ini(N , Q); vector<ll> xset; xset.pb(-inf); xset.pb(inf); vector<ll> l(N) , r(N) , a(N) , b(N); vector<ll> C(Q) , L(Q) , R(Q) , A(Q) , B(Q); rep(i , N) in(l[i] , r[i] , a[i] , b[i]); rep(i , Q){ in(C[i]); if(C[i] == 0) in(L[i] , R[i] , A[i] , B[i]); else in(L[i]); } rep(i , N) {xset.pb(L[i]); xset.pb(R[i]);} rep(i , Q) { xset.pb(L[i]); if(C[i] == 0) xset.pb(R[i] - 1); } LiChaoTree<ll , infLL> lichao(xset); rep(i , N) lichao.update_line_segment(a[i] , b[i] , l[i] , r[i] - 1); rep(i , Q){ if(C[i] == 0) lichao.update_line_segment(A[i] , B[i] , L[i] , R[i] - 1); else { ll ans = lichao.query(L[i]); if(ans >= infLL) out("INFINITY"); else out(ans); } } }