遅延セグメント木 (区間加算・区間和)
(test/aoj/DSL_2_G.test.cpp)

View this file on GitHub
Last update: 2021-04-15 20:24:09+09:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_G

Depends on

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_G"
// @title 遅延セグメント木 (区間加算・区間和)

#include "../../monoid/add_count.hpp"
#include "../../monoid/add.hpp"
#include "../../datastructure/lazy-segment-tree.hpp"

#include <iostream>
#include <vector>
using namespace std;

typedef long long ll;
using P = pair<ll, ll>;

int main() {
  int n, q; cin >> n >> q;
  auto g=[](P a,ll b) -> P {return P(a.first+b*a.second, a.second);};
  LazySegmentTree<monoid::add_count<ll>, monoid::add<ll>> st(g);
  st.build(vector<P>(n,P(0,1)));
  for (int i = 0; i < q; ++i) {
    int c; cin >> c;
    if (c == 0) {
      int s, t, x; cin >> s >> t >> x;
      st.update(s-1, t, x);
    }
    else {
      int s, t; cin >> s >> t;
      cout << st.query(s-1, t).first << endl;
    }
  }
}

#line 1 "test/aoj/DSL_2_G.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_G"
// @title 遅延セグメント木 (区間加算・区間和)

#line 1 "monoid/add_count.hpp"


#include <algorithm>
#include <utility>
#include <limits>

namespace monoid {
template <class T>
struct add_count {
  typedef std::pair<T,T> value_t;
  value_t identity() const { return std::make_pair(T(),T()); }
  value_t merge(value_t a, value_t b) const { return std::make_pair(a.first+b.first, a.second+b.second); }
};
} // namespace monoid


#line 1 "monoid/add.hpp"



namespace monoid {
template <class T>
struct add {
  typedef T value_t;
  T identity() const { return T(); }
  T merge(T a, T b) const { return a+b; }
};
} // namespace monoid


#line 1 "datastructure/lazy-segment-tree.hpp"


/**
 * @title 遅延セグメント木 (区間更新、区間取得)
 */ 
#include <cassert>
#include <functional>
#include <vector>

// FIXME: coding styleを統一する
// FIXME: 要素に作用素を適用する関数であるGをclass化する
template <class Monoid, class OperatorMonoid>
struct LazySegmentTree {
  typedef typename Monoid::value_t value_t;
  typedef typename OperatorMonoid::value_t operator_t;
  const Monoid monoid;
  const OperatorMonoid op_monoid;
  using G = std::function< value_t(value_t, operator_t) >;
  const G g;
  int n; // n_以上の最小の2冪
  int height; // 木の深さ. n == pow(2, height)
  std::vector<value_t> data;
  std::vector<operator_t> lazy;
  LazySegmentTree(const G g): monoid(), op_monoid(), g(g) {}

  void init(int n_) {
    n = 1;
    height = 0;
    while (n < n_) { n *= 2; ++height; }
    data.assign(2*n, monoid.identity());
    lazy.assign(2*n, op_monoid.identity());
  }

  void set(int k, value_t x) {
    data[k + n] = x;
  }

  void build(const std::vector<value_t> &v) {
    int n_=v.size();
    init(n_);
    for(int i=0;i<n_;i++) data[n+i]=v[i];
    for(int i=n-1;i;i--)
      data[i] = monoid.merge(data[(i<<1)|0], data[(i<<1)|1]);
  }

  inline void propagate(int k) {
    if(lazy[k] != op_monoid.identity()) {
      lazy[2 * k + 0] = op_monoid.merge(lazy[2 * k + 0], lazy[k]);
      lazy[2 * k + 1] = op_monoid.merge(lazy[2 * k + 1], lazy[k]);
      data[k] = reflect(k);
      lazy[k] = op_monoid.identity();
    }
  }

  inline value_t reflect(int k) {
    return lazy[k] == op_monoid.identity() ? data[k] : g(data[k], lazy[k]);
  }

  inline void recalc(int k) {
    while(k >>= 1) data[k] = monoid.merge(reflect(2 * k + 0), reflect(2 * k + 1));
  }

  inline void thrust(int k) {
    for(int i = height; i > 0; i--) propagate(k >> i);
  }

  void update(int a, int b, operator_t x) { // 0-indexed, [a, b)
    assert(0 <= a && a <= b && b <= n);
    thrust(a += n);
    thrust(b += n - 1);
    for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if(l & 1) lazy[l] = op_monoid.merge(lazy[l], x), ++l;
      if(r & 1) --r, lazy[r] = op_monoid.merge(lazy[r], x);
    }
    recalc(a);
    recalc(b);
  }

  value_t query(int a, int b) { // 0-indexed, [a, b)
    assert(0 <= a && a <= b && b <= n);
    thrust(a += n);
    thrust(b += n - 1);
    value_t vl = monoid.identity(), vr = monoid.identity();
    for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if(l & 1) vl = monoid.merge(vl, reflect(l++));
      if(r & 1) vr = monoid.merge(reflect(--r), vr);
    }
    return monoid.merge(vl, vr);
  }

  value_t operator[](const int &k) {
    return query(k, k + 1);
  }
};


#line 7 "test/aoj/DSL_2_G.test.cpp"

#include <iostream>
#line 10 "test/aoj/DSL_2_G.test.cpp"
using namespace std;

typedef long long ll;
using P = pair<ll, ll>;

int main() {
  int n, q; cin >> n >> q;
  auto g=[](P a,ll b) -> P {return P(a.first+b*a.second, a.second);};
  LazySegmentTree<monoid::add_count<ll>, monoid::add<ll>> st(g);
  st.build(vector<P>(n,P(0,1)));
  for (int i = 0; i < q; ++i) {
    int c; cin >> c;
    if (c == 0) {
      int s, t, x; cin >> s >> t >> x;
      st.update(s-1, t, x);
    }
    else {
      int s, t; cin >> s >> t;
      cout << st.query(s-1, t).first << endl;
    }
  }
}

遅延セグメント木 (区間加算・区間和) (test/aoj/DSL_2_G.test.cpp)

Depends on

Code

遅延セグメント木 (区間加算・区間和)
(test/aoj/DSL_2_G.test.cpp)