actedmonoid/actedMonoid_affineSum.cpp

• View this file on GitHub
• Last update: 2024-02-09 22:57:04+08:00

Verified with

• test/dynamic_sequence_range_affine_range_sum.test.cpp
• test/queue_operate_all_composite.test.cpp
• test/range_affine_range_sum.test.cpp
• test/range_set_range_composite.test.cpp
• test/vertex_set_path_composite.test.cpp

Code

template<class U>
struct actedMonoid_affineSum {
  using M = array<U, 2>;
  static M Mid() { return M{0, 0}; }
  static M Mop(const M &a, const M &b) { return {a[0] + b[0], a[1] + b[1]}; }
  using T = array<U, 2>;
  static T Tid() { return T{1, 0}; }
  static T Top(const T &a, const T &b) { return T{a[0] * b[0], a[1] * b[0] + b[1]}; }
  static M act(const M &a, const T &b) { return {a[0] * b[0] + a[1] * b[1], a[1]}; }
};

#line 1 "actedmonoid/actedMonoid_affineSum.cpp"
template<class U>
struct actedMonoid_affineSum {
  using M = array<U, 2>;
  static M Mid() { return M{0, 0}; }
  static M Mop(const M &a, const M &b) { return {a[0] + b[0], a[1] + b[1]}; }
  using T = array<U, 2>;
  static T Tid() { return T{1, 0}; }
  static T Top(const T &a, const T &b) { return T{a[0] * b[0], a[1] * b[0] + b[1]}; }
  static M act(const M &a, const T &b) { return {a[0] * b[0] + a[1] * b[1], a[1]}; }
};

Back to top page