#line 1 "test/aoj_DSL_2_H.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_H"
#include <cstdint>
#include <cstdio>
#include <vector>
#line 1 "utility/action/add_min.cpp"
/**
* @brief 区間最小値・区間加算用のヘルパークラス
* @author えびちゃん
*/
#line 1 "utility/monoid/min.cpp"
/**
* @brief min を得る演算のモノイド
* @author えびちゃん
*/
#include <algorithm>
#include <utility>
#line 1 "utility/limits.cpp"
/**
* @brief 型依存の定数
* @author えびちゃん
*/
#include <limits>
#line 11 "utility/limits.cpp"
template <typename Tp>
class limits: public std::numeric_limits<Tp> {};
template <typename T1, typename T2>
class limits<std::pair<T1, T2>> {
public:
static constexpr auto min() {
return std::make_pair(limits<T1>::min(), limits<T2>::min());
}
static constexpr auto max() {
return std::make_pair(limits<T1>::max(), limits<T2>::max());
}
};
#line 13 "utility/monoid/min.cpp"
template <typename Tp>
class min_monoid {
public:
using value_type = Tp;
private:
value_type M_x = limits<Tp>::max();
public:
min_monoid() = default; // identity
min_monoid(value_type const& x): M_x(x) {}
min_monoid& operator +=(min_monoid const& that) {
M_x = std::min(M_x, that.M_x);
return *this;
}
friend bool operator ==(min_monoid const& lhs, min_monoid const& rhs) {
return lhs.M_x == rhs.M_x;
}
friend min_monoid operator +(min_monoid lhs, min_monoid const& rhs) {
return lhs += rhs;
}
friend bool operator !=(min_monoid const& lhs, min_monoid const& rhs) {
return !(lhs == rhs);
}
value_type const& get() const { return M_x; }
};
#line 10 "utility/action/add_min.cpp"
template <typename Tp>
struct action_add_to_min {
using operand_type = min_monoid<Tp>;
using action_type = Tp;
static void act(operand_type& op, action_type const& a) {
op = operand_type(std::move(op).get() + a);
}
};
#line 1 "DataStructure/segment_tree.cpp"
/**
* @brief 区間作用・区間和セグメント木
* @author えびちゃん
*/
#include <cstddef>
#line 11 "DataStructure/segment_tree.cpp"
#line 1 "integer/bit.cpp"
/**
* @brief ビット演算
* @author えびちゃん
*/
// XXX integral promotion 関連の注意をあまりしていません
#include <climits>
#include <type_traits>
template <typename Tp>
constexpr auto countl_zero(Tp n)
-> typename std::enable_if<std::is_unsigned<Tp>::value, int>::type
{
using value_type = typename std::make_unsigned<Tp>::type;
int bits = (sizeof(value_type) * CHAR_BIT);
if (n == 0) return bits;
int res = 0;
for (int i = bits / 2; i > 0; i /= 2) {
value_type mask = ((static_cast<value_type>(1) << i) - 1) << i;
if (n & mask) n >>= i;
else res += i;
}
return res;
}
template <typename Tp>
constexpr auto countl_one(Tp n)
-> typename std::enable_if<std::is_unsigned<Tp>::value, int>::type
{
using value_type = typename std::make_unsigned<Tp>::type;
return countl_zero(static_cast<value_type>(~n));
}
template <typename Tp>
constexpr auto countr_zero(Tp n)
-> typename std::enable_if<std::is_unsigned<Tp>::value, int>::type
{
using value_type = typename std::make_unsigned<Tp>::type;
int bits = (sizeof(value_type) * CHAR_BIT);
if (n == 0) return bits;
int res = 0;
for (int i = bits / 2; i > 0; i /= 2) {
value_type mask = ((static_cast<value_type>(1) << i) - 1);
if (!(n & mask)) res += i, n >>= i;
}
return res;
}
template <typename Tp>
constexpr auto countr_one(Tp n)
-> typename std::enable_if<std::is_unsigned<Tp>::value, int>::type
{
using value_type = typename std::make_unsigned<Tp>::type;
return countr_zero(static_cast<value_type>(~n));
}
constexpr unsigned long long half_mask[] = {
0x5555555555555555uLL, 0x3333333333333333uLL, 0x0F0F0F0F0F0F0F0FuLL,
0x00FF00FF00FF00FFuLL, 0x0000FFFF0000FFFFuLL, 0x00000000FFFFFFFFuLL
};
template <typename Tp>
constexpr auto popcount(Tp n)
-> typename std::enable_if<std::is_unsigned<Tp>::value, int>::type
{
int bits = static_cast<int>((sizeof n) * CHAR_BIT);
for (int i = 0, j = 1; j < bits; ++i, j *= 2) {
if (j <= 8) n = (n & half_mask[i]) + ((n >> j) & half_mask[i]);
else n += n >> j;
}
return n & 0xFF;
}
template <typename Tp>
constexpr auto parity(Tp n)
-> typename std::enable_if<std::is_unsigned<Tp>::value, int>::type
{ return popcount(n) & 1; }
template <typename Tp>
int clz(Tp n) { return countl_zero(static_cast<typename std::make_unsigned<Tp>::type>(n)); }
template <typename Tp>
int ctz(Tp n) { return countr_zero(static_cast<typename std::make_unsigned<Tp>::type>(n)); }
template <typename Tp>
int ilog2(Tp n) {
return (CHAR_BIT * sizeof(Tp) - 1) - clz(static_cast<typename std::make_unsigned<Tp>::type>(n));
}
template <typename Tp>
bool is_pow2(Tp n) { return (n > 0) && ((n & (n-1)) == 0); }
template <typename Tp>
Tp floor2(Tp n) { return is_pow2(n)? n: static_cast<Tp>(1) << ilog2(n); }
template <typename Tp>
Tp ceil2(Tp n) { return is_pow2(n)? n: static_cast<Tp>(2) << ilog2(n); }
template <typename Tp>
constexpr auto reverse(Tp n)
-> typename std::enable_if<std::is_unsigned<Tp>::value, Tp>::type
{
int bits = static_cast<int>((sizeof n) * CHAR_BIT);
for (int i = 0, j = 1; j < bits; ++i, j *= 2) {
n = ((n & half_mask[i]) << j) | ((n >> j) & half_mask[i]);
}
return n;
}
#line 13 "DataStructure/segment_tree.cpp"
template <typename Operation>
class segment_tree {
public:
using size_type = size_t;
using operation = Operation;
using operand_type = typename operation::operand_type;
using action_type = typename operation::action_type;
using value_type = operand_type;
private:
size_type M_n;
std::vector<operand_type> M_c;
std::vector<action_type> M_d; // deferred
void M_build(size_type i) {
while (i > 1) {
i >>= 1;
M_c[i] = (M_c[i<<1|0] + M_c[i<<1|1]);
operation::act(M_c[i], M_d[i]);
}
}
void M_resolve(size_type i) {
size_type h = ilog2(M_n) + 2; // ilog2p1(M_n*2)
for (size_type s = h; s > 0; --s) {
size_type p = i >> s;
action_type id{};
if (M_d[p] != id) {
M_apply(p<<1|0, M_d[p]);
M_apply(p<<1|1, M_d[p]);
M_d[p] = id;
}
}
}
void M_apply(size_type i, action_type const& x) {
operation::act(M_c[i], x);
if (i < M_n) M_d[i] += x;
}
public:
segment_tree() = default;
explicit segment_tree(size_type n):
M_n(n), M_c(n+n, operand_type{}), M_d(n, action_type{}) {}
segment_tree(size_type n, operand_type const& x):
M_n(n), M_c(n+n, x), M_d(n, action_type{})
{
for (size_type i = n; i--;) M_c[i] = M_c[i<<1|0] + M_c[i<<1|1];
}
template <typename InputIt>
segment_tree(InputIt first, InputIt last): M_c(first, last) {
M_n = M_c.size();
M_d.assign(M_n, action_type{});
M_c.insert(M_c.begin(), M_n, operand_type{});
for (size_type i = M_n; i--;) M_c[i] = M_c[i<<1|0] + M_c[i<<1|1];
}
void assign(size_type n) {
M_n = n;
M_c(n+n, operand_type{});
M_d(n, action_type{});
}
void assign(size_type n, operand_type const& x) {
M_n = n;
M_c(n+n, x);
M_d(n, action_type{});
for (size_type i = n; i--;) M_c[i] = M_c[i<<1|0] + M_c[i<<1|1];
}
template <typename InputIt>
void assign(InputIt first, InputIt last) {
M_c.assign(first, last);
M_n = M_c.size();
M_d.assign(M_n, action_type{});
M_c.insert(M_c.begin(), M_n, operand_type{});
for (size_type i = M_n; i--;) M_c[i] = M_c[i<<1|0] + M_c[i<<1|1];
}
void act(size_type l, size_type r, action_type const& x) {
if (l == r) return;
l += M_n;
r += M_n;
size_type l0 = l;
size_type r0 = r;
M_resolve(l0);
M_resolve(r0-1);
while (l < r) {
if (l & 1) M_apply(l++, x);
if (r & 1) M_apply(--r, x);
l >>= 1;
r >>= 1;
}
M_build(l0);
M_build(r0-1);
}
operand_type fold(size_type l, size_type r) {
operand_type resl{}, resr{};
if (l == r) return resl;
l += M_n;
r += M_n;
M_resolve(l);
M_resolve(r-1);
while (l < r) {
if (l & 1) resl += M_c[l++];
if (r & 1) resr = M_c[--r] + std::move(resr);
l >>= 1;
r >>= 1;
}
return resl += resr;
}
operand_type operator [](size_type i) {
i += M_n;
M_resolve(i);
return M_c[i];
}
};
#line 9 "test/aoj_DSL_2_H.test.cpp"
int main() {
size_t n, q;
scanf("%zu %zu", &n, &q);
segment_tree<action_add_to_min<int>> st(n, 0);
for (size_t i = 0; i < q; ++i) {
int com;
scanf("%d", &com);
if (com == 0) {
size_t s, t;
intmax_t x;
scanf("%zu %zu %jd", &s, &t, &x);
st.act(s, t+1, x);
} else if (com == 1) {
size_t s, t;
scanf("%zu %zu", &s, &t);
printf("%d\n", st.fold(s, t+1).get());
}
}
}
test/aoj_DSL_2_H.test.cpp