m1une's library

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

View on GitHub

:heavy_check_mark: verify/ds/segtree/chmin_chmax_add_segtree.test.cpp

Depends on

Code

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

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

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

namespace {

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

    for (int trial = 0; trial < 1500; ++trial) {
        int size = int(random() % 100);
        std::vector<long long> values(size);
        for (long long& value : values) {
            value = static_cast<long long>(random() % 201) - 100;
        }
        m1une::ds::ChminChmaxAddSegtree<long long> seg(values);

        for (int operation = 0; operation < 1000; ++operation) {
            int left = int(random() % (size + 1));
            int right = int(random() % (size + 1));
            if (right < left) std::swap(left, right);
            int type = int(random() % 8);
            long long value =
                static_cast<long long>(random() % 101) - 50;

            if (type == 0) {
                seg.chmin(left, right, value);
                for (int index = left; index < right; ++index) {
                    values[index] = std::min(values[index], value);
                }
            } else if (type == 1) {
                seg.chmax(left, right, value);
                for (int index = left; index < right; ++index) {
                    values[index] = std::max(values[index], value);
                }
            } else if (type == 2) {
                seg.add(left, right, value);
                for (int index = left; index < right; ++index) {
                    values[index] += value;
                }
            } else if (type == 3 && left < right) {
                [[maybe_unused]] long long expected =
                    *std::min_element(
                        values.begin() + left,
                        values.begin() + right
                    );
                assert(seg.min(left, right) == expected);
            } else if (type == 4 && left < right) {
                [[maybe_unused]] long long expected =
                    *std::max_element(
                        values.begin() + left,
                        values.begin() + right
                    );
                assert(seg.max(left, right) == expected);
            } else if (type == 5 && size != 0) {
                int index = int(random() % size);
                seg.set(index, value);
                values[index] = value;
            } else {
                [[maybe_unused]] long long expected = std::accumulate(
                    values.begin() + left,
                    values.begin() + right,
                    0LL
                );
                assert(seg.sum(left, right) == expected);
            }

            assert(seg.to_vector() == values);
            assert(
                seg.all_sum()
                == std::accumulate(values.begin(), values.end(), 0LL)
            );
            if (!values.empty()) {
                assert(
                    seg.all_min()
                    == *std::min_element(values.begin(), values.end())
                );
                assert(
                    seg.all_max()
                    == *std::max_element(values.begin(), values.end())
                );
            }
        }
    }
}

}  // namespace

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

    test_randomized();

    int n, q;
    fast_input >> n >> q;
    std::vector<long long> values(n);
    for (long long& value : values) fast_input >> value;
    m1une::ds::ChminChmaxAddSegtree<long long> seg(values);

    while (q--) {
        int type, left, right;
        fast_input >> type >> left >> right;
        if (type == 0) {
            long long value;
            fast_input >> value;
            seg.chmin(left, right, value);
        } else if (type == 1) {
            long long value;
            fast_input >> value;
            seg.chmax(left, right, value);
        } else if (type == 2) {
            long long value;
            fast_input >> value;
            seg.add(left, right, value);
        } else {
            fast_output << seg.sum(left, right) << '\n';
        }
    }
}
#line 1 "verify/ds/segtree/chmin_chmax_add_segtree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum"

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



#include <algorithm>
#include <cassert>
#include <concepts>
#include <limits>
#include <vector>

namespace m1une {
namespace ds {

// Segment Tree Beats supporting range chmin/chmax/add and sum/min/max queries.
template <std::signed_integral T = long long>
struct ChminChmaxAddSegtree {
   private:
    static constexpr T positive_infinity = std::numeric_limits<T>::max();
    static constexpr T negative_infinity = std::numeric_limits<T>::lowest();

    struct Node {
        T sum = 0;
        T maximum = negative_infinity;
        T second_maximum = negative_infinity;
        T minimum = positive_infinity;
        T second_minimum = positive_infinity;
        T lazy_add = 0;
        int maximum_count = 0;
        int minimum_count = 0;
        int length = 0;
    };

    int _n;
    std::vector<Node> _nodes;

    static Node make_leaf(T value) {
        Node node;
        node.sum = value;
        node.maximum = value;
        node.minimum = value;
        node.maximum_count = 1;
        node.minimum_count = 1;
        node.length = 1;
        return node;
    }

    static Node merge_nodes(const Node& left, const Node& right) {
        Node result;
        result.sum = left.sum + right.sum;
        result.length = left.length + right.length;

        result.maximum = std::max(left.maximum, right.maximum);
        result.maximum_count = 0;
        result.second_maximum = negative_infinity;
        if (left.maximum == result.maximum) {
            result.maximum_count += left.maximum_count;
            result.second_maximum =
                std::max(result.second_maximum, left.second_maximum);
        } else {
            result.second_maximum =
                std::max(result.second_maximum, left.maximum);
        }
        if (right.maximum == result.maximum) {
            result.maximum_count += right.maximum_count;
            result.second_maximum =
                std::max(result.second_maximum, right.second_maximum);
        } else {
            result.second_maximum =
                std::max(result.second_maximum, right.maximum);
        }

        result.minimum = std::min(left.minimum, right.minimum);
        result.minimum_count = 0;
        result.second_minimum = positive_infinity;
        if (left.minimum == result.minimum) {
            result.minimum_count += left.minimum_count;
            result.second_minimum =
                std::min(result.second_minimum, left.second_minimum);
        } else {
            result.second_minimum =
                std::min(result.second_minimum, left.minimum);
        }
        if (right.minimum == result.minimum) {
            result.minimum_count += right.minimum_count;
            result.second_minimum =
                std::min(result.second_minimum, right.second_minimum);
        } else {
            result.second_minimum =
                std::min(result.second_minimum, right.minimum);
        }
        return result;
    }

    void build(int node, int left, int right, const std::vector<T>& values) {
        if (right - left == 1) {
            _nodes[node] = make_leaf(values[left]);
            return;
        }
        int middle = left + (right - left) / 2;
        build(node * 2, left, middle, values);
        build(node * 2 + 1, middle, right, values);
        pull(node);
    }

    void pull(int node) {
        _nodes[node] = merge_nodes(
            _nodes[node * 2],
            _nodes[node * 2 + 1]
        );
    }

    void apply_add(int node, T value) {
        Node& current = _nodes[node];
        current.sum += value * T(current.length);
        current.maximum += value;
        current.minimum += value;
        if (current.second_maximum != negative_infinity) {
            current.second_maximum += value;
        }
        if (current.second_minimum != positive_infinity) {
            current.second_minimum += value;
        }
        current.lazy_add += value;
    }

    void apply_chmin(int node, T value) {
        Node& current = _nodes[node];
        if (current.maximum <= value) return;
        current.sum +=
            (value - current.maximum) * T(current.maximum_count);
        if (current.minimum == current.maximum) {
            current.minimum = value;
        } else if (current.second_minimum == current.maximum) {
            current.second_minimum = value;
        }
        current.maximum = value;
    }

    void apply_chmax(int node, T value) {
        Node& current = _nodes[node];
        if (value <= current.minimum) return;
        current.sum +=
            (value - current.minimum) * T(current.minimum_count);
        if (current.maximum == current.minimum) {
            current.maximum = value;
        } else if (current.second_maximum == current.minimum) {
            current.second_maximum = value;
        }
        current.minimum = value;
    }

    void push(int node) {
        Node& current = _nodes[node];
        if (current.length == 1) {
            current.lazy_add = 0;
            return;
        }
        if (current.lazy_add != 0) {
            apply_add(node * 2, current.lazy_add);
            apply_add(node * 2 + 1, current.lazy_add);
            current.lazy_add = 0;
        }
        apply_chmin(node * 2, current.maximum);
        apply_chmin(node * 2 + 1, current.maximum);
        apply_chmax(node * 2, current.minimum);
        apply_chmax(node * 2 + 1, current.minimum);
    }

    void range_chmin(
        int node,
        int left,
        int right,
        int query_left,
        int query_right,
        T value
    ) {
        Node& current = _nodes[node];
        if (
            query_right <= left ||
            right <= query_left ||
            current.maximum <= value
        ) {
            return;
        }
        if (
            query_left <= left &&
            right <= query_right &&
            current.second_maximum < value
        ) {
            apply_chmin(node, value);
            return;
        }
        push(node);
        int middle = left + (right - left) / 2;
        range_chmin(
            node * 2,
            left,
            middle,
            query_left,
            query_right,
            value
        );
        range_chmin(
            node * 2 + 1,
            middle,
            right,
            query_left,
            query_right,
            value
        );
        pull(node);
    }

    void range_chmax(
        int node,
        int left,
        int right,
        int query_left,
        int query_right,
        T value
    ) {
        Node& current = _nodes[node];
        if (
            query_right <= left ||
            right <= query_left ||
            value <= current.minimum
        ) {
            return;
        }
        if (
            query_left <= left &&
            right <= query_right &&
            value < current.second_minimum
        ) {
            apply_chmax(node, value);
            return;
        }
        push(node);
        int middle = left + (right - left) / 2;
        range_chmax(
            node * 2,
            left,
            middle,
            query_left,
            query_right,
            value
        );
        range_chmax(
            node * 2 + 1,
            middle,
            right,
            query_left,
            query_right,
            value
        );
        pull(node);
    }

    void range_add(
        int node,
        int left,
        int right,
        int query_left,
        int query_right,
        T value
    ) {
        if (query_right <= left || right <= query_left) return;
        if (query_left <= left && right <= query_right) {
            apply_add(node, value);
            return;
        }
        push(node);
        int middle = left + (right - left) / 2;
        range_add(
            node * 2,
            left,
            middle,
            query_left,
            query_right,
            value
        );
        range_add(
            node * 2 + 1,
            middle,
            right,
            query_left,
            query_right,
            value
        );
        pull(node);
    }

    Node range_query(
        int node,
        int left,
        int right,
        int query_left,
        int query_right
    ) {
        if (query_left <= left && right <= query_right) {
            return _nodes[node];
        }
        push(node);
        int middle = left + (right - left) / 2;
        if (query_right <= middle) {
            return range_query(
                node * 2,
                left,
                middle,
                query_left,
                query_right
            );
        }
        if (middle <= query_left) {
            return range_query(
                node * 2 + 1,
                middle,
                right,
                query_left,
                query_right
            );
        }
        return merge_nodes(
            range_query(
                node * 2,
                left,
                middle,
                query_left,
                query_right
            ),
            range_query(
                node * 2 + 1,
                middle,
                right,
                query_left,
                query_right
            )
        );
    }

   public:
    ChminChmaxAddSegtree() : _n(0) {}

    explicit ChminChmaxAddSegtree(int n)
        : _n(n) {
        assert(0 <= n);
        if (_n != 0) {
            _nodes.resize(std::size_t(_n) * 4);
            std::vector<T> values(_n, T(0));
            build(1, 0, _n, values);
        }
    }

    explicit ChminChmaxAddSegtree(const std::vector<T>& values)
        : _n(int(values.size())),
          _nodes(values.empty() ? 0 : values.size() * 4) {
        if (_n != 0) build(1, 0, _n, values);
    }

    int size() const {
        return _n;
    }

    bool empty() const {
        return _n == 0;
    }

    void chmin(int left, int right, T value) {
        assert(0 <= left && left <= right && right <= _n);
        if (left != right) {
            range_chmin(1, 0, _n, left, right, value);
        }
    }

    void chmax(int left, int right, T value) {
        assert(0 <= left && left <= right && right <= _n);
        if (left != right) {
            range_chmax(1, 0, _n, left, right, value);
        }
    }

    void add(int left, int right, T value) {
        assert(0 <= left && left <= right && right <= _n);
        if (left != right) {
            range_add(1, 0, _n, left, right, value);
        }
    }

    void range_chmin(int left, int right, T value) {
        chmin(left, right, value);
    }

    void range_chmax(int left, int right, T value) {
        chmax(left, right, value);
    }

    void range_add(int left, int right, T value) {
        add(left, right, value);
    }

    T sum(int left, int right) {
        assert(0 <= left && left <= right && right <= _n);
        return left == right
            ? T(0)
            : range_query(1, 0, _n, left, right).sum;
    }

    T min(int left, int right) {
        assert(0 <= left && left < right && right <= _n);
        return range_query(1, 0, _n, left, right).minimum;
    }

    T max(int left, int right) {
        assert(0 <= left && left < right && right <= _n);
        return range_query(1, 0, _n, left, right).maximum;
    }

    T range_sum(int left, int right) {
        return sum(left, right);
    }

    T range_min(int left, int right) {
        return min(left, right);
    }

    T range_max(int left, int right) {
        return max(left, right);
    }

    T all_sum() const {
        return _n == 0 ? T(0) : _nodes[1].sum;
    }

    T all_min() const {
        assert(_n != 0);
        return _nodes[1].minimum;
    }

    T all_max() const {
        assert(_n != 0);
        return _nodes[1].maximum;
    }

    T get(int index) {
        assert(0 <= index && index < _n);
        return sum(index, index + 1);
    }

    T operator[](int index) {
        return get(index);
    }

    void set(int index, T value) {
        assert(0 <= index && index < _n);
        T current = get(index);
        add(index, index + 1, value - current);
    }

    std::vector<T> to_vector() {
        std::vector<T> result(_n);
        for (int index = 0; index < _n; ++index) {
            result[index] = get(index);
        }
        return result;
    }
};

}  // namespace ds
}  // namespace m1une


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

#line 7 "verify/ds/segtree/chmin_chmax_add_segtree.test.cpp"
#include <cstdint>
#line 1 "utilities/fast_io.hpp"



#line 5 "utilities/fast_io.hpp"
#include <array>
#include <cerrno>
#include <charconv>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#line 12 "utilities/fast_io.hpp"
#include <cstring>
#include <iterator>
#include <string>
#include <sys/stat.h>
#include <type_traits>
#include <utility>
#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/chmin_chmax_add_segtree.test.cpp"
#include <numeric>
#line 11 "verify/ds/segtree/chmin_chmax_add_segtree.test.cpp"

namespace {

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

    for (int trial = 0; trial < 1500; ++trial) {
        int size = int(random() % 100);
        std::vector<long long> values(size);
        for (long long& value : values) {
            value = static_cast<long long>(random() % 201) - 100;
        }
        m1une::ds::ChminChmaxAddSegtree<long long> seg(values);

        for (int operation = 0; operation < 1000; ++operation) {
            int left = int(random() % (size + 1));
            int right = int(random() % (size + 1));
            if (right < left) std::swap(left, right);
            int type = int(random() % 8);
            long long value =
                static_cast<long long>(random() % 101) - 50;

            if (type == 0) {
                seg.chmin(left, right, value);
                for (int index = left; index < right; ++index) {
                    values[index] = std::min(values[index], value);
                }
            } else if (type == 1) {
                seg.chmax(left, right, value);
                for (int index = left; index < right; ++index) {
                    values[index] = std::max(values[index], value);
                }
            } else if (type == 2) {
                seg.add(left, right, value);
                for (int index = left; index < right; ++index) {
                    values[index] += value;
                }
            } else if (type == 3 && left < right) {
                [[maybe_unused]] long long expected =
                    *std::min_element(
                        values.begin() + left,
                        values.begin() + right
                    );
                assert(seg.min(left, right) == expected);
            } else if (type == 4 && left < right) {
                [[maybe_unused]] long long expected =
                    *std::max_element(
                        values.begin() + left,
                        values.begin() + right
                    );
                assert(seg.max(left, right) == expected);
            } else if (type == 5 && size != 0) {
                int index = int(random() % size);
                seg.set(index, value);
                values[index] = value;
            } else {
                [[maybe_unused]] long long expected = std::accumulate(
                    values.begin() + left,
                    values.begin() + right,
                    0LL
                );
                assert(seg.sum(left, right) == expected);
            }

            assert(seg.to_vector() == values);
            assert(
                seg.all_sum()
                == std::accumulate(values.begin(), values.end(), 0LL)
            );
            if (!values.empty()) {
                assert(
                    seg.all_min()
                    == *std::min_element(values.begin(), values.end())
                );
                assert(
                    seg.all_max()
                    == *std::max_element(values.begin(), values.end())
                );
            }
        }
    }
}

}  // namespace

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

    test_randomized();

    int n, q;
    fast_input >> n >> q;
    std::vector<long long> values(n);
    for (long long& value : values) fast_input >> value;
    m1une::ds::ChminChmaxAddSegtree<long long> seg(values);

    while (q--) {
        int type, left, right;
        fast_input >> type >> left >> right;
        if (type == 0) {
            long long value;
            fast_input >> value;
            seg.chmin(left, right, value);
        } else if (type == 1) {
            long long value;
            fast_input >> value;
            seg.chmax(left, right, value);
        } else if (type == 2) {
            long long value;
            fast_input >> value;
            seg.add(left, right, value);
        } else {
            fast_output << seg.sum(left, right) << '\n';
        }
    }
}
Back to top page