cp-library
This documentation is automatically generated by online-judge-tools/verification-helper
group/monoid/add-count.hpp
- View this file on GitHub
- Last update: 2024-06-10 16:05:09+07:00
- Include:
#include "group/monoid/add-count.hpp"
Required by
group/monoid-action/add-count-add.hpp
Verified with
- verify/yosupo/data-structure/dynamic_sequence_range_affine_range_sum.test.cpp
- verify/yosupo/data-structure/range_affine_range_sum.test.cpp
- verify/yosupo/data-structure/range_affine_range_sum_lct.test.cpp
Code
#pragma once
/**
* Author: Teetat T.
* Date: 2024-04-14
* Description: Add & Count Monoid class.
*/
template<class T>
struct AddCountMonoid{
using P = pair<T,int>;
using value_type = P;
static constexpr P op(const P &x,const P &y){
return P(x.first+y.first,x.second+y.second);
}
static constexpr P inverse(const P &x){return P(-x.first,-x.second);}
static constexpr P unit(){return P(T(0),0);}
static constexpr P make(const T &x){return P(x,1);}
};#line 2 "group/monoid/add-count.hpp"
/**
* Author: Teetat T.
* Date: 2024-04-14
* Description: Add & Count Monoid class.
*/
template<class T>
struct AddCountMonoid{
using P = pair<T,int>;
using value_type = P;
static constexpr P op(const P &x,const P &y){
return P(x.first+y.first,x.second+y.second);
}
static constexpr P inverse(const P &x){return P(-x.first,-x.second);}
static constexpr P unit(){return P(T(0),0);}
static constexpr P make(const T &x){return P(x,1);}
};