segtree/ultraLazySegmentTree.cpp

View this file on GitHub
Last update: 2024-02-09 21:58:48+08:00

Verified with

test/area_of_union_of_rectangles.test.cpp
test/range_affine_range_sum.test.cpp

Code

//#include<segtree/lazySegmentTree.cpp>

template<class AM>
struct ultraLazySegmentTree : lazySegmentTree<typename AM::M, AM::Mid, AM::Mop, typename AM::T, AM::Tid, AM::Top, AM::act> {
  using base = lazySegmentTree<typename AM::M, AM::Mid, AM::Mop, typename AM::T, AM::Tid, AM::Top, AM::act>;
  ultraLazySegmentTree(vector<typename AM::M> init) : base(init) {}
  ultraLazySegmentTree(int size) : base(size) {}
};

#line 1 "segtree/ultraLazySegmentTree.cpp"
//#include<segtree/lazySegmentTree.cpp>

template<class AM>
struct ultraLazySegmentTree : lazySegmentTree<typename AM::M, AM::Mid, AM::Mop, typename AM::T, AM::Tid, AM::Top, AM::act> {
  using base = lazySegmentTree<typename AM::M, AM::Mid, AM::Mop, typename AM::T, AM::Tid, AM::Top, AM::act>;
  ultraLazySegmentTree(vector<typename AM::M> init) : base(init) {}
  ultraLazySegmentTree(int size) : base(size) {}
};