data_structure/segment_tree_rooter.hpp

View this file on GitHub
Last update: 2024-04-16 23:27:13+09:00
Include: #include "data_structure/segment_tree_rooter.hpp"

Depends on

Required by

Verified with

verify/aizu-online-judge/itp1_1_a/0001.test.cpp

Code

#pragma once


#include <concepts>


#include "internal/dev_env.hpp"
#include "internal/types.hpp"


namespace uni {


template<std::integral SizeType>
struct segment_tree_rooter {
    using size_type = SizeType;

  private:
    size_type _n = 0;

  public:
    segment_tree_rooter() noexcept = default;

    explicit segment_tree_rooter(const size_type n) noexcept(NO_EXCEPT) : _n(n) {};

    inline size_type size() const noexcept(NO_EXCEPT) { return this->_n; }
    inline size_type allocated() const noexcept(NO_EXCEPT) { return (this->_n << 1) - 1; }

    template<std::invocable<size_type> F>
    void range_to_nodes(size_type l, size_type r, F&& f) noexcept(NO_EXCEPT) {
        l += this->_n;
        r += this->_n;

        while(l < r) {
            if(l & 1) f(l++ - 1);
            if(r & 1) f(--r - 1);
            l >>= 1;
            r >>= 1;
        }
    }

    size_type point_to_node(const size_type p) noexcept(NO_EXCEPT) { return this->_n + p - 1; }

    template<std::invocable<size_type> F>
    void point_to_path(size_type p, F&& f) noexcept(NO_EXCEPT) {
        p += this->_n;
        while(p > 0) f(p - 1), p >>= 1;
    }
};

}

#line 2 "data_structure/segment_tree_rooter.hpp"


#include <concepts>


#line 2 "internal/dev_env.hpp"


#ifdef LOCAL_JUDGE
    inline constexpr bool DEV_ENV = true;
    inline constexpr bool NO_EXCEPT = false;
#else
    inline constexpr bool DEV_ENV = false;
    inline constexpr bool NO_EXCEPT = true;
#endif // LOCAL_JUDGE


#if __cplusplus >= 202100L
    #define CPP20 true
    #define CPP23 true
#elif __cplusplus >= 202002L
    #define CPP20 true
    #define CPP23 false
#else
    #define CPP20 false
    #define CPP23 false
#endif
#line 2 "internal/types.hpp"

#include <cstdint>

namespace uni {

namespace internal {


using size_t = std::int64_t;

using int128_t = __int128_t;
using uint128_t = __uint128_t;


} // namesapce internal

} // namespace uni
#line 9 "data_structure/segment_tree_rooter.hpp"


namespace uni {


template<std::integral SizeType>
struct segment_tree_rooter {
    using size_type = SizeType;

  private:
    size_type _n = 0;

  public:
    segment_tree_rooter() noexcept = default;

    explicit segment_tree_rooter(const size_type n) noexcept(NO_EXCEPT) : _n(n) {};

    inline size_type size() const noexcept(NO_EXCEPT) { return this->_n; }
    inline size_type allocated() const noexcept(NO_EXCEPT) { return (this->_n << 1) - 1; }

    template<std::invocable<size_type> F>
    void range_to_nodes(size_type l, size_type r, F&& f) noexcept(NO_EXCEPT) {
        l += this->_n;
        r += this->_n;

        while(l < r) {
            if(l & 1) f(l++ - 1);
            if(r & 1) f(--r - 1);
            l >>= 1;
            r >>= 1;
        }
    }

    size_type point_to_node(const size_type p) noexcept(NO_EXCEPT) { return this->_n + p - 1; }

    template<std::invocable<size_type> F>
    void point_to_path(size_type p, F&& f) noexcept(NO_EXCEPT) {
        p += this->_n;
        while(p > 0) f(p - 1), p >>= 1;
    }
};

}