verify/data-structure/LC_range_add_range_min.test.cpp

• View this file on GitHub
• Last update: 2026-08-11 23:01:09+09:00
• Problem: https://judge.yosupo.jp/problem/range_add_range_min

Depends on

• Range Add Range Min (data-structure/range-add-range-min.hpp)
• template/debug.hpp
• template/inout.hpp
• template/macro.hpp
• template/template.hpp
• template/util.hpp

Code

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

#include "template/template.hpp"
#include "data-structure/range-add-range-min.hpp"

int main() {
  int n, q;
  in(n, q);
  vector<long long> a(n);
  in(a);

  RangeAddRangeMin<long long> seg(a);
  rep(_, 0, q) {
    int t, l, r;
    in(t, l, r);
    if (t == 0) {
      long long x;
      in(x);
      seg.add(l, r, x);
    } else {
      out(seg.min(l, r));
    }
  }
}

#line 1 "verify/data-structure/LC_range_add_range_min.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/range_add_range_min"

#line 2 "template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#line 2 "template/macro.hpp"
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; i >= (a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())
#define YN(b) cout << ((b) ? "YES" : "NO") << "\n";
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define yn(b) cout << ((b) ? "yes" : "no") << "\n";
#line 6 "template/template.hpp"

#line 2 "template/util.hpp"
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
template <class T>
using priority_queue_asc = priority_queue<T, vector<T>, greater<T>>;

template <class T, class S = T>
S SUM(const vector<T>& a) {
  return accumulate(ALL(a), S(0));
}
template <class T1, class T2>
inline bool chmin(T1& a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmax(T1& a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmin_opt(optional<T1>& a, T2 b) {
  if (!a || a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmax_opt(optional<T1>& a, T2 b) {
  if (!a || a < b) {
    a = b;
    return true;
  }
  return false;
}

template <class T>
int popcnt(T x) {
  return __builtin_popcountll(x);
}
template <class T>
int topbit(T x) {
  return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <class T>
int lowbit(T x) {
  return (x == 0 ? -1 : __builtin_ctzll(x));
}
#line 8 "template/template.hpp"

#line 2 "template/inout.hpp"
struct Fast {
  Fast() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} fast;

ostream& operator<<(ostream& os, __uint128_t x) {
  char buf[40];
  size_t k = 0;
  while (x > 0) buf[k++] = (char)(x % 10 + '0'), x /= 10;
  if (k == 0) buf[k++] = '0';
  while (k) os << buf[--k];
  return os;
}
ostream& operator<<(ostream& os, __int128_t x) {
  return x < 0 ? (os << '-' << (__uint128_t)(-x)) : (os << (__uint128_t)x);
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a);
template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << " " << p.second;
}
template <class T>
istream& operator>>(istream& is, vector<T>& a) {
  for (auto& v : a) is >> v;
  return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& a) {
  for (auto it = a.begin(); it != a.end();) {
    os << *it;
    if (++it != a.end()) os << " ";
  }
  return os;
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a) {
  for (auto it = a.begin(); it != a.end();) {
    os << *it;
    if (++it != a.end()) os << " ";
  }
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& st) {
  os << "{";
  for (auto it = st.begin(); it != st.end();) {
    os << *it;
    if (++it != st.end()) os << ",";
  }
  os << "}";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2>& mp) {
  os << "{";
  for (auto it = mp.begin(); it != mp.end();) {
    os << it->first << ":" << it->second;
    if (++it != mp.end()) os << ",";
  }
  os << "}";
  return os;
}

void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
  cin >> t;
  in(u...);
}
template <class... T>
void in_zip(int n, T&... t) {
  assert(n >= 0 && ((size(t) >= static_cast<size_t>(n)) && ...));
  for (int i = 0; i < n; i++) in(t[i]...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T& t, const U&... u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}
template <class T, class U>
void out_opt(const optional<T>& opt, const U& fallback, ostream& os = cout) {
  if (opt.has_value())
    os << opt.value();
  else
    os << fallback;
  os << "\n";
}
template <class T, class U>
void out_opt(const vector<optional<T>>& vec, const U& fallback, ostream& os = cout) {
  for (auto it = vec.begin(); it != vec.end();) {
    if ((*it).has_value())
      os << (*it).value();
    else
      os << fallback;
    if (++it != vec.end()) os << " ";
  }
  os << "\n";
}

namespace IO {
template <class T, class... U>
T read(U&&... u) {
  T t = T(forward<U>(u)...);
  in(t);
  return t;
}
namespace Graph {
vector<vector<int>> unweighted(int n, int m, bool directed = false, int offset = 1) {
  vector<vector<int>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    u -= offset, v -= offset;
    g[u].push_back(v);
    if (!directed) g[v].push_back(u);
  }
  return g;
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, int m, bool directed = false, int offset = 1) {
  vector<vector<pair<int, T>>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    T w;
    cin >> u >> v >> w;
    u -= offset, v -= offset;
    g[u].push_back({v, w});
    if (!directed) g[v].push_back({u, w});
  }
  return g;
}
}  // namespace Graph
namespace Tree {
vector<vector<int>> unweighted(int n, bool directed = false, int offset = 1) {
  return Graph::unweighted(n, n - 1, directed, offset);
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, bool directed = false, int offset = 1) {
  return Graph::weighted<T>(n, n - 1, directed, offset);
}
vector<vector<int>> rooted(int n, bool to_root = true, bool to_leaf = true, int offset = 1) {
  vector<vector<int>> g(n);
  for (int i = 1; i < n; i++) {
    int p;
    cin >> p;
    p -= offset;
    if (to_root) g[i].push_back(p);
    if (to_leaf) g[p].push_back(i);
  }
  return g;
}
}  // namespace Tree
}  // namespace IO
#line 10 "template/template.hpp"

#line 2 "template/debug.hpp"
#ifdef LOCAL
#define debug 1
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define debug 0
#define show(...) true
#endif
template <class T>
void _show(int, T) {
  cerr << '\n';
}
template <class T1, class T2, class... T3>
void _show(int i, const T1& a, const T2& b, const T3&... c) {
  for (; a[i] != ',' && a[i] != '\0'; i++) cerr << a[i];
  cerr << ":" << b << " ";
  _show(i + 1, a, c...);
}
#line 2 "data-structure/range-add-range-min.hpp"

template <class T>
struct RangeAddRangeMin {
  RangeAddRangeMin() : RangeAddRangeMin(0) {}
  explicit RangeAddRangeMin(int n) : RangeAddRangeMin(vector<T>(n, T(0))) {}
  explicit RangeAddRangeMin(const vector<T>& a) : N(a.size()), root_min(T(0)), diff(max(0, N - 1), T(0)) {
    if (N > 0) root_min = build(0, 0, N, a);
  }
  void add(int l, int r, T x) {
    if (l >= r) return;
    assert(0 <= l && l <= r && r <= N);
    root_min += add(0, 0, N, l, r, x);
  }
  T min(int l, int r) const {
    assert(0 <= l && l <= r && r <= N);
    assert(l < r);
    return min(0, 0, N, l, r, root_min);
  }
  T prod(int l, int r) const { return min(l, r); }
  T get(int p) const {
    assert(0 <= p && p < N);
    return min(p, p + 1);
  }
  T all_min() const {
    assert(N > 0);
    return root_min;
  }
  T all_prod() const { return all_min(); }
  int size() const { return N; }

 private:
  int N;
  T root_min;
  vector<T> diff;
  static int internal_count(int len) { return max(0, len - 1); }
  static int right_child(int id, int l, int m) { return id + 1 + internal_count(m - l); }
  T build(int id, int l, int r, const vector<T>& a) {
    if (r - l == 1) return a[l];
    int m = (l + r) / 2;
    T ml = build(id + 1, l, m, a);
    T mr = build(right_child(id, l, m), m, r, a);
    diff[id] = ml - mr;
    return std::min(ml, mr);
  }
  T add(int id, int l, int r, int ql, int qr, T x) {
    if (qr <= l || r <= ql) return T(0);
    if (ql <= l && r <= qr) return x;
    int m = (l + r) / 2;
    int rid = right_child(id, l, m);
    T dl = add(id + 1, l, m, ql, qr, x);
    T dr = add(rid, m, r, ql, qr, x);
    T d = diff[id];
    T ret = d <= T(0) ? std::min(dl, -d + dr) : std::min(d + dl, dr);
    diff[id] = d + dl - dr;
    return ret;
  }
  T min(int id, int l, int r, int ql, int qr, T cur_min) const {
    if (qr <= l || r <= ql) return numeric_limits<T>::max();
    if (ql <= l && r <= qr) return cur_min;
    int m = (l + r) / 2;
    T d = diff[id];
    T left_min = cur_min + max(d, T(0));
    T right_min = cur_min + max(-d, T(0));
    return std::min(min(id + 1, l, m, ql, qr, left_min), min(right_child(id, l, m), m, r, ql, qr, right_min));
  }
};

/**
 * @brief Range Add Range Min
 * @docs docs/data-structure/range-add-range-min.md
 */
#line 5 "verify/data-structure/LC_range_add_range_min.test.cpp"

int main() {
  int n, q;
  in(n, q);
  vector<long long> a(n);
  in(a);

  RangeAddRangeMin<long long> seg(a);
  rep(_, 0, q) {
    int t, l, r;
    in(t, l, r);
    if (t == 0) {
      long long x;
      in(x);
      seg.add(l, r, x);
    } else {
      out(seg.min(l, r));
    }
  }
}

Back to top page