CP-templates

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub Misuki743/CP-templates

:heavy_check_mark: test/segment_add_get_min.test.cpp

Depends on

Code

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

#include "../default/t.cpp"
#include "../segtree/lichaoSegmentTree.cpp"

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, q; cin >> n >> q;
  vector<array<ll, 4>> c(n);
  for(auto &[l, r, a, b] : c)
    cin >> l >> r >> a >> b;
  vector<array<ll, 5>> query(q);
  for(auto &[t, x, y, z, w] : query) {
    cin >> t;
    if (t == 0)
      cin >> x >> y >> z >> w;
    else
      cin >> x;
  }

  vector<ll> xs;
  for(auto &[l, r, a, b] : c) {
    xs.emplace_back(l);
    xs.emplace_back(r);
  }
  for(auto &[t, x, y, z, w] : query) {
    if (t == 0) {
      xs.emplace_back(x);
      xs.emplace_back(y);
    } else {
      xs.emplace_back(x);
    }
  }
  ranges::sort(xs);
  xs.resize(unique(xs.begin(), xs.end()) - xs.begin());
  for(auto &[l, r, a, b] : c) {
    l = ranges::lower_bound(xs, l) - xs.begin();
    r = ranges::lower_bound(xs, r) - xs.begin();
  }
  for(auto &[t, x, y, z, w] : query) {
    if (t == 0) {
      x = ranges::lower_bound(xs, x) - xs.begin();
      y = ranges::lower_bound(xs, y) - xs.begin();
    } else {
      x = ranges::lower_bound(xs, x) - xs.begin();
    }
  }

  lichaoSegmentTree<ll, LLONG_MAX> st(bit_ceil(xs.size()), xs);
  for(auto &[l, r, a, b] : c)
    st.insertRange(l, r, a, b);
  for(auto &[t, x, y, z, w] : query) {
    if (t == 0) {
      st.insertRange(x, y, z, w);
    } else {
      if (ll ans = st.query(x); ans == LLONG_MAX)
        cout << "INFINITY\n";
      else
        cout << ans << '\n';
    }
      
  }

  return 0;
}
#line 1 "test/segment_add_get_min.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/segment_add_get_min"

#line 1 "default/t.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>
#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>

#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define clock chrono::steady_clock::now().time_since_epoch().count()

using namespace std;

template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(size_t i = 0; T x : arr) {
    os << x;
    if (++i != N) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(size_t i = 0; T x : vec) {
    os << x;
    if (++i != size(vec)) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(size_t i = 0; T x : s) {
    os << x;
    if (++i != size(s)) os << ' ';
  }
  return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2> &m) {
  for(size_t i = 0; pair<T1, T2> x : m) {
    os << x;
    if (++i != size(m)) os << ' ';
  }
  return os;
}

#ifdef DEBUG
#define dbg(...) cerr << '(', _do(#__VA_ARGS__), cerr << ") = ", _do2(__VA_ARGS__)
template<typename T> void _do(T &&x) { cerr << x; }
template<typename T, typename ...S> void _do(T &&x, S&&...y) { cerr << x << ", "; _do(y...); }
template<typename T> void _do2(T &&x) { cerr << x << endl; }
template<typename T, typename ...S> void _do2(T &&x, S&&...y) { cerr << x << ", "; _do2(y...); }
#else
#define dbg(...)
#endif

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using max_heap = priority_queue<T>;

template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP = plus<T>>
void pSum(rng &v) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = OP()(p, x);
}
template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP>
void pSum(rng &v, OP op) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = op(p, x);
}

template<ranges::forward_range rng>
void Unique(rng &v) {
  ranges::sort(v);
  v.resize(unique(v.begin(), v.end()) - v.begin());
}

template<ranges::random_access_range rng>
rng invPerm(rng p) {
  rng ret = p;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = i;
  return ret;
}

template<ranges::random_access_range rng, ranges::random_access_range rng2>
rng Permute(rng v, rng2 p) {
  rng ret = v;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = v[i];
  return ret;
}

template<bool directed>
vector<vector<int>> readGraph(int n, int m, int base) {
  vector<vector<int>> g(n);
  for(int i = 0; i < m; i++) {
    int u, v; cin >> u >> v;
    u -= base, v -= base;
    g[u].emplace_back(v);
    if constexpr (!directed)
      g[v].emplace_back(u);
  }
  return g;
}

template<class T>
void setBit(T &msk, int bit, bool x) {
  msk = (msk & ~(T(1) << bit)) | (T(x) << bit);
}
template<class T> void flipBit(T &msk, int bit) { msk ^= T(1) << bit; }
template<class T> bool getBit(T msk, int bit) { return msk >> bit & T(1); }

template<class T>
T floorDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? a / b : (a - b + 1) / b;
}
template<class T>
T ceilDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? (a + b - 1) / b : a / b;
}

template<class T> bool chmin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template<class T> bool chmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
#line 1 "segtree/lichaoSegmentTree.cpp"
//note: size should be power of 2, finding min line in default

template<class M, M unit>
struct lichaoSegmentTree {
  vector<array<M, 2>> data;
  vector<M> xMid;
  unsigned size;

  lichaoSegmentTree(unsigned _size, vector<M> x = vector<M>()) : data(2 * _size, {0, unit}), xMid(2 * _size), size(_size) {
    assert(popcount(size) == 1);
    if (x.empty()) {
      iota(xMid.begin() + size, xMid.end(), 0);
    } else {
      copy(x.begin(), x.end(), xMid.begin() + size);
      fill(xMid.begin() + size + ssize(x), xMid.end(), x.back());
    }
    vector<int> r(2 * size);
    iota(r.begin() + size, r.end(), size);
    for(int i = size - 1; i > 0; i--)
      r[i] = r[i << 1 | 1];
    for(int i = size - 1; i > 0; i--)
      xMid[i] = (xMid[r[i << 1]] + xMid[r[i << 1] + 1]) / 2;
  }

  M eval(M a, M b, M x) { return a * x + b; }

  void insert(int v, M a, M b) {
    if (a > data[v][0]) {
      swap(a, data[v][0]);
      swap(b, data[v][1]);
    }

    if (v >= size) {
      if (eval(a, b, xMid[v]) < eval(data[v][0], data[v][1], xMid[v])) {
        swap(a, data[v][0]);
        swap(b, data[v][1]);
      }
      return;
    }

    if (eval(a, b, xMid[v]) > eval(data[v][0], data[v][1], xMid[v])) {
      insert(v << 1 | 1, a, b);
    } else {
      swap(a, data[v][0]);
      swap(b, data[v][1]);
      insert(v << 1, a, b);
    }
  }

  M query(int v) {
    v += size;
    M ans = unit;
    int x = xMid[v];
    while(v >= 1)
      ans = min(ans, eval(data[v][0], data[v][1], x)), v >>= 1;
    return ans;
  }

  void insertRange(int l, int r, M a, M b) {
    for(l += size, r += size; l < r; l >>= 1, r >>= 1) {
      if (l & 1) insert(l++, a, b);
      if (r & 1) insert(--r, a, b);
    }
  }
};
#line 5 "test/segment_add_get_min.test.cpp"

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, q; cin >> n >> q;
  vector<array<ll, 4>> c(n);
  for(auto &[l, r, a, b] : c)
    cin >> l >> r >> a >> b;
  vector<array<ll, 5>> query(q);
  for(auto &[t, x, y, z, w] : query) {
    cin >> t;
    if (t == 0)
      cin >> x >> y >> z >> w;
    else
      cin >> x;
  }

  vector<ll> xs;
  for(auto &[l, r, a, b] : c) {
    xs.emplace_back(l);
    xs.emplace_back(r);
  }
  for(auto &[t, x, y, z, w] : query) {
    if (t == 0) {
      xs.emplace_back(x);
      xs.emplace_back(y);
    } else {
      xs.emplace_back(x);
    }
  }
  ranges::sort(xs);
  xs.resize(unique(xs.begin(), xs.end()) - xs.begin());
  for(auto &[l, r, a, b] : c) {
    l = ranges::lower_bound(xs, l) - xs.begin();
    r = ranges::lower_bound(xs, r) - xs.begin();
  }
  for(auto &[t, x, y, z, w] : query) {
    if (t == 0) {
      x = ranges::lower_bound(xs, x) - xs.begin();
      y = ranges::lower_bound(xs, y) - xs.begin();
    } else {
      x = ranges::lower_bound(xs, x) - xs.begin();
    }
  }

  lichaoSegmentTree<ll, LLONG_MAX> st(bit_ceil(xs.size()), xs);
  for(auto &[l, r, a, b] : c)
    st.insertRange(l, r, a, b);
  for(auto &[t, x, y, z, w] : query) {
    if (t == 0) {
      st.insertRange(x, y, z, w);
    } else {
      if (ll ans = st.query(x); ans == LLONG_MAX)
        cout << "INFINITY\n";
      else
        cout << ans << '\n';
    }
      
  }

  return 0;
}
Back to top page