kyopro-lib

This documentation is automatically generated by online-judge-tools/verification-helper

View on GitHub

:x: With min index
(Mylib/AlgebraicStructure/Monoid/with_min_index.cpp)

Operations

Requirements

Notes

Problems

References

Verified with

Code

#pragma once
#include <algorithm>
#include <limits>
#include <utility>

namespace haar_lib {
  namespace with_min_index_impl {
    template <typename T>
    struct value_index {
      T value;
      int index;
      value_index() {}
      value_index(T value, int index) : value(value), index(index) {}
    };
  }  // namespace with_min_index_impl

  template <typename Monoid>
  struct with_min_index {
    using value_type = with_min_index_impl::value_index<typename Monoid::value_type>;
    const static Monoid M;

    value_type operator()() const {
      return {M(), std::numeric_limits<int>::max()};
    }

    value_type operator()(const value_type &a, const value_type &b) const {
      if (a.value == b.value) return {a.value, std::min(a.index, b.index)};
      if (M(a.value, b.value) == a.value)
        return a;
      else
        return b;
    }
  };
}  // namespace haar_lib
#line 2 "Mylib/AlgebraicStructure/Monoid/with_min_index.cpp"
#include <algorithm>
#include <limits>
#include <utility>

namespace haar_lib {
  namespace with_min_index_impl {
    template <typename T>
    struct value_index {
      T value;
      int index;
      value_index() {}
      value_index(T value, int index) : value(value), index(index) {}
    };
  }  // namespace with_min_index_impl

  template <typename Monoid>
  struct with_min_index {
    using value_type = with_min_index_impl::value_index<typename Monoid::value_type>;
    const static Monoid M;

    value_type operator()() const {
      return {M(), std::numeric_limits<int>::max()};
    }

    value_type operator()(const value_type &a, const value_type &b) const {
      if (a.value == b.value) return {a.value, std::min(a.index, b.index)};
      if (M(a.value, b.value) == a.value)
        return a;
      else
        return b;
    }
  };
}  // namespace haar_lib
Back to top page