MonoidRangeCompositePointUpdate - [区間一次関数, 点更新]
(lib/99-operator/monoid/MonoidRangeCompositePointUpdate.cpp)

• View this file on GitHub
• Last update: 2023-05-30 04:39:19+09:00

Verified with

• test/graph/Tree-hld-vertex-3.test.cpp
• test/segment-tree/DynamicSegmentTree-rcq-1.test.cpp
• test/segment-tree/SegmentTree-rcq.test.cpp
• test/segment-tree/SortableSegmentTree-rcq.test.cpp

Code

/*
 * @title MonoidRangeCompositePointUpdate - [区間一次関数, 点更新]
 * @docs md/operator/monoid/MonoidRangeCompositePointUpdate.md
 */
template<class T> struct MonoidRangeCompositePointUpdate {
    using TypeNode = T;
    inline static constexpr TypeNode unit_node = make_pair(1,0);
    inline static constexpr TypeNode func_fold(TypeNode l,TypeNode r){return {r.first*l.first,r.first*l.second+r.second};}
    inline static constexpr TypeNode func_operate(TypeNode l,TypeNode r){return r;}
    inline static constexpr bool func_check(TypeNode nodeVal,TypeNode var){return var == nodeVal;}
};

#line 1 "lib/99-operator/monoid/MonoidRangeCompositePointUpdate.cpp"
/*
 * @title MonoidRangeCompositePointUpdate - [区間一次関数, 点更新]
 * @docs md/operator/monoid/MonoidRangeCompositePointUpdate.md
 */
template<class T> struct MonoidRangeCompositePointUpdate {
    using TypeNode = T;
    inline static constexpr TypeNode unit_node = make_pair(1,0);
    inline static constexpr TypeNode func_fold(TypeNode l,TypeNode r){return {r.first*l.first,r.first*l.second+r.second};}
    inline static constexpr TypeNode func_operate(TypeNode l,TypeNode r){return r;}
    inline static constexpr bool func_check(TypeNode nodeVal,TypeNode var){return var == nodeVal;}
};

Back to top page