verify/ds/segtree/persistent_dynamic_dual_segtree.test.cpp

• View this file on GitHub
• Last update: 2026-10-06 01:57:24+09:00
• Problem: https://judge.yosupo.jp/problem/aplusb

Depends on

• ds/segtree/dynamic_segtree_common.hpp
• Persistent Dynamic Dual Segment Tree (ds/segtree/persistent_dynamic_dual_segtree.hpp)
• ds/segtree/persistent_node_pool.hpp
• Add Monoid (monoid/add.hpp)
• Monoid Concept (monoid/concept.hpp)
• Update Monoid (monoid/update.hpp)
• Fast IO (utilities/fast_io.hpp)

Code

#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"

#include "../../../ds/segtree/persistent_dynamic_dual_segtree.hpp"

#include "../../../utilities/fast_io.hpp"
#include <algorithm>
#include <cassert>
#include <cstdint>
#include <optional>
#include <vector>

#include "../../../monoid/add.hpp"
#include "../../../monoid/update.hpp"

namespace {

void test_versions() {
    using Add = m1une::monoid::Add<long long>;
    using Seg = m1une::ds::PersistentDynamicDualSegtree<Add, int>;

    Seg base(-50, 60, 5);
    base.reserve(20000);
    Seg first = base.apply(-10, 20, 3);
    Seg second = first.set(0, 100);
    Seg branch = base.apply(5, 15, 7);

    assert(base.get(0) == 5);
    assert(first.get(0) == 8);
    assert(second.get(0) == 100);
    assert(branch.get(0) == 5);
    assert(first.get(-20) == 5);
    assert(branch.get(10) == 12);
    assert(base.node_count() == branch.node_count());

    std::size_t live = base.node_count();
    second.release();
    assert(base.node_count() < live);
    assert(second.get(0) == 5);
    assert(first.get(0) == 8);
    first.release();
    branch.release();
    assert(base.node_count() == 0);
}

void test_update_order() {
    using Update = m1une::monoid::Update<int>;
    using Seg = m1une::ds::PersistentDynamicDualSegtree<Update, int>;

    Seg base(-10, 11, std::optional<int>(1));
    Seg first = base.apply(-5, 6, std::optional<int>(2));
    Seg second = first.apply(-2, 3, std::optional<int>(4));

    assert(base.get(0).value() == 1);
    assert(first.get(0).value() == 2);
    assert(second.get(0).value() == 4);
    assert(second.get(4).value() == 2);
    assert(second.get(8).value() == 1);
}

void test_randomized() {
    using Add = m1une::monoid::Add<long long>;
    using Seg = m1une::ds::PersistentDynamicDualSegtree<Add, int>;
    constexpr int left = -23;
    constexpr int right = 29;

    std::vector<Seg> versions;
    versions.emplace_back(left, right, 4);
    std::vector<std::vector<long long>> expected(1, std::vector<long long>(right - left, 4));

    std::uint64_t state = 9;
    auto random = [&state]() {
        state ^= state << 7;
        state ^= state >> 9;
        return state;
    };

    for (int step = 0; step < 1200; step++) {
        std::size_t from = std::size_t(random() % versions.size());
        std::vector<long long> next = expected[from];
        Seg tree = versions[from];

        if (random() & 1) {
            int l = left + int(random() % (next.size() + 1));
            int r = left + int(random() % (next.size() + 1));
            if (r < l) std::swap(l, r);
            long long x = static_cast<long long>(random() % 20);
            tree = tree.apply(l, r, x);
            for (int p = l; p < r; p++) next[std::size_t(p - left)] += x;
        } else {
            int p = left + int(random() % next.size());
            long long x = static_cast<long long>(random() % 100);
            tree = tree.set(p, x);
            next[std::size_t(p - left)] = x;
        }

        versions.push_back(tree);
        expected.push_back(next);
        [[maybe_unused]] std::size_t check = std::size_t(random() % versions.size());
        [[maybe_unused]] int p = left + int(random() % next.size());
        assert(versions[check].get(p) == expected[check][std::size_t(p - left)]);
    }
}

}  // namespace

int main() {
    m1une::utilities::FastInput fast_input;
    m1une::utilities::FastOutput fast_output;

    test_versions();
    test_update_order();
    test_randomized();

    long long a, b;
    fast_input >> a >> b;
    fast_output << a + b << '\n';
}

#line 1 "verify/ds/segtree/persistent_dynamic_dual_segtree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"

#line 1 "ds/segtree/persistent_dynamic_dual_segtree.hpp"



#include <cassert>
#include <concepts>
#include <cstddef>
#include <limits>
#include <memory>
#include <numeric>
#include <type_traits>
#include <utility>
#include <vector>

#line 1 "monoid/concept.hpp"



#line 5 "monoid/concept.hpp"

namespace m1une {
namespace monoid {

// Concept to check if a type satisfies the requirements of a Monoid.
// A Monoid must have a `value_type`, an identity element `id()`, and an associative binary operation `op()`.
template <typename M>
concept IsMonoid = requires(typename M::value_type a, typename M::value_type b) {
    // 1. Must define `value_type`
    typename M::value_type;

    // 2. Must have a static method `id()` returning `value_type`
    { M::id() } -> std::same_as<typename M::value_type>;

    // 3. Must have a static method `op(a, b)` returning `value_type`
    { M::op(a, b) } -> std::same_as<typename M::value_type>;
};

// Concept for groups. A type satisfying this concept must also obey the group
// laws; concepts can check the interface but not the algebraic properties.
template <typename M>
concept IsGroup = IsMonoid<M> && requires(typename M::value_type a) {
    { M::inv(a) } -> std::same_as<typename M::value_type>;
};

// Concept for commutative groups. Commutativity is a semantic requirement and
// cannot be checked by a C++ concept.
template <typename M>
concept IsCommutativeGroup = IsGroup<M>;

}  // namespace monoid
}  // namespace m1une


#line 1 "ds/segtree/dynamic_segtree_common.hpp"



#line 11 "ds/segtree/dynamic_segtree_common.hpp"

namespace m1une {
namespace ds {
namespace detail {

template <std::integral Index>
using dynamic_size_type = std::make_unsigned_t<Index>;

template <std::integral Index>
constexpr dynamic_size_type<Index> dynamic_distance(Index left, Index right) {
    return static_cast<dynamic_size_type<Index>>(right) - static_cast<dynamic_size_type<Index>>(left);
}

template <class Monoid, class Size>
typename Monoid::value_type monoid_repeat(typename Monoid::value_type value, Size count) {
    typename Monoid::value_type result = Monoid::id();
    while (count != 0) {
        if (count & 1) result = Monoid::op(result, value);
        count >>= 1;
        if (count != 0) value = Monoid::op(value, value);
    }
    return result;
}

template <class ActedMonoid>
typename ActedMonoid::value_type dynamic_mapping(
    const typename ActedMonoid::operator_type& f,
    const typename ActedMonoid::value_type& value
) {
    using F = typename ActedMonoid::operator_type;
    using T = typename ActedMonoid::value_type;
    if constexpr (requires(F g, T x, long long ord) { ActedMonoid::mapping(g, x, ord); }) {
        return ActedMonoid::mapping(f, value, 0);
    } else {
        return ActedMonoid::mapping(f, value);
    }
}

template <class ActedMonoid, class Size>
typename ActedMonoid::operator_type dynamic_shift(
    const typename ActedMonoid::operator_type& f,
    Size offset
) {
    using F = typename ActedMonoid::operator_type;
    if constexpr (requires(F g, long long ord) { ActedMonoid::op_shift(g, ord); }) {
        assert(offset <= static_cast<Size>(std::numeric_limits<long long>::max()));
        return ActedMonoid::op_shift(f, static_cast<long long>(offset));
    } else {
        return f;
    }
}

template <class Monoid, std::integral Index>
class UniformMonoidDomain {
   public:
    using T = typename Monoid::value_type;
    using size_type = dynamic_size_type<Index>;

   private:
    struct Level {
        size_type small_length;
        T small_value;
        T large_value;
    };

    Index _left;
    Index _right;
    T _initial_value;
    std::vector<Level> _levels;

   public:
    UniformMonoidDomain(Index left, Index right, T initial_value)
        : _left(left), _right(right), _initial_value(std::move(initial_value)) {
        assert(left <= right);
        size_type n = size();
        constexpr int digits = std::numeric_limits<size_type>::digits;
        _levels.reserve(digits + 1);
        for (int depth = 0; depth <= digits; depth++) {
            size_type small = depth == digits ? 0 : n >> depth;
            size_type large = small;
            if (depth != 0) {
                bool has_remainder;
                if (depth == digits) {
                    has_remainder = n != 0;
                } else {
                    size_type mask = (size_type(1) << depth) - 1;
                    has_remainder = (n & mask) != 0;
                }
                if (has_remainder) large++;
            }
            _levels.push_back(Level{
                small,
                monoid_repeat<Monoid>(_initial_value, small),
                monoid_repeat<Monoid>(_initial_value, large),
            });
        }
    }

    Index left_bound() const {
        return _left;
    }

    Index right_bound() const {
        return _right;
    }

    size_type size() const {
        return dynamic_distance(_left, _right);
    }

    bool empty() const {
        return _left == _right;
    }

    const T& initial_value() const {
        return _initial_value;
    }

    const T& default_product(int depth, Index left, Index right) const {
        assert(0 <= depth && depth < int(_levels.size()));
        const Level& level = _levels[depth];
        size_type length = dynamic_distance(left, right);
        if (length == level.small_length) return level.small_value;
        assert(length == level.small_length + 1);
        return level.large_value;
    }
};

}  // namespace detail
}  // namespace ds
}  // namespace m1une


#line 1 "ds/segtree/persistent_node_pool.hpp"



#line 9 "ds/segtree/persistent_node_pool.hpp"

namespace m1une {
namespace ds {
namespace detail {

// Node must have integer `left`, `right`, and `references` members.
template <class Node>
struct PersistentNodePool {
    std::vector<Node> nodes;
    int first_free = 0;
    std::size_t live_nodes = 0;

   private:
    void release_zero(int node) {
        int left = nodes[node].left;
        int right = nodes[node].right;
        nodes[node] = Node();
        nodes[node].left = first_free;
        first_free = node;
        --live_nodes;
        if (left && --nodes[left].references == 0) release_zero(left);
        if (right && --nodes[right].references == 0) release_zero(right);
    }

   public:
    PersistentNodePool() { nodes.emplace_back(); }

    void reserve(std::size_t capacity) { nodes.reserve(capacity + 1); }

    Node& operator[](int node) { return nodes[node]; }

    const Node& operator[](int node) const { return nodes[node]; }

    void retain(int node) {
        if (node) ++nodes[node].references;
    }

    void release(int node) {
        if (!node) return;
        assert(nodes[node].references > 0);
        if (--nodes[node].references == 0) release_zero(node);
    }

    template <class... Args>
    int emplace(Args&&... args) {
        int result;
        if (!first_free) {
            assert(nodes.size() < std::size_t(std::numeric_limits<int>::max()));
            nodes.emplace_back(std::forward<Args>(args)...);
            result = int(nodes.size()) - 1;
        } else {
            result = first_free;
            first_free = nodes[result].left;
            nodes[result] = Node(std::forward<Args>(args)...);
        }
        Node& node = nodes[result];
        node.references = 0;
        retain(node.left);
        retain(node.right);
        ++live_nodes;
        return result;
    }

    int clone(int node) {
        assert(node);
        Node copy = nodes[node];
        return emplace(std::move(copy));
    }

    bool unique(int node) const {
        return !node || nodes[node].references == 1;
    }

    // Returns node itself when it has one owner, otherwise an unowned clone.
    // The caller must attach a returned clone with replace() before it can be
    // released or exposed as a root.
    int clone_if_shared(int node) {
        if (unique(node)) return node;
        return clone(node);
    }

    void replace(int& edge, int node) {
        if (edge == node) return;
        retain(node);
        int old = edge;
        edge = node;
        release(old);
    }

    std::size_t size() const { return live_nodes; }
};

}  // namespace detail
}  // namespace ds
}  // namespace m1une


#line 17 "ds/segtree/persistent_dynamic_dual_segtree.hpp"

namespace m1une {
namespace ds {

// A persistent sparse dual segment tree over an integral half-open interval.
template <m1une::monoid::IsMonoid Monoid, std::integral Index = long long>
    requires(!std::same_as<std::remove_cv_t<Index>, bool>)
struct PersistentDynamicDualSegtree {
    using T = typename Monoid::value_type;
    using index_type = Index;
    using size_type = detail::dynamic_size_type<Index>;

   private:
    struct Node {
        T val;
        int left;
        int right;
        int references;
        bool has_lazy;

        Node() : val(Monoid::id()), left(0), right(0), references(0), has_lazy(false) {}
    };

    struct Config {
        Index left;
        Index right;
        T initial_value;

        Config(Index left_bound, Index right_bound, T value)
            : left(left_bound), right(right_bound), initial_value(std::move(value)) {
            assert(left <= right);
        }
    };

    std::shared_ptr<const Config> _config;
    using Pool = detail::PersistentNodePool<Node>;
    std::shared_ptr<Pool> _pool;
    int _root;

    PersistentDynamicDualSegtree(std::shared_ptr<const Config> config, std::shared_ptr<Pool> pool, int root)
        : _config(std::move(config)), _pool(std::move(pool)), _root(root) {
        _pool->retain(_root);
    }

    int new_node() const { return _pool->emplace(); }

    int clone_or_new(int t, bool copy_on_write = false) const {
        if (!t) return new_node();
        return copy_on_write ? _pool->clone_if_shared(t) : _pool->clone(t);
    }

    void all_apply_to_node(int t, Index left, Index right, const T& x) const {
        Node& node = (*_pool)[t];
        if (std::midpoint(left, right) == left) {
            T value = node.has_lazy ? node.val : _config->initial_value;
            node.val = Monoid::op(x, value);
            node.has_lazy = true;
        } else {
            node.val = node.has_lazy ? Monoid::op(x, node.val) : x;
            node.has_lazy = true;
        }
    }

    int all_apply_clone(int t, Index left, Index right, const T& x, bool copy_on_write = false) const {
        int result = clone_or_new(t, copy_on_write);
        all_apply_to_node(result, left, right, x);
        return result;
    }

    void push(int t, Index left, Index right, bool copy_on_write = false) const {
        if (!(*_pool)[t].has_lazy) return;
        Index middle = std::midpoint(left, right);
        if (middle == left) return;

        T lazy = (*_pool)[t].val;
        int left_child = all_apply_clone((*_pool)[t].left, left, middle, lazy, copy_on_write);
        int right_child = all_apply_clone((*_pool)[t].right, middle, right, lazy, copy_on_write);

        Node& node = (*_pool)[t];
        _pool->replace(node.left, left_child);
        _pool->replace(node.right, right_child);
        node.val = Monoid::id();
        node.has_lazy = false;
    }

    int set_node(int t, Index left, Index right, Index p, T x, bool copy_on_write = false) const {
        t = clone_or_new(t, copy_on_write);
        Index middle = std::midpoint(left, right);
        if (middle == left) {
            Node& node = (*_pool)[t];
            node.val = std::move(x);
            node.has_lazy = true;
            return t;
        }

        push(t, left, right, copy_on_write);
        if (p < middle) {
            int child = set_node((*_pool)[t].left, left, middle, p, std::move(x), copy_on_write);
            _pool->replace((*_pool)[t].left, child);
        } else {
            int child = set_node((*_pool)[t].right, middle, right, p, std::move(x), copy_on_write);
            _pool->replace((*_pool)[t].right, child);
        }
        return t;
    }

    int apply_node(int t, Index left, Index right, Index query_left, Index query_right, const T& x,
                   bool copy_on_write = false) const {
        if (query_right <= left || right <= query_left) return t;
        if (query_left <= left && right <= query_right) {
            return all_apply_clone(t, left, right, x, copy_on_write);
        }

        t = clone_or_new(t, copy_on_write);
        push(t, left, right, copy_on_write);
        Index middle = std::midpoint(left, right);
        int left_child = apply_node((*_pool)[t].left, left, middle, query_left, query_right, x, copy_on_write);
        int right_child = apply_node((*_pool)[t].right, middle, right, query_left, query_right, x, copy_on_write);
        _pool->replace((*_pool)[t].left, left_child);
        _pool->replace((*_pool)[t].right, right_child);
        return t;
    }

    T compose(const T& inherited, int t) const {
        if (!t || !(*_pool)[t].has_lazy) return inherited;
        return Monoid::op(inherited, (*_pool)[t].val);
    }

   public:
    PersistentDynamicDualSegtree() : PersistentDynamicDualSegtree(Index(0), Index(0), Monoid::id()) {}

    explicit PersistentDynamicDualSegtree(Index n) : PersistentDynamicDualSegtree(Index(0), n, Monoid::id()) {
        if constexpr (std::signed_integral<Index>) assert(Index(0) <= n);
    }

    PersistentDynamicDualSegtree(Index left, Index right) : PersistentDynamicDualSegtree(left, right, Monoid::id()) {}

    PersistentDynamicDualSegtree(Index left, Index right, T initial_value)
        : _config(std::make_shared<Config>(left, right, std::move(initial_value))),
          _pool(std::make_shared<Pool>()),
          _root(0) {}

    PersistentDynamicDualSegtree(const PersistentDynamicDualSegtree& other)
        : _config(other._config), _pool(other._pool), _root(other._root) {
        if (_pool) _pool->retain(_root);
    }
    PersistentDynamicDualSegtree(PersistentDynamicDualSegtree&& other) noexcept
        : _config(std::move(other._config)), _pool(std::move(other._pool)), _root(other._root) {
        other._root = 0;
    }
    PersistentDynamicDualSegtree& operator=(const PersistentDynamicDualSegtree& other) {
        if (this == &other) return *this;
        if (other._pool) other._pool->retain(other._root);
        if (_pool) _pool->release(_root);
        _config = other._config;
        _pool = other._pool;
        _root = other._root;
        return *this;
    }
    PersistentDynamicDualSegtree& operator=(PersistentDynamicDualSegtree&& other) noexcept {
        if (this == &other) return *this;
        if (_pool) _pool->release(_root);
        _config = std::move(other._config);
        _pool = std::move(other._pool);
        _root = other._root;
        other._root = 0;
        return *this;
    }
    ~PersistentDynamicDualSegtree() {
        if (_pool) _pool->release(_root);
    }

    size_type size() const { return detail::dynamic_distance(_config->left, _config->right); }

    bool empty() const { return _config->left == _config->right; }

    Index left_bound() const { return _config->left; }

    Index right_bound() const { return _config->right; }

    const T& initial_value() const { return _config->initial_value; }

    void reserve(std::size_t node_capacity) const {
        assert(node_capacity < std::numeric_limits<std::size_t>::max());
        _pool->reserve(node_capacity);
    }

    std::size_t node_count() const { return _pool->size(); }

    void release() {
        if (_pool) _pool->release(_root);
        _pool = std::make_shared<Pool>();
        _root = 0;
    }

    PersistentDynamicDualSegtree set(Index p, T x) const {
        assert(left_bound() <= p && p < right_bound());
        return PersistentDynamicDualSegtree(_config, _pool,
                                            set_node(_root, left_bound(), right_bound(), p, std::move(x)));
    }

    void set_inplace(Index p, T x) {
        assert(left_bound() <= p && p < right_bound());
        int root = set_node(_root, left_bound(), right_bound(), p, std::move(x), true);
        _pool->replace(_root, root);
    }

    T get(Index p) const {
        assert(left_bound() <= p && p < right_bound());
        int t = _root;
        Index left = left_bound();
        Index right = right_bound();
        T inherited = Monoid::id();

        while (t) {
            Index middle = std::midpoint(left, right);
            if (middle == left) {
                T value = (*_pool)[t].has_lazy ? (*_pool)[t].val : initial_value();
                return Monoid::op(inherited, value);
            }
            inherited = compose(inherited, t);
            if (p < middle) {
                t = (*_pool)[t].left;
                right = middle;
            } else {
                t = (*_pool)[t].right;
                left = middle;
            }
        }
        return Monoid::op(inherited, initial_value());
    }

    T operator[](Index p) const { return get(p); }

    PersistentDynamicDualSegtree apply(Index p, const T& x) const {
        assert(left_bound() <= p && p < right_bound());
        return apply(p, p + 1, x);
    }

    PersistentDynamicDualSegtree apply(Index left, Index right, const T& x) const {
        assert(left_bound() <= left && left <= right && right <= right_bound());
        if (left == right) return *this;
        return PersistentDynamicDualSegtree(_config, _pool,
                                            apply_node(_root, left_bound(), right_bound(), left, right, x));
    }

    void apply_inplace(Index p, const T& x) {
        assert(left_bound() <= p && p < right_bound());
        apply_inplace(p, p + 1, x);
    }

    void apply_inplace(Index left, Index right, const T& x) {
        assert(left_bound() <= left && left <= right && right <= right_bound());
        if (left == right) return;
        int root = apply_node(_root, left_bound(), right_bound(), left, right, x, true);
        _pool->replace(_root, root);
    }
};

}  // namespace ds
}  // namespace m1une


#line 4 "verify/ds/segtree/persistent_dynamic_dual_segtree.test.cpp"

#line 1 "utilities/fast_io.hpp"



#include <algorithm>
#include <array>
#include <cerrno>
#include <charconv>
#line 9 "utilities/fast_io.hpp"
#include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>
#include <iterator>
#include <string>
#include <sys/stat.h>
#line 18 "utilities/fast_io.hpp"
#include <unistd.h>
#line 20 "utilities/fast_io.hpp"

namespace m1une {
namespace utilities {

struct FastOutput;

namespace internal {

// Shared with the convenience helpers in template.hpp.
inline FastOutput* standard_output_instance = nullptr;

// Detect std::begin(x), std::end(x).
template <class T, class = void>
struct is_range : std::false_type {};

template <class T>
struct is_range<T, std::void_t<
    decltype(std::begin(std::declval<T&>())),
    decltype(std::end(std::declval<T&>()))
>> : std::true_type {};

template <class T>
inline constexpr bool is_range_v = is_range<T>::value;

template <class T>
using range_reference_t = decltype(*std::begin(std::declval<T&>()));

template <class T>
using range_value_t = std::remove_cv_t<std::remove_reference_t<range_reference_t<T>>>;

template <class T, class = void>
struct range_stored_value {
    using type = range_value_t<T>;
};

template <class T>
struct range_stored_value<T, std::void_t<typename std::remove_cv_t<std::remove_reference_t<T>>::value_type>> {
    using type = typename std::remove_cv_t<std::remove_reference_t<T>>::value_type;
};

template <class T>
using range_stored_value_t = typename range_stored_value<T>::type;

// Treat strings and C strings as scalar output objects, not as ranges.
template <class T>
struct is_char_array : std::false_type {};

template <class T, std::size_t N>
struct is_char_array<T[N]>
    : std::bool_constant<std::is_same_v<std::remove_cv_t<T>, char>> {};

template <class T>
struct is_string_like
    : std::bool_constant<
          std::is_same_v<std::decay_t<T>, std::string>
          || std::is_same_v<std::decay_t<T>, const char*>
          || std::is_same_v<std::decay_t<T>, char*>
          || is_char_array<std::remove_reference_t<T>>::value
      > {};

template <class T>
inline constexpr bool is_string_like_v = is_string_like<T>::value;

// ModInt-like type: x.val() is printable, and x can be assigned from long long.
template <class T, class = void>
struct has_val_method : std::false_type {};

template <class T>
struct has_val_method<T, std::void_t<decltype(std::declval<const T&>().val())>>
    : std::true_type {};

template <class T>
inline constexpr bool has_val_method_v = has_val_method<T>::value;

template <class T, class = void>
struct has_static_mod_raw : std::false_type {};

template <class T>
struct has_static_mod_raw<
    T, std::void_t<decltype(T::mod()), decltype(T::raw(std::declval<uint32_t>()))>>
    : std::true_type {};

template <class T>
inline constexpr bool has_static_mod_raw_v = has_static_mod_raw<T>::value;

// libstdc++ before GCC 16 does not classify __int128 as an integral type in
// strict ISO modes such as -std=c++23. Keep the fast-I/O interface independent
// of that implementation detail.
template <class T>
inline constexpr bool is_integral_v =
    std::is_integral_v<T>
    || std::is_same_v<std::remove_cv_t<T>, __int128_t>
    || std::is_same_v<std::remove_cv_t<T>, __uint128_t>;

template <class T>
inline constexpr bool is_signed_v =
    std::is_signed_v<T>
    || std::is_same_v<std::remove_cv_t<T>, __int128_t>;

template <class T>
struct make_unsigned {
    using type = std::make_unsigned_t<T>;
};

template <>
struct make_unsigned<__int128_t> {
    using type = __uint128_t;
};

template <>
struct make_unsigned<__uint128_t> {
    using type = __uint128_t;
};

template <class T>
using make_unsigned_t = typename make_unsigned<std::remove_cv_t<T>>::type;

}  // namespace internal

struct FastInput {
    static constexpr int buffer_size = 1 << 20;

   private:
    std::FILE* _stream;
    char _buffer[buffer_size];
    int _position;
    int _length;
    int _file_descriptor;
    bool _streaming;

    bool refill() {
        _position = 0;
        if (_streaming) {
            ssize_t length;
            do {
                length = ::read(_file_descriptor, _buffer, buffer_size);
            } while (length < 0 && errno == EINTR);
            if (length <= 0) {
                _length = 0;
                return false;
            }
            _length = int(length);
        } else {
            _length = int(std::fread(_buffer, 1, buffer_size, _stream));
        }
        return _length != 0;
    }

    template <class T>
    bool read_integer_from_stream(T& value) {
        if (!skip_spaces()) return false;
        int c = read_char_raw();

        bool negative = false;
        if (c == '-') {
            negative = true;
            c = read_char_raw();
        }

        if constexpr (internal::is_signed_v<T>) {
            T result = 0;
            while ('0' <= c && c <= '9') {
                result = negative ? result * 10 - (c - '0')
                                  : result * 10 + (c - '0');
                c = read_char_raw();
            }
            value = result;
        } else {
            T result = 0;
            while ('0' <= c && c <= '9') {
                result = result * 10 + T(c - '0');
                c = read_char_raw();
            }
            value = negative ? T(0) - result : result;
        }
        return true;
    }

    bool prepare_number() {
        if (_length - _position >= 64) return true;
        const int remaining = _length - _position;
        if (remaining > 0) std::memmove(_buffer, _buffer + _position, remaining);
        const int added = int(std::fread(_buffer + remaining, 1, buffer_size - remaining, _stream));
        _position = 0;
        _length = remaining + added;
        if (_length < buffer_size) _buffer[_length] = '\0';
        return _length != 0;
    }

   public:
    explicit FastInput(std::FILE* stream = stdin)
        : _stream(stream),
          _position(0),
          _length(0),
          _file_descriptor(::fileno(stream)),
          _streaming([&] {
              struct stat status;
              return _file_descriptor >= 0
                     && ::fstat(_file_descriptor, &status) == 0
                     && !S_ISREG(status.st_mode);
          }()) {}

    FastInput(const FastInput&) = delete;
    FastInput& operator=(const FastInput&) = delete;

    int read_char_raw() {
        if (_position == _length && !refill()) return EOF;
        return _buffer[_position++];
    }

    bool skip_spaces() {
        int c = read_char_raw();
        while (c != EOF && c <= ' ') c = read_char_raw();
        if (c == EOF) return false;
        --_position;
        return true;
    }

    bool read(char& value) {
        if (!skip_spaces()) return false;
        value = char(read_char_raw());
        return true;
    }

    bool read(std::string& value) {
        if (!skip_spaces()) return false;
        value.clear();
        while (true) {
            const int begin = _position;
            while (_position < _length &&
                   static_cast<unsigned char>(_buffer[_position]) > ' ') {
                ++_position;
            }
            value.append(_buffer + begin, _position - begin);
            if (_position < _length) {
                ++_position;
                return true;
            }
            if (!refill()) return true;
        }
    }

    bool read(bool& value) {
        int x;
        if (!read(x)) return false;
        value = x != 0;
        return true;
    }

    template <class T>
    std::enable_if_t<
        internal::is_integral_v<T>
            && !std::is_same_v<std::remove_cv_t<T>, bool>
            && !std::is_same_v<std::remove_cv_t<T>, char>,
        bool
    >
    read(T& value) {
        if (_streaming) return read_integer_from_stream(value);
        if (!prepare_number()) return false;
        int c = static_cast<unsigned char>(_buffer[_position++]);
        while (c <= ' ') c = static_cast<unsigned char>(_buffer[_position++]);

        bool negative = false;
        if (c == '-') {
            negative = true;
            c = static_cast<unsigned char>(_buffer[_position++]);
        }

        if constexpr (internal::is_signed_v<T>) {
            T result = 0;
            while ('0' <= c && c <= '9') {
                const int first = c - '0';
                const int second = static_cast<unsigned char>(_buffer[_position]) - '0';
                if (0 <= second && second <= 9) {
                    result = negative ? result * 100 - (first * 10 + second)
                                      : result * 100 + (first * 10 + second);
                    ++_position;
                } else {
                    result = negative ? result * 10 - first : result * 10 + first;
                }
                c = static_cast<unsigned char>(_buffer[_position++]);
            }
            value = result;
        } else {
            T result = 0;
            while ('0' <= c && c <= '9') {
                const unsigned first = unsigned(c - '0');
                const int second = static_cast<unsigned char>(_buffer[_position]) - '0';
                if (0 <= second && second <= 9) {
                    result = result * 100 + T(first * 10 + unsigned(second));
                    ++_position;
                } else {
                    result = result * 10 + T(first);
                }
                c = static_cast<unsigned char>(_buffer[_position++]);
            }
            value = negative ? T(0) - result : result;
        }
        if (_position > _length) _position = _length;
        return true;
    }

    template <class T>
    std::enable_if_t<std::is_floating_point_v<T>, bool>
    read(T& value) {
        if (!skip_spaces()) return false;
        int c = read_char_raw();
        bool negative = false;
        if (c == '-' || c == '+') {
            negative = c == '-';
            c = read_char_raw();
        }

        long double result = 0;
        while ('0' <= c && c <= '9') {
            result = result * 10 + (c - '0');
            c = read_char_raw();
        }
        if (c == '.') {
            long double place = 0.1L;
            c = read_char_raw();
            while ('0' <= c && c <= '9') {
                result += (c - '0') * place;
                place *= 0.1L;
                c = read_char_raw();
            }
        }
        if (c == 'e' || c == 'E') {
            c = read_char_raw();
            bool exponent_negative = false;
            if (c == '-' || c == '+') {
                exponent_negative = c == '-';
                c = read_char_raw();
            }
            int exponent = 0;
            while ('0' <= c && c <= '9') {
                exponent = exponent * 10 + (c - '0');
                c = read_char_raw();
            }
            long double scale = 1;
            long double power = 10;
            while (exponent > 0) {
                if (exponent & 1) scale *= power;
                power *= power;
                exponent >>= 1;
            }
            result = exponent_negative ? result / scale : result * scale;
        }
        value = static_cast<T>(negative ? -result : result);
        return true;
    }

    template <class T>
    std::enable_if_t<
        internal::has_val_method_v<T>
            && !internal::is_integral_v<T>
            && !internal::is_range_v<T>,
        bool
    >
    read(T& value) {
        long long x;
        if (!read(x)) return false;
        if constexpr (internal::has_static_mod_raw_v<T>) {
            if (x >= 0 && uint64_t(x) < uint64_t(T::mod())) {
                value = T::raw(uint32_t(x));
            } else {
                value = T(x);
            }
        } else {
            value = T(x);
        }
        return true;
    }

    template <class First, class Second>
    bool read(std::pair<First, Second>& value) {
        if (!read(value.first)) return false;
        return read(value.second);
    }

    template <class Range>
    std::enable_if_t<
        internal::is_range_v<Range>
            && !internal::is_string_like_v<Range>,
        bool
    >
    read(Range& range) {
        using StoredValue = internal::range_stored_value_t<Range>;
        constexpr bool nested = internal::is_range_v<StoredValue>
                                && !internal::is_string_like_v<StoredValue>;

        for (auto&& value : range) {
            if constexpr (std::is_same_v<StoredValue, bool> && !nested) {
                bool x;
                if (!read(x)) return false;
                value = x;
            } else {
                if (!read(value)) return false;
            }
        }
        return true;
    }

    template <class First, class Second, class... Rest>
    bool read(First& first, Second& second, Rest&... rest) {
        if (!read(first)) return false;
        return read(second, rest...);
    }

    template <class T>
    FastInput& operator>>(T& value) {
        if (!read(value)) std::abort();
        return *this;
    }
};

struct FastOutput {
    static constexpr int buffer_size = 1 << 20;

   private:
    inline static const auto digit_quads = [] {
        std::array<char, 40000> result{};
        for (int i = 0; i < 10000; i++) {
            int value = i;
            for (int j = 3; j >= 0; j--) {
                result[4 * i + j] = char('0' + value % 10);
                value /= 10;
            }
        }
        return result;
    }();

    std::FILE* _stream;
    char _buffer[buffer_size];
    int _position;
    int _precision;
    std::chars_format _float_format;
    char _range_separator;
    std::string* _capture = nullptr;

    template <class T>
    std::string format_cell(const T& value) {
        std::string result;
        struct CaptureGuard {
            std::string*& target;
            std::string* previous;
            ~CaptureGuard() { target = previous; }
        } guard{_capture, _capture};
        _capture = &result;
        write(value);
        return result;
    }

    template <class Matrix>
    void write_aligned_matrix(const Matrix& matrix) {
        std::vector<std::vector<std::string>> rows;
        std::vector<std::size_t> widths;
        for (const auto& row : matrix) {
            auto& cells = rows.emplace_back();
            std::size_t column = 0;
            for (const auto& value : row) {
                cells.push_back(format_cell(value));
                if (column == widths.size()) widths.push_back(0);
                widths[column] = std::max(widths[column], cells.back().size());
                ++column;
            }
        }
        bool first = true;
        for (const auto& row : rows) {
            if (!first) write_char('\n');
            first = false;
            for (std::size_t column = 0; column < row.size(); ++column) {
                if (column != 0) write_char(_range_separator);
                for (std::size_t padding = row[column].size();
                     padding < widths[column]; ++padding) {
                    write_char(' ');
                }
                write(row[column]);
            }
        }
    }

   public:
    explicit FastOutput(std::FILE* stream = stdout)
        : _stream(stream),
          _position(0),
          _precision(6),
          _float_format(std::chars_format::general),
          _range_separator(' ') {
        if (_stream == stdout
            && internal::standard_output_instance == nullptr) {
            internal::standard_output_instance = this;
        }
    }

    FastOutput(const FastOutput&) = delete;
    FastOutput& operator=(const FastOutput&) = delete;

    ~FastOutput() {
        flush();
        if (internal::standard_output_instance == this) {
            internal::standard_output_instance = nullptr;
        }
    }

    void flush() {
        if (_position != 0) {
            std::fwrite(_buffer, 1, _position, _stream);
            _position = 0;
        }
        std::fflush(_stream);
    }

    void write_char(char c) {
        if (_capture != nullptr) {
            _capture->push_back(c);
            return;
        }
        if (_position == buffer_size) flush();
        _buffer[_position++] = c;
    }

    void write(const char* s) {
        while (*s != '\0') write_char(*s++);
    }

    void write(const std::string& s) {
        if (_capture != nullptr) {
            _capture->append(s);
            return;
        }
        std::size_t position = 0;
        while (position < s.size()) {
            if (_position == buffer_size) flush();
            const std::size_t copied =
                std::min<std::size_t>(buffer_size - _position, s.size() - position);
            std::memcpy(_buffer + _position, s.data() + position, copied);
            _position += int(copied);
            position += copied;
        }
    }

    void write(char c) {
        write_char(c);
    }

    void write(bool value) {
        write_char(value ? '1' : '0');
    }

    template <class T>
    std::enable_if_t<std::is_floating_point_v<T>>
    write(T value) {
        char digits[128];
        auto [end, error] = std::to_chars(
            digits,
            digits + sizeof(digits),
            value,
            _float_format,
            _precision
        );
        if (error != std::errc()) std::abort();
        for (const char* pointer = digits; pointer != end; pointer++) {
            write_char(*pointer);
        }
    }

    template <class T>
    std::enable_if_t<
        internal::is_integral_v<T>
            && !std::is_same_v<std::remove_cv_t<T>, bool>
            && !std::is_same_v<std::remove_cv_t<T>, char>
    >
    write(T value) {
        using Raw = std::remove_cv_t<T>;
        using Unsigned = internal::make_unsigned_t<Raw>;

        Unsigned magnitude;
        if constexpr (internal::is_signed_v<Raw>) {
            if (value < 0) {
                write_char('-');
                magnitude = Unsigned(0) - Unsigned(value);
            } else {
                magnitude = Unsigned(value);
            }
        } else {
            magnitude = value;
        }

        if (magnitude == 0) {
            write_char('0');
            return;
        }

        unsigned chunks[16];
        int count = 0;
        while (magnitude >= 10000) {
            const Unsigned quotient = magnitude / 10000;
            chunks[count++] = unsigned(magnitude - quotient * 10000);
            magnitude = quotient;
        }
        if (_capture == nullptr && _position > buffer_size - 64) flush();
        char captured[64];
        char* const begin = _capture != nullptr ? captured : _buffer + _position;
        char* destination = begin;
        const unsigned leading = unsigned(magnitude);
        const char* first = digit_quads.data() + 4 * leading;
        int skip = leading < 10 ? 3 : leading < 100 ? 2 : leading < 1000 ? 1 : 0;
        for (; skip < 4; skip++) *destination++ = first[skip];
        while (count--) {
            const char* digits = digit_quads.data() + 4 * chunks[count];
            std::memcpy(destination, digits, 4);
            destination += 4;
        }
        if (_capture != nullptr) {
            _capture->append(begin, destination - begin);
        } else {
            _position += int(destination - begin);
        }
    }

    template <class T>
    std::enable_if_t<
        internal::has_val_method_v<T>
            && !internal::is_integral_v<T>
            && !internal::is_range_v<T>
    >
    write(const T& value) {
        write(value.val());
    }

    template <class First, class Second>
    void write(const std::pair<First, Second>& value) {
        write(value.first);
        write_char(' ');
        write(value.second);
    }

    template <class Range>
    std::enable_if_t<
        internal::is_range_v<Range>
            && !internal::is_string_like_v<Range>
    >
    write(const Range& range) {
        using StoredValue = internal::range_stored_value_t<const Range>;
        constexpr bool nested = internal::is_range_v<StoredValue>
                                && !internal::is_string_like_v<StoredValue>;

        bool first = true;
        for (const auto& value : range) {
            if (!first) write_char(nested ? '\n' : _range_separator);
            first = false;
            if constexpr (std::is_same_v<StoredValue, bool> && !nested) {
                write(static_cast<bool>(value));
            } else {
                write(value);
            }
        }
    }

    template <class First, class... Rest>
    void print(const First& first, const Rest&... rest) {
        write(first);
        ((write_char(' '), write(rest)), ...);
    }

    void println() {
        write_char('\n');
    }

    void set_precision(int precision) {
        _precision = precision;
    }

    void set_fixed(int precision = 6) {
        _float_format = std::chars_format::fixed;
        _precision = precision;
    }

    void set_general(int precision = 6) {
        _float_format = std::chars_format::general;
        _precision = precision;
    }

    void set_range_separator(char separator) {
        _range_separator = separator;
    }

    template <class Matrix>
    void write_aligned(const Matrix& matrix) {
        using Row = internal::range_stored_value_t<const Matrix>;
        using Cell = internal::range_stored_value_t<const Row>;
        static_assert(internal::is_range_v<Row> && !internal::is_string_like_v<Row>,
                      "write_aligned requires a two-dimensional range");
        static_assert(!internal::is_range_v<Cell> || internal::is_string_like_v<Cell>,
                      "write_aligned requires scalar cells");
        write_aligned_matrix(matrix);
    }

    template <class Matrix>
    void println_aligned(const Matrix& matrix) {
        write_aligned(matrix);
        write_char('\n');
    }

    template <class... Args>
    void println(const Args&... args) {
        print(args...);
        write_char('\n');
    }

    template <class T>
    FastOutput& operator<<(const T& value) {
        write(value);
        return *this;
    }
};

}  // namespace utilities
}  // namespace m1une


#line 9 "verify/ds/segtree/persistent_dynamic_dual_segtree.test.cpp"
#include <optional>
#line 11 "verify/ds/segtree/persistent_dynamic_dual_segtree.test.cpp"

#line 1 "monoid/add.hpp"



namespace m1une {
namespace monoid {

// Monoid for addition (Range Sum).
template <typename T>
struct Add {
    using value_type = T;
    static constexpr bool commutative = true;

    // Returns the identity element for addition, which is 0.
    static constexpr T id() {
        return T(0);
    }

    // Returns the sum of a and b.
    static constexpr T op(const T& a, const T& b) {
        return a + b;
    }

    static constexpr T inv(const T& x) {
        return -x;
    }
};

}  // namespace monoid
}  // namespace m1une


#line 1 "monoid/update.hpp"



#line 5 "monoid/update.hpp"

namespace m1une {
namespace monoid {

// Monoid for range updates/assignments.
// Uses std::optional to represent the presence of an assignment.
template <typename T>
struct Update {
    using value_type = std::optional<T>;
    static constexpr bool commutative = false;

    // The identity element represents "no operation".
    static constexpr value_type id() {
        return std::nullopt;
    }

    // Composes two updates. The newer operation 'a' overwrites the older 'b'.
    // If 'a' does not exist, it falls back to 'b'.
    static constexpr value_type op(const value_type& a, const value_type& b) {
        return a.has_value() ? a : b;
    }
};

}  // namespace monoid
}  // namespace m1une


#line 14 "verify/ds/segtree/persistent_dynamic_dual_segtree.test.cpp"

namespace {

void test_versions() {
    using Add = m1une::monoid::Add<long long>;
    using Seg = m1une::ds::PersistentDynamicDualSegtree<Add, int>;

    Seg base(-50, 60, 5);
    base.reserve(20000);
    Seg first = base.apply(-10, 20, 3);
    Seg second = first.set(0, 100);
    Seg branch = base.apply(5, 15, 7);

    assert(base.get(0) == 5);
    assert(first.get(0) == 8);
    assert(second.get(0) == 100);
    assert(branch.get(0) == 5);
    assert(first.get(-20) == 5);
    assert(branch.get(10) == 12);
    assert(base.node_count() == branch.node_count());

    std::size_t live = base.node_count();
    second.release();
    assert(base.node_count() < live);
    assert(second.get(0) == 5);
    assert(first.get(0) == 8);
    first.release();
    branch.release();
    assert(base.node_count() == 0);
}

void test_update_order() {
    using Update = m1une::monoid::Update<int>;
    using Seg = m1une::ds::PersistentDynamicDualSegtree<Update, int>;

    Seg base(-10, 11, std::optional<int>(1));
    Seg first = base.apply(-5, 6, std::optional<int>(2));
    Seg second = first.apply(-2, 3, std::optional<int>(4));

    assert(base.get(0).value() == 1);
    assert(first.get(0).value() == 2);
    assert(second.get(0).value() == 4);
    assert(second.get(4).value() == 2);
    assert(second.get(8).value() == 1);
}

void test_randomized() {
    using Add = m1une::monoid::Add<long long>;
    using Seg = m1une::ds::PersistentDynamicDualSegtree<Add, int>;
    constexpr int left = -23;
    constexpr int right = 29;

    std::vector<Seg> versions;
    versions.emplace_back(left, right, 4);
    std::vector<std::vector<long long>> expected(1, std::vector<long long>(right - left, 4));

    std::uint64_t state = 9;
    auto random = [&state]() {
        state ^= state << 7;
        state ^= state >> 9;
        return state;
    };

    for (int step = 0; step < 1200; step++) {
        std::size_t from = std::size_t(random() % versions.size());
        std::vector<long long> next = expected[from];
        Seg tree = versions[from];

        if (random() & 1) {
            int l = left + int(random() % (next.size() + 1));
            int r = left + int(random() % (next.size() + 1));
            if (r < l) std::swap(l, r);
            long long x = static_cast<long long>(random() % 20);
            tree = tree.apply(l, r, x);
            for (int p = l; p < r; p++) next[std::size_t(p - left)] += x;
        } else {
            int p = left + int(random() % next.size());
            long long x = static_cast<long long>(random() % 100);
            tree = tree.set(p, x);
            next[std::size_t(p - left)] = x;
        }

        versions.push_back(tree);
        expected.push_back(next);
        [[maybe_unused]] std::size_t check = std::size_t(random() % versions.size());
        [[maybe_unused]] int p = left + int(random() % next.size());
        assert(versions[check].get(p) == expected[check][std::size_t(p - left)]);
    }
}

}  // namespace

int main() {
    m1une::utilities::FastInput fast_input;
    m1une::utilities::FastOutput fast_output;

    test_versions();
    test_update_order();
    test_randomized();

    long long a, b;
    fast_input >> a >> b;
    fast_output << a + b << '\n';
}

Back to top page