// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_2_B
#include "../../../src/ds/segtree/hp/lib.hpp"
using namespace tifa_libs;
u32 op(u32 x, u32 y) { return x + y; }
void mapping(u32& x, u32 y) { x += y; }
int main() {
std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);
u32 n, q;
std::cin >> n >> q;
segtree_notag<u32, op, mapping> tr(0, n);
flt_ (u32, i, 0, q) {
u32 op, u, v;
std::cin >> op >> u >> v;
if (op) std::cout << tr.query(u - 1, v) << '\n';
else tr.update(u - 1, v);
}
return 0;
}
#line 1 "test/cpv/aizu-dsl/dsl_2_b.segtree.cpp"
// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_2_B
#line 2 "src/ds/segtree/hp/lib.hpp"
#line 2 "src/util/alias/others/lib.hpp"
#line 2 "src/util/consts/lib.hpp"
#line 2 "src/util/alias/num/lib.hpp"
#line 2 "src/util/util/lib.hpp"
// https://github.com/Tiphereth-A/CP-lib
#include <bits/extc++.h>
// clang-format off
namespace tifa_libs {
#define CEXP constexpr
#define CEXPE constexpr explicit
#define CR const&
#define CP const*
#define PC *const
#define CPC const*const
#define TPN typename
#define NE noexcept
#define CNE const noexcept
#define ND [[nodiscard]]
#define cT_(...) std::conditional_t<sizeof(__VA_ARGS__) <= sizeof(size_t) * 2, __VA_ARGS__, __VA_ARGS__ CR>
// NOLINTNEXTLINE(misc-const-correctness)
#define flt_(T, i, l, r, ...) for (T i = (l), i##e = (r)__VA_OPT__(, ) __VA_ARGS__; i < i##e; ++i)
#define retif_(cond, if_true, ...) if cond return if_true __VA_OPT__(; else return __VA_ARGS__)
#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif
using namespace std::ranges;
using namespace std::literals;
template <class T>
CEXP T abs(T x) NE { retif_((x < 0), -x, x); }
} // namespace tifa_libs
// clang-format on
#line 4 "src/util/alias/num/lib.hpp"
// clang-format off
namespace tifa_libs {
#define mk0_(w, t) using w = t; using c##w = const t
#define mk_(w, t) mk0_(w, t); CEXP w operator""_##w(unsigned long long x) NE { return (w)x; }
mk_(i8, int8_t) mk_(u8, uint8_t) mk_(i16, int16_t) mk_(u16, uint16_t) mk_(i32, int32_t) mk_(u32, uint32_t) mk_(i64, int64_t) mk_(u64, uint64_t) mk_(isz, ssize_t) mk_(usz, size_t) mk_(chr, char) mk_(schr, signed char) mk_(uchr, unsigned char) mk_(sint, signed) mk_(uint, unsigned);
mk0_(i128, __int128_t); mk0_(u128, __uint128_t); mk0_(f32, float); mk0_(f64, double); mk0_(f128, long double);
#undef mk0_
#undef mk_
} // namespace tifa_libs
// clang-format on
#line 4 "src/util/consts/lib.hpp"
// clang-format off
namespace tifa_libs {
using std::numbers::pi_v;
template <std::floating_point FP>
inline FP eps_v = std::sqrt(std::numeric_limits<FP>::epsilon());
template <std::floating_point FP>
CEXP void set_eps(FP v) NE { eps_v<FP> = v; }
CEXP u32 TIME = ((__TIME__[0] & 15) << 20) | ((__TIME__[1] & 15) << 16) | ((__TIME__[3] & 15) << 12) | ((__TIME__[4] & 15) << 8) | ((__TIME__[6] & 15) << 4) | (__TIME__[7] & 15);
CEXP auto STR2U16 = [] { std::array<u32, 65536> table{}; table.fill(-1_u32); flt_ (u32, i, 48, 58) flt_ (u32, j, 48, 58) table[i << 8 | j] = (j & 15) * 10 + (i & 15); return table; }();
inline const auto fn_0 = [](auto&&...) NE {};
inline const auto fn_is0 = [](auto x) NE { return x == 0; };
} // namespace tifa_libs
// clang-format on
#line 4 "src/util/alias/others/lib.hpp"
namespace tifa_libs {
template <class T>
struct chash {
CEXP static u64 C = u64(pi_v<f128> * 2e18) | 71;
CEXP u64 operator()(T x) CNE { return __builtin_bswap64(((u64)x ^ TIME) * C); }
};
// clang-format off
#define mk_(w, t) using w = t; using c##w = const t;
mk_(strn, std::string) mk_(strnv, std::string_view)
#undef mk_
template <class T> struct edge_t { T w; u32 u, v; CEXP auto operator<=>(edge_t CR) const = default; }; template <class T> using cedge_t = const edge_t<T>;
template <class T> struct pt3 { T _0, _1, _2; CEXP auto operator<=>(pt3 CR) const = default; }; template <class T> using cpt3 = const pt3<T>;
template <class T> struct pt4 { T _0, _1, _2, _3; CEXP auto operator<=>(pt4 CR) const = default; }; template <class T> using cpt4 = const pt4<T>;
#define mkT_(w, t, ...) template <class T> using w = t __VA_OPT__(, ) __VA_ARGS__; template <class T> using c##w = const t __VA_OPT__(, ) __VA_ARGS__;
mkT_(ptt, std::pair<T, T>) mkT_(alc, std::pmr::polymorphic_allocator<T>) mkT_(vec, std::vector<T>) mkT_(vvec, vec<vec<T>>) mkT_(v3ec, vvec<vec<T>>) mkT_(vecpt, vec<ptt<T>>) mkT_(vvecpt, vvec<ptt<T>>) mkT_(ptvec, ptt<vec<T>>) mkT_(ptvvec, ptt<vvec<T>>)
#undef mkT_
template <class T> using itl = std ::initializer_list<T>;
template <class T, usz ext = std::dynamic_extent> using spn = std::span<T const, ext>;
template <class T, usz N> using arr = std::array<T, N>; template <class T, usz N> using carr = std::array<const T, N>;
template <class U, class T> using vecp = vec<std::pair<U, T>>; template <class U, class T> using vvecp = vvec<std::pair<U, T>>;
template <class U, class T> using vvecp = vvec<std::pair<U, T>>; template <class U, class T> using vvvecp = vvec<vvec<std::pair<U, T>>>;
#ifdef PB_DS_ASSOC_CNTNR_HPP
template <class T, class C = std::less<T>> using set = __gnu_pbds::tree<T, __gnu_pbds::null_type, C>;
template <class K, class V, class C = std::less<K>> using map = __gnu_pbds::tree<K, V, C>;
// hset<u64> s({}, {}, {}, {}, {1<<16});
template <class T, class HF = chash<T>> using hset = __gnu_pbds::gp_hash_table<T, __gnu_pbds::null_type, HF>;
// hmap<u64, int> s({}, {}, {}, {}, {1<<16});
template <class K, class V, class HF = chash<K>> using hmap = __gnu_pbds::gp_hash_table<K, V, HF>;
#else
using std::set, std::map;
template <class T, class HF = chash<T>> using hset = std::unordered_set<T, HF>;
template <class K, class V, class HF = chash<K>> using hmap = std::unordered_map<K, V, HF>;
#endif
#ifdef PB_DS_PRIORITY_QUEUE_HPP
template <class T, class C = std::less<T>> using pq = __gnu_pbds::priority_queue<T, C>;
#else
template <class T, class C = std::less<T>> using pq = std::priority_queue<T, vec<T>, C>;
#endif
template <class T> using pqg = pq<T, std::greater<T>>;
// clang-format on
#define mk1_(V, A, T) using V##A = V<T>;
#define mk_(V, A, T) mk1_(V, A, T) mk1_(c##V, A, T)
#define mk(A, T) mk_(edge_t, A, T) mk_(ptt, A, T) mk_(pt3, A, T) mk_(pt4, A, T) mk_(vec, A, T) mk_(vvec, A, T) mk_(v3ec, A, T) mk_(vecpt, A, T) mk_(vvecpt, A, T) mk_(ptvec, A, T) mk_(ptvvec, A, T) mk1_(spn, A, T) mk1_(itl, A, T)
mk(b, bool) mk(c, chr) mk(i, i32) mk(u, u32) mk(ii, i64) mk(uu, u64) mk(t, isz) mk(z, usz) mk(f, f32) mk(d, f64) mk(s, strn);
#undef mk
#undef mk_
#undef mk1_
} // namespace tifa_libs
#line 4 "src/ds/segtree/hp/lib.hpp"
namespace tifa_libs {
namespace segtree_impl_ {
template <bool enable_tag, class T, auto op, class F, auto mapping, auto composition>
requires requires(T val, T new_val, F tag, F new_tag) {
{ op(val, new_val) } -> std::same_as<T>;
{ mapping(val, tag) } -> std::same_as<void>;
{ composition(tag, new_tag) } -> std::same_as<void>;
}
struct segtree {
const T E;
const F ID;
private:
u32 sz, lbn, n;
vec<T> val;
vec<F> tag;
vecb vset;
public:
CEXP segtree(cT_(T) e, cT_(F) id) NE : E(e), ID(id), sz(0), lbn(0), n(0), val{}, tag{}, vset{} {}
template <class V>
CEXP segtree(cT_(T) e, cT_(F) id, V&& a) NE : segtree(e, id) { reset(std::forward<V>(a)); }
CEXP segtree(cT_(T) e, cT_(F) id, u32 n) NE : segtree(e, id) { reset(vec<T>(n, e)); }
template <class V>
CEXP void reset(V&& a) NE {
if (a.empty()) {
sz = lbn = n = 0, val.clear(), tag.clear(), vset.clear();
return;
}
sz = (u32)a.size(), lbn = (u32)std::bit_width(sz - 1), n = 1_u32 << lbn;
if (!n) return;
val = vec<T>(n * 2, E), copy(a, begin(val) + n);
if CEXP (enable_tag) tag = vec<F>(n, ID), vset = vecb(n);
for (u32 i = n - 1; i; --i) pushup(i);
}
//! 0-indexed, [l, r)
CEXP void update(u32 l, u32 r, cT_(F) v) NE { upd_set<true>(l, r, v); }
//! 0-indexed, [l, r)
// set(3, 7, v): val[[3, 4), [4, 6), [6, 7)] <- v
//! val[[4, 6)] != op(val[[3, 4)], val[[6, 7)])
CEXP void set(u32 l, u32 r, cT_(F) v) NE { upd_set<false>(l, r, v); }
//! 0-indexed, [l, r)
CEXP T query(u32 l, u32 r) NE {
if (assert(l <= r && r <= sz); l == r) return E;
l += n, r += n;
cu32 zl = (u32)std::countr_zero(l), zr = (u32)std::countr_zero(r), ie = (u32)max(1, (i32)min(zl, zr));
for (u32 i = lbn; i >= ie; --i) {
if (zl < i) pushdown(l >> i);
if (zr < i) pushdown((r - 1) >> i);
}
T ql = E, qr = E;
while (l < r) {
if (l & 1) ql = op(ql, val[l++]);
if (r & 1) qr = op(val[--r], qr);
l /= 2, r /= 2;
}
return op(ql, qr);
}
CEXP void update(u32 x, cT_(F) v) NE { upd_set<true>(x, v); }
CEXP void set(u32 x, cT_(T) v) NE { upd_set<false>(x, v); }
CEXP T query(u32 x) NE {
assert(x < sz), x += n;
for (u32 i = lbn; i; --i) pushdown(x >> i);
return val[x];
}
template <class G>
requires requires(G check, T val) {
{ check(val) } -> std::same_as<bool>;
}
CEXP u32 max_right(u32 l, G&& chk) NE {
if (assert(l <= sz && chk(ID)); l == n) return n;
l += n;
for (u32 i = lbn; i; --i) pushdown(l >> i);
T _ = E;
do {
if (!chk(op(_, val[l >>= std::countr_zero(l)]))) {
while (l < n)
if (pushdown(l), l *= 2; chk(op(_, val[l]))) _ = op(_, val[l++]);
return l - n;
}
_ = op(_, val[l++]);
} while (!std::has_single_bit(l));
return sz;
}
template <class G>
requires requires(G check, T val) {
{ check(val) } -> std::same_as<bool>;
}
CEXP u32 min_left(u32 r, G chk) NE {
if (assert(r <= sz && chk(ID)); !r) return 0;
r += n;
for (u32 i = lbn; i; --i) pushdown((r - 1) >> i);
T _ = E;
do {
if (!(--r, r >>= std::countr_one(r))) r = 1;
if (!chk(op(val[r], _))) {
while (r < n)
if (pushdown(r), r = r * 2 + 1; chk(op(val[r], _))) _ = op(val[r--], _);
return r + 1 - n;
}
_ = op(val[r], _);
} while (!std::has_single_bit(r));
return 0;
}
private:
CEXP void compose(F& a, cT_(F) b) CNE {
if (a == ID) a = b;
else composition(a, b);
}
CEXP void pushup(u32 x) NE { val[x] = op(val[x * 2], val[x * 2 + 1]); }
template <bool upd>
CEXP void apply(u32 x, std::conditional_t<upd, cT_(F), cT_(T)> f) NE {
if CEXP (upd) {
if (f == ID) return;
if CEXP (mapping(val[x], f); enable_tag)
if (x < n) compose(tag[x], f);
} else if CEXP (val[x] = f; enable_tag)
if (x < n) tag[x] = ID, vset[x] = true;
}
CEXP void pushdown(u32 x) NE {
if CEXP (enable_tag) {
if (vset[x]) {
val[x * 2] = val[x * 2 + 1] = val[x];
if (x * 2 < n) tag[x * 2] = tag[x * 2 + 1] = ID, vset[x * 2] = vset[x * 2 + 1] = true;
vset[x] = false;
} else if (tag[x] != ID) {
mapping(val[x * 2], tag[x]), mapping(val[x * 2 + 1], tag[x]);
if (x * 2 < n) compose(tag[x * 2], tag[x]), compose(tag[x * 2 + 1], tag[x]);
tag[x] = ID;
}
}
}
template <bool upd>
CEXP void upd_set(u32 l, u32 r, std::conditional_t<upd, cT_(F), cT_(T)> v) NE {
if (assert(l <= r && r <= sz); l == r) return;
l += n, r += n;
cu32 zl = (u32)std::countr_zero(l), zr = (u32)std::countr_zero(r), zm = min(zl, zr), ie = (u32)max(1, (i32)zm);
for (u32 i = lbn; i >= ie; --i) {
if (zl < i) pushdown(l >> i);
if (zr < i) pushdown((r - 1) >> i);
}
u32 l2 = l, r2 = r;
while (l2 < r2) {
if (l2 & 1) apply<upd>(l2++, v);
if (r2 & 1) apply<upd>(--r2, v);
l2 /= 2, r2 /= 2;
}
flt_ (u32, i, zm + 1, lbn + 1) {
if (zl < i) pushup(l >> i);
if (zr < i) pushup((r - 1) >> i);
}
}
template <bool upd>
CEXP void upd_set(u32 x, std::conditional_t<upd, cT_(F), cT_(T)> v) NE {
assert(x < sz), x += n;
for (u32 i = lbn; i; --i) pushdown(x >> i);
if CEXP (upd) mapping(val[x], v);
else val[x] = v;
flt_ (u32, i, 1, lbn + 1) pushup(x >> i);
}
};
} // namespace segtree_impl_
template <class T, auto op, class F, auto mapping, auto composition>
using segtree = segtree_impl_::segtree<true, T, op, F, mapping, composition>;
template <class T, auto op, auto mapping>
class segtree_notag : public segtree_impl_::segtree<false, T, op, T, mapping, mapping> {
using base = segtree_impl_::segtree<false, T, op, T, mapping, mapping>;
public:
CEXPE segtree_notag(cT_(T) e) NE : base(e, e) {}
template <class V>
CEXP segtree_notag(cT_(T) e, V&& a) NE : base(e, e, std::forward<V>(a)) {}
CEXP segtree_notag(cT_(T) e, u32 n) NE : base(e, e, n) {}
};
} // namespace tifa_libs
#line 3 "test/cpv/aizu-dsl/dsl_2_b.segtree.cpp"
using namespace tifa_libs;
u32 op(u32 x, u32 y) { return x + y; }
void mapping(u32& x, u32 y) { x += y; }
int main() {
std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);
u32 n, q;
std::cin >> n >> q;
segtree_notag<u32, op, mapping> tr(0, n);
flt_ (u32, i, 0, q) {
u32 op, u, v;
std::cin >> op >> u >> v;
if (op) std::cout << tr.query(u - 1, v) << '\n';
else tr.update(u - 1, v);
}
return 0;
}
test/cpv/aizu-dsl/dsl_2_b.segtree.cpp