alg/monoid/monoid_reverse.hpp

• View this file on GitHub
• Last update: 2022-12-01 09:04:06+09:00
• Include: #include "alg/monoid/monoid_reverse.hpp"

Required by

• graph/ds/lazy_tree_monoid.hpp
• graph/ds/static_tree_monoid.hpp
• graph/ds/tree_monoid.hpp
• graph/minimum_spanning_tree.hpp

Verified with

• test/aoj/GRL_2_A.test.cpp
• test/aoj/GRL_5_E.test.cpp
• test/library_checker/datastructure/vertex_add_path_sum_monoid_c.test.cpp
• test/library_checker/datastructure/vertex_add_subtree_sum_monoid.test.cpp
• test/library_checker/datastructure/vertex_set_path_composite_monoid.test.cpp
• test/library_checker/tree/mst.test.cpp
• test/mytest/mo_on_tree.test.cpp
• test/yukicoder/1197.test.cpp
• test/yukicoder/1212.test.cpp
• test/yukicoder/1216.test.cpp
• test/yukicoder/1216_2.test.cpp
• test/yukicoder/1790.test.cpp
• test/yukicoder/235.test.cpp
• test/yukicoder/529.test.cpp
• test_atcoder/abc270_f.test.cpp
• test_atcoder/abc301h.test.cpp

Code

#pragma once

template <class Monoid>
struct Monoid_Reverse {
  using value_type = typename Monoid::value_type;
  using X = value_type;
  static constexpr X op(const X &x, const X &y) { return Monoid::op(y, x); }
  static constexpr X unit() { return Monoid::unit(); }
  static const bool commute = Monoid::commute;
};

#line 2 "alg/monoid/monoid_reverse.hpp"

template <class Monoid>
struct Monoid_Reverse {
  using value_type = typename Monoid::value_type;
  using X = value_type;
  static constexpr X op(const X &x, const X &y) { return Monoid::op(y, x); }
  static constexpr X unit() { return Monoid::unit(); }
  static const bool commute = Monoid::commute;
};

Back to top page