group/monoid-action/min-idx-add.hpp

View this file on GitHub
Last update: 2024-09-21 22:47:38+07:00
Include: #include "group/monoid-action/min-idx-add.hpp"

Depends on

Code

#pragma once
#include "group/monoid/add.hpp"
#include "group/monoid/min-idx.hpp"

/**
 * Author: Teetat T.
 * Date: 2024-04-14
 * Description: Add to Min Action class.
 */

template<class T>
struct MinAddIdxAction{
    using InfoMonoid = MinIdxMonoid<T>;
    using TagMonoid = AddMonoid<T>;
    using Info = typename InfoMonoid::value_type;
    using Tag = typename TagMonoid::value_type;
    static constexpr Info op(const Info &a,const Tag &b){
        return (a==InfoMonoid::unit()?a:Info(a.first+b,a.second));
    }
};

#line 2 "group/monoid/add.hpp"

/**
 * Author: Teetat T.
 * Date: 2024-04-14
 * Description: Add Monoid class.
 */

template<class T>
struct AddMonoid{
    using value_type = T;
    static constexpr T op(const T &x,const T &y){return x+y;}
    static constexpr T inverse(const T &x){return -x;}
    static constexpr T unit(){return T(0);}
};

#line 2 "group/monoid/min-idx.hpp"

/**
 * Author: Teetat T.
 * Date: 2024-07-21
 * Description: Min Index Monoid class.
 */

template<class T,class IDX=int,bool tie_is_left=true>
struct MinIdxMonoid{
    using P = pair<T,IDX>;
    using value_type = P;
    static constexpr P op(const P &x,const P &y){
        if(x.first<y.first)return x;
        if(x.first>y.first)return y;
        return tie_is_left?x:y;
    }
    static constexpr P unit(){return P(numeric_limits<T>::max(),IDX(-1));}
};

#line 4 "group/monoid-action/min-idx-add.hpp"

/**
 * Author: Teetat T.
 * Date: 2024-04-14
 * Description: Add to Min Action class.
 */

template<class T>
struct MinAddIdxAction{
    using InfoMonoid = MinIdxMonoid<T>;
    using TagMonoid = AddMonoid<T>;
    using Info = typename InfoMonoid::value_type;
    using Tag = typename TagMonoid::value_type;
    static constexpr Info op(const Info &a,const Tag &b){
        return (a==InfoMonoid::unit()?a:Info(a.first+b,a.second));
    }
};