data-structure/lazy-segtree.cpp

• View this file on GitHub
• Last update: 2020-05-26 19:55:50+09:00

Depends on

• template.cpp
• util/function-objects.cpp

Required by

• string/hash-monoid.cpp

Verified with

• verify/aoj/0355.test.cpp

Code

#pragma once

#include "template.cpp"
#include "util/function-objects.cpp"

#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wshadow"
template <typename T, typename Actor, typename Combine, typename ACombine,
          typename Action>
struct LazySegmentTree {
 private:
  const size_t n, h;
  const T unit;
  const Actor aunit;
  const Combine combine;
  const ACombine acombine;
  const Action upd;
  vector<T> data;
  vector<Actor> lazy;

 public:
  LazySegmentTree(size_t n = 0, T unit = {}, Actor aunit = {},
                  Combine combine = {}, ACombine acombine = {}, Action upd = {})
      : n(n),
        h(32 - __builtin_clz(n)),
        unit(unit),
        aunit(aunit),
        combine(combine),
        acombine(acombine),
        upd(upd),
        data(n << 1, unit),
        lazy(n, aunit) {
    build(0, n);
  }

  template <
      typename Iter,
      enable_if_t<is_same<typename Iter::value_type, T>::value>* = nullptr>
  LazySegmentTree(Iter first, Iter last, size_t n, T unit = {},
                  Actor aunit = {}, Combine combine = {},
                  ACombine acombine = {}, Action upd = {})
      : n(n),
        h(32 - __builtin_clz(n)),
        unit(unit),
        aunit(aunit),
        combine(combine),
        acombine(acombine),
        upd(upd),
        data(n << 1, unit),
        lazy(n, aunit) {
    copy(first, last, data.begin() + n);
    build(0, n);
  }

  template <
      typename Iter,
      enable_if_t<!is_same<typename Iter::value_type, T>::value>* = nullptr>
  [[deprecated]] LazySegmentTree(Iter first, Iter last, size_t n, T unit = {},
                                 Actor aunit = {}, Combine combine = {},
                                 ACombine acombine = {}, Action upd = {})
      : n(n),
        h(32 - __builtin_clz(n)),
        unit(unit),
        aunit(aunit),
        combine(combine),
        acombine(acombine),
        upd(upd),
        data(n << 1, unit),
        lazy(n, aunit) {
    copy(first, last, data.begin() + n);
    build(0, n);
  }

  template <typename Iter>
  LazySegmentTree(Iter first, Iter last, T unit = {}, Actor aunit = {},
                  Combine combine = {}, ACombine acombine = {}, Action upd = {})
      : LazySegmentTree(first, last, distance(first, last), unit, aunit,
                        combine, acombine, upd) {}

 private:
  void apply(int p, Actor e, int sz) {
    if (e == aunit) return;
    data[p] = upd(data[p], e, sz);
    if (p < n) {
      if (lazy[p] == aunit)
        lazy[p] = e;
      else
        lazy[p] = acombine(lazy[p], e);
    }
  }

  void pushdown(int p, int sz) {
    if (p >= n or lazy[p] == aunit) return;
    apply(p << 1, lazy[p], sz >> 1);
    apply(p << 1 | 1, lazy[p], sz >> 1);
    lazy[p] = aunit;
  }

  void pushup(int p, int sz) {
    if (p >= n) return;
    data[p] = combine(data[p << 1], data[p << 1 | 1]);
    if (lazy[p] != aunit) data[p] = upd(data[p], lazy[p], sz);
  }

  void flush(int l, int r) {
    int s = h, k = 1 << h;
    for (l += n, r += n - 1; s > 0; s--, k >>= 1)
      for (int p = l >> s; p <= r >> s; p++) pushdown(p, k);
  }

  void build(int l, int r) {
    int sz = 2;
    for (l += n, r += n - 1; l > 1; sz <<= 1) {
      l >>= 1, r >>= 1;
      for (int p = l; p <= r; p++) pushup(p, sz);
    }
  }

 public:
  void modify(int l, int r, Actor e) {
    if (e == aunit) return;
    flush(l, l + 1);
    flush(r - 1, r);
    int l0 = l, r0 = r, k = 1;
    for (l += n, r += n; l < r; l >>= 1, r >>= 1, k <<= 1) {
      if (l & 1) apply(l++, e, k);
      if (r & 1) apply(--r, e, k);
    }
    build(l0, l0 + 1);
    build(r0 - 1, r0);
  }

  T fold(int l, int r) {
    flush(l, l + 1);
    flush(r - 1, r);
    T resl = unit, resr = unit;
    for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
      if (l & 1) resl = combine(resl, data[l++]);
      if (r & 1) resr = combine(data[--r], resr);
    }
    return combine(resl, resr);
  }
};
#pragma GCC diagnostic pop

#line 2 "data-structure/lazy-segtree.cpp"

#line 2 "template.cpp"

#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VLL = vector<ll>;
using VVLL = vector<vector<ll>>;
using VB = vector<bool>;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
constexpr int INF = 1000000007;
constexpr ll INF_LL = 1'000'000'000'000'000'007;
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define newl '\n'

// loops rep(until) / rep(var, until) / rep(var, from, until) / repr (reversed order)
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define rep(...) OVERLOAD3(__VA_ARGS__, REPEAT_FROM_UNTIL, REPEAT_UNTIL, REPEAT)(__VA_ARGS__)
#define REPEAT(times) REPEAT_CNT(_repeat, __COUNTER__, times)
#define REPEAT_CNT(_repeat, cnt, times) REPEAT_CNT_CAT(_repeat, cnt, times)
#define REPEAT_CNT_CAT(_repeat, cnt, times) REPEAT_FROM_UNTIL(_repeat ## cnt, 0, times)
#define REPEAT_UNTIL(name, times) REPEAT_FROM_UNTIL(name, 0, times)
#define REPEAT_FROM_UNTIL(name, from, until) for (int name = from, name ## __until = (until); name < name ## __until; name++)
#define repr(...) OVERLOAD3(__VA_ARGS__, REPR_FROM_UNTIL, REPR_UNTIL, REPEAT)(__VA_ARGS__)
#define REPR_UNTIL(name, times) REPR_FROM_UNTIL(name, 0, times)
#define REPR_FROM_UNTIL(name, from, until) for (int name = (until)-1, name ## __from = (from); name >= name ## __from; name--)

template <typename T, typename U>
bool chmin(T& var, U x) { if (var > x) { var = x; return true; } else return false; }
template <typename T, typename U>
bool chmax(T& var, U x) { if (var < x) { var = x; return true; } else return false; }
ll power(ll e, ll t, ll mod = INF_LL) {
  ll res = 1; for (; t; t >>= 1, (e *= e) %= mod) if (t & 1) (res *= e) %= mod; return res;
}
ll choose(ll n, int r) {
  chmin(r, n-r); if (r < 0) return 0; ll res = 1; rep(i, r) res *= n-i, res /= i+1; return res;
}
template <typename T, typename U> T divceil(T m, U d) { return (m + d - 1) / d; }
template <typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

// debugging stuff
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wmisleading-indentation"
#define repi(it, ds) for (auto it = ds.begin(); it != ds.end(); it++)
class DebugPrint { public: template <typename T> DebugPrint& operator <<(const T& v) {
#ifdef LOCAL
    cerr << v;
#endif
return *this; } } debugos; template <typename T> DebugPrint& operator<<(DebugPrint& os, const
vector<T>& vec) { os << "{"; for (int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 ==
vec.size() ? "" : ", "); os << "}"; return os; } template <typename T, typename U> DebugPrint&
operator<<(DebugPrint& os, const map<T, U>& map_var) { os << "{"; repi(itr, map_var) { os << *
itr; itr++; if (itr != map_var.end()) os << ", "; itr--; } os << "}"; return os; } template <
typename T> DebugPrint& operator<<(DebugPrint& os, const set<T>& set_var) { os << "{"; repi(
itr, set_var) { os << *itr; itr++; if (itr != set_var.end()) os << ", "; itr--; } os << "}";
return os; } template <typename T, typename U> DebugPrint& operator<<(DebugPrint& os, const
pair<T, U>& p) { os << "(" << p.first << ", " << p.second << ")"; return os; } void dump_func(
) { debugos << newl; } template <class Head, class... Tail> void dump_func(Head &&head, Tail
&&... tail) { debugos << head; if (sizeof...(Tail) > 0) { debugos << ", "; } dump_func(forward
<Tail>(tail)...); }
#ifdef LOCAL
#define dump(...) debugos << "  " << string(#__VA_ARGS__) << ": " << "[" << to_string(__LINE__) \
<< ":" << __FUNCTION__ << "]" << newl << "    ", dump_func(__VA_ARGS__)
#else
#define dump(...) ({})
#endif
#pragma GCC diagnostic pop


#line 2 "util/function-objects.cpp"

#line 4 "util/function-objects.cpp"

struct minT {
  template <typename T>
  T operator()(T a, T b) const {
    return min(a, b);
  }
};

struct maxT {
  template <typename T>
  T operator()(T a, T b) const {
    return max(a, b);
  }
};

#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-parameter"
struct assignT {
  template <typename T>
  T operator()(T a, T b, int k = 0) const { return b; }
};
#pragma GCC diagnostic pop

struct plusT {
  template <typename T>
  T operator()(T a, T b, int k = 1) const { return a + b * k; }
};
#line 5 "data-structure/lazy-segtree.cpp"

#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wshadow"
template <typename T, typename Actor, typename Combine, typename ACombine,
          typename Action>
struct LazySegmentTree {
 private:
  const size_t n, h;
  const T unit;
  const Actor aunit;
  const Combine combine;
  const ACombine acombine;
  const Action upd;
  vector<T> data;
  vector<Actor> lazy;

 public:
  LazySegmentTree(size_t n = 0, T unit = {}, Actor aunit = {},
                  Combine combine = {}, ACombine acombine = {}, Action upd = {})
      : n(n),
        h(32 - __builtin_clz(n)),
        unit(unit),
        aunit(aunit),
        combine(combine),
        acombine(acombine),
        upd(upd),
        data(n << 1, unit),
        lazy(n, aunit) {
    build(0, n);
  }

  template <
      typename Iter,
      enable_if_t<is_same<typename Iter::value_type, T>::value>* = nullptr>
  LazySegmentTree(Iter first, Iter last, size_t n, T unit = {},
                  Actor aunit = {}, Combine combine = {},
                  ACombine acombine = {}, Action upd = {})
      : n(n),
        h(32 - __builtin_clz(n)),
        unit(unit),
        aunit(aunit),
        combine(combine),
        acombine(acombine),
        upd(upd),
        data(n << 1, unit),
        lazy(n, aunit) {
    copy(first, last, data.begin() + n);
    build(0, n);
  }

  template <
      typename Iter,
      enable_if_t<!is_same<typename Iter::value_type, T>::value>* = nullptr>
  [[deprecated]] LazySegmentTree(Iter first, Iter last, size_t n, T unit = {},
                                 Actor aunit = {}, Combine combine = {},
                                 ACombine acombine = {}, Action upd = {})
      : n(n),
        h(32 - __builtin_clz(n)),
        unit(unit),
        aunit(aunit),
        combine(combine),
        acombine(acombine),
        upd(upd),
        data(n << 1, unit),
        lazy(n, aunit) {
    copy(first, last, data.begin() + n);
    build(0, n);
  }

  template <typename Iter>
  LazySegmentTree(Iter first, Iter last, T unit = {}, Actor aunit = {},
                  Combine combine = {}, ACombine acombine = {}, Action upd = {})
      : LazySegmentTree(first, last, distance(first, last), unit, aunit,
                        combine, acombine, upd) {}

 private:
  void apply(int p, Actor e, int sz) {
    if (e == aunit) return;
    data[p] = upd(data[p], e, sz);
    if (p < n) {
      if (lazy[p] == aunit)
        lazy[p] = e;
      else
        lazy[p] = acombine(lazy[p], e);
    }
  }

  void pushdown(int p, int sz) {
    if (p >= n or lazy[p] == aunit) return;
    apply(p << 1, lazy[p], sz >> 1);
    apply(p << 1 | 1, lazy[p], sz >> 1);
    lazy[p] = aunit;
  }

  void pushup(int p, int sz) {
    if (p >= n) return;
    data[p] = combine(data[p << 1], data[p << 1 | 1]);
    if (lazy[p] != aunit) data[p] = upd(data[p], lazy[p], sz);
  }

  void flush(int l, int r) {
    int s = h, k = 1 << h;
    for (l += n, r += n - 1; s > 0; s--, k >>= 1)
      for (int p = l >> s; p <= r >> s; p++) pushdown(p, k);
  }

  void build(int l, int r) {
    int sz = 2;
    for (l += n, r += n - 1; l > 1; sz <<= 1) {
      l >>= 1, r >>= 1;
      for (int p = l; p <= r; p++) pushup(p, sz);
    }
  }

 public:
  void modify(int l, int r, Actor e) {
    if (e == aunit) return;
    flush(l, l + 1);
    flush(r - 1, r);
    int l0 = l, r0 = r, k = 1;
    for (l += n, r += n; l < r; l >>= 1, r >>= 1, k <<= 1) {
      if (l & 1) apply(l++, e, k);
      if (r & 1) apply(--r, e, k);
    }
    build(l0, l0 + 1);
    build(r0 - 1, r0);
  }

  T fold(int l, int r) {
    flush(l, l + 1);
    flush(r - 1, r);
    T resl = unit, resr = unit;
    for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
      if (l & 1) resl = combine(resl, data[l++]);
      if (r & 1) resr = combine(data[--r], resr);
    }
    return combine(resl, resr);
  }
};
#pragma GCC diagnostic pop

Back to top page