verify/ds/range_query/merge_sort_tree.test.cpp

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

Depends on

• Merge Sort Tree (ds/range_query/merge_sort_tree.hpp)
• Bit Ceil (math/bit_ceil.hpp)
• Fast IO (utilities/fast_io.hpp)

Code

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

#include "../../../ds/range_query/merge_sort_tree.hpp"

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

namespace {

void test_fixed() {
    m1une::ds::MergeSortTree<int> empty;
    assert(empty.empty());
    assert(empty.size() == 0);
    assert(empty.count(0, 0, 7) == 0);
    assert(empty.count_less(0, 0, 7) == 0);
    assert(empty.range_sum(0, 0) == 0);
    assert(empty.sum_less_equal(0, 0, 7) == 0);
    assert(!empty.prev_value(0, 0, 7));
    assert(!empty.next_value(0, 0, 7));

    std::vector<std::string> words = {"pear", "apple", "pear", "plum"};
    m1une::ds::MergeSortTree<std::string> strings(words);
    assert(strings.count(0, 4, std::string("pear")) == 2);
    assert(strings.count(0, 4, std::string("a"), std::string("q")) == 4);
    assert(strings.kth_smallest(0, 4, 0) == "apple");
    assert(strings.prev_value(0, 4, std::string("pear")).value() == "apple");
    assert(strings.next_value(0, 4, std::string("pebble")).value() == "plum");

    std::vector<int> large = {1'000'000'000, 1'000'000'000, -1'000'000'000};
    m1une::ds::MergeSortTree<int, long long> wide(large);
    assert(wide.range_sum(0, 3) == 1'000'000'000LL);
    assert(wide.sum_less_equal(0, 3, 1'000'000'000) == 1'000'000'000LL);
}

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

    for (int trial = 0; trial < 500; trial++) {
        int size = int(random() % 60);
        std::vector<int> values(size);
        for (int& value : values) value = int(random() % 41) - 20;
        m1une::ds::MergeSortTree<int> tree(values);
        assert(tree.size() == size);
        assert(tree.empty() == values.empty());
        for (int i = 0; i < size; i++) assert(tree[i] == values[i]);

        for (int query = 0; query < 300; query++) {
            int left = int(random() % (size + 1));
            int right = int(random() % (size + 1));
            if (left > right) std::swap(left, right);
            int lower = int(random() % 51) - 25;
            int upper = int(random() % 51) - 25;
            if (lower > upper) std::swap(lower, upper);

            int less = 0;
            int less_equal = 0;
            int equal = 0;
            int between = 0;
            int total_sum = 0;
            int less_sum = 0;
            int less_equal_sum = 0;
            int equal_sum = 0;
            int between_sum = 0;
            std::optional<int> previous;
            std::optional<int> next;
            std::vector<int> sorted;
            for (int i = left; i < right; i++) {
                sorted.push_back(values[i]);
                less += values[i] < lower;
                less_equal += values[i] <= lower;
                equal += values[i] == lower;
                between += lower <= values[i] && values[i] < upper;
                total_sum += values[i];
                if (values[i] < lower) less_sum += values[i];
                if (values[i] <= lower) less_equal_sum += values[i];
                if (values[i] == lower) equal_sum += values[i];
                if (lower <= values[i] && values[i] < upper) between_sum += values[i];
                if (values[i] < lower && (!previous || *previous < values[i])) {
                    previous = values[i];
                }
                if (lower <= values[i] && (!next || values[i] < *next)) {
                    next = values[i];
                }
            }
            std::sort(sorted.begin(), sorted.end());

            assert(tree.count_less(left, right, lower) == less);
            assert(tree.count_less_equal(left, right, lower) == less_equal);
            assert(tree.count(left, right, lower) == equal);
            assert(tree.count(left, right, lower, upper) == between);
            assert(tree.range_sum(left, right) == total_sum);
            assert(tree.sum_less(left, right, lower) == less_sum);
            assert(tree.sum_less_equal(left, right, lower) == less_equal_sum);
            assert(tree.sum(left, right, lower) == equal_sum);
            assert(tree.sum(left, right, lower, upper) == between_sum);
            assert(tree.prev_value(left, right, lower) == previous);
            assert(tree.next_value(left, right, lower) == next);
            if (!sorted.empty()) {
                int k = int(random() % sorted.size());
                assert(tree.kth_smallest(left, right, k) == sorted[k]);
                assert(tree.kth_largest(left, right, k) == sorted[sorted.size() - 1 - k]);
            }
        }
    }
}

}  // namespace

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

    test_fixed();
    test_randomized();
    int n, query_count;
    fast_input >> n >> query_count;
    std::vector<int> values(n);
    for (int& value : values) fast_input >> value;

    m1une::ds::MergeSortTree<int> tree(values);
    while (query_count--) {
        int left, right, value;
        fast_input >> left >> right >> value;
        fast_output << tree.count(left, right, value) << '\n';
    }
}

#line 1 "verify/ds/range_query/merge_sort_tree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/static_range_frequency"

#line 1 "ds/range_query/merge_sort_tree.hpp"



#include <algorithm>
#include <cassert>
#include <concepts>
#include <cstddef>
#include <iterator>
#include <limits>
#include <optional>
#include <utility>
#include <vector>

#line 1 "math/bit_ceil.hpp"



namespace m1une {
namespace math {

template <typename T>
constexpr T bit_ceil(T n) {
    if (n <= 1) return 1;
    T x = 1;
    while (x < n) x <<= 1;
    return x;
}

}  // namespace math
}  // namespace m1une


#line 15 "ds/range_query/merge_sort_tree.hpp"

namespace m1une {
namespace ds {

// Static range counting, sums, and order statistics for arbitrary ordered values.
template <class T, class Sum = T>
class MergeSortTree {
   private:
    struct Node {
        std::vector<T> values;
        std::vector<Sum> prefix_sum;
    };

    static constexpr bool supports_sum = requires(Sum left, Sum right, const T& value) {
        Sum{};
        static_cast<Sum>(value);
        { left + right } -> std::convertible_to<Sum>;
        { left - right } -> std::convertible_to<Sum>;
    };

    int _n;
    int _size;
    std::vector<T> _values;
    std::vector<T> _sorted_values;
    std::vector<Node> _tree;
    std::vector<Sum> _original_prefix_sum;

    template <class Callback>
    void visit(int left, int right, Callback&& callback) const {
        left += _size;
        right += _size;
        while (left < right) {
            if (left & 1) callback(_tree[left++]);
            if (right & 1) callback(_tree[--right]);
            left >>= 1;
            right >>= 1;
        }
    }

    static bool equivalent(const T& left, const T& right) {
        return !(left < right) && !(right < left);
    }

   public:
    MergeSortTree()
        : _n(0),
          _size(1),
          _tree(2) {
        if constexpr (supports_sum) _original_prefix_sum.push_back(Sum{});
    }

    explicit MergeSortTree(const std::vector<T>& values)
        : _n(0),
          _size(1) {
        assert(values.size() <= std::size_t(std::numeric_limits<int>::max()));
        _n = int(values.size());
        _size = m1une::math::bit_ceil(std::max(1, _n));
        _values = values;
        _sorted_values = values;
        std::sort(_sorted_values.begin(), _sorted_values.end());
        _sorted_values.erase(
            std::unique(
                _sorted_values.begin(),
                _sorted_values.end(),
                [](const T& left, const T& right) {
                    return equivalent(left, right);
                }
            ),
            _sorted_values.end()
        );

        _tree.resize(2 * _size);
        for (int index = 0; index < _n; index++) {
            _tree[_size + index].values.push_back(values[index]);
        }
        for (int node = _size - 1; node >= 1; node--) {
            const auto& left = _tree[2 * node].values;
            const auto& right = _tree[2 * node + 1].values;
            _tree[node].values.reserve(left.size() + right.size());
            std::merge(
                left.begin(),
                left.end(),
                right.begin(),
                right.end(),
                std::back_inserter(_tree[node].values)
            );
        }

        if constexpr (supports_sum) {
            _original_prefix_sum.reserve(_n + 1);
            _original_prefix_sum.push_back(Sum{});
            for (const T& value : values) {
                _original_prefix_sum.push_back(
                    _original_prefix_sum.back() + static_cast<Sum>(value)
                );
            }
            for (Node& node : _tree) {
                if (node.values.empty()) continue;
                node.prefix_sum.reserve(node.values.size() + 1);
                node.prefix_sum.push_back(Sum{});
                for (const T& value : node.values) {
                    node.prefix_sum.push_back(
                        node.prefix_sum.back() + static_cast<Sum>(value)
                    );
                }
            }
        }
    }

    int size() const {
        return _n;
    }

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

    const T& get(int position) const {
        assert(0 <= position && position < _n);
        return _values[position];
    }

    const T& operator[](int position) const {
        return get(position);
    }

    int count_less(int left, int right, const T& upper) const {
        assert(0 <= left && left <= right && right <= _n);
        int result = 0;
        visit(left, right, [&](const Node& node) {
            const auto& values = node.values;
            result += int(std::lower_bound(values.begin(), values.end(), upper) - values.begin());
        });
        return result;
    }

    int count_less_equal(int left, int right, const T& upper) const {
        assert(0 <= left && left <= right && right <= _n);
        int result = 0;
        visit(left, right, [&](const Node& node) {
            const auto& values = node.values;
            result += int(std::upper_bound(values.begin(), values.end(), upper) - values.begin());
        });
        return result;
    }

    int count(int left, int right, const T& value) const {
        assert(0 <= left && left <= right && right <= _n);
        int result = 0;
        visit(left, right, [&](const Node& node) {
            const auto& values = node.values;
            auto range = std::equal_range(values.begin(), values.end(), value);
            result += int(range.second - range.first);
        });
        return result;
    }

    int count(int left, int right, const T& lower, const T& upper) const {
        assert(0 <= left && left <= right && right <= _n);
        if (!(lower < upper)) return 0;
        int result = 0;
        visit(left, right, [&](const Node& node) {
            const auto& values = node.values;
            auto first = std::lower_bound(values.begin(), values.end(), lower);
            auto last = std::lower_bound(values.begin(), values.end(), upper);
            result += int(last - first);
        });
        return result;
    }

    Sum range_sum(int left, int right) const requires(supports_sum) {
        assert(0 <= left && left <= right && right <= _n);
        return _original_prefix_sum[right] - _original_prefix_sum[left];
    }

    Sum sum_less(int left, int right, const T& upper) const requires(supports_sum) {
        assert(0 <= left && left <= right && right <= _n);
        Sum result{};
        visit(left, right, [&](const Node& node) {
            auto iterator = std::lower_bound(node.values.begin(), node.values.end(), upper);
            int position = int(iterator - node.values.begin());
            result = result + node.prefix_sum[position];
        });
        return result;
    }

    Sum sum_less_equal(int left, int right, const T& upper) const requires(supports_sum) {
        assert(0 <= left && left <= right && right <= _n);
        Sum result{};
        visit(left, right, [&](const Node& node) {
            auto iterator = std::upper_bound(node.values.begin(), node.values.end(), upper);
            int position = int(iterator - node.values.begin());
            result = result + node.prefix_sum[position];
        });
        return result;
    }

    Sum sum(int left, int right, const T& value) const requires(supports_sum) {
        assert(0 <= left && left <= right && right <= _n);
        Sum result{};
        visit(left, right, [&](const Node& node) {
            auto range = std::equal_range(node.values.begin(), node.values.end(), value);
            int first = int(range.first - node.values.begin());
            int last = int(range.second - node.values.begin());
            result = result + node.prefix_sum[last] - node.prefix_sum[first];
        });
        return result;
    }

    Sum sum(int left, int right, const T& lower, const T& upper) const
        requires(supports_sum) {
        assert(0 <= left && left <= right && right <= _n);
        if (!(lower < upper)) return Sum{};
        Sum result{};
        visit(left, right, [&](const Node& node) {
            auto first_iterator = std::lower_bound(node.values.begin(), node.values.end(), lower);
            auto last_iterator = std::lower_bound(node.values.begin(), node.values.end(), upper);
            int first = int(first_iterator - node.values.begin());
            int last = int(last_iterator - node.values.begin());
            result = result + node.prefix_sum[last] - node.prefix_sum[first];
        });
        return result;
    }

    T kth_smallest(int left, int right, int k) const {
        assert(0 <= left && left <= right && right <= _n);
        assert(0 <= k && k < right - left);
        int low = 0;
        int high = int(_sorted_values.size()) - 1;
        while (low < high) {
            int middle = (low + high) / 2;
            if (count_less_equal(left, right, _sorted_values[middle]) > k) {
                high = middle;
            } else {
                low = middle + 1;
            }
        }
        return _sorted_values[low];
    }

    T kth_largest(int left, int right, int k) const {
        assert(0 <= left && left <= right && right <= _n);
        assert(0 <= k && k < right - left);
        return kth_smallest(left, right, right - left - 1 - k);
    }

    std::optional<T> prev_value(int left, int right, const T& upper) const {
        assert(0 <= left && left <= right && right <= _n);
        std::optional<T> result;
        visit(left, right, [&](const Node& node) {
            const auto& values = node.values;
            auto iterator = std::lower_bound(values.begin(), values.end(), upper);
            if (iterator == values.begin()) return;
            --iterator;
            if (!result || *result < *iterator) result = *iterator;
        });
        return result;
    }

    std::optional<T> next_value(int left, int right, const T& lower) const {
        assert(0 <= left && left <= right && right <= _n);
        std::optional<T> result;
        visit(left, right, [&](const Node& node) {
            const auto& values = node.values;
            auto iterator = std::lower_bound(values.begin(), values.end(), lower);
            if (iterator == values.end()) return;
            if (!result || *iterator < *result) result = *iterator;
        });
        return result;
    }
};

}  // namespace ds
}  // namespace m1une


#line 4 "verify/ds/range_query/merge_sort_tree.test.cpp"

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



#line 5 "utilities/fast_io.hpp"
#include <array>
#include <cerrno>
#include <charconv>
#line 9 "utilities/fast_io.hpp"
#include <cstdio>
#include <cstdlib>
#line 12 "utilities/fast_io.hpp"
#include <cstring>
#line 14 "utilities/fast_io.hpp"
#include <string>
#include <sys/stat.h>
#include <type_traits>
#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 12 "verify/ds/range_query/merge_sort_tree.test.cpp"

namespace {

void test_fixed() {
    m1une::ds::MergeSortTree<int> empty;
    assert(empty.empty());
    assert(empty.size() == 0);
    assert(empty.count(0, 0, 7) == 0);
    assert(empty.count_less(0, 0, 7) == 0);
    assert(empty.range_sum(0, 0) == 0);
    assert(empty.sum_less_equal(0, 0, 7) == 0);
    assert(!empty.prev_value(0, 0, 7));
    assert(!empty.next_value(0, 0, 7));

    std::vector<std::string> words = {"pear", "apple", "pear", "plum"};
    m1une::ds::MergeSortTree<std::string> strings(words);
    assert(strings.count(0, 4, std::string("pear")) == 2);
    assert(strings.count(0, 4, std::string("a"), std::string("q")) == 4);
    assert(strings.kth_smallest(0, 4, 0) == "apple");
    assert(strings.prev_value(0, 4, std::string("pear")).value() == "apple");
    assert(strings.next_value(0, 4, std::string("pebble")).value() == "plum");

    std::vector<int> large = {1'000'000'000, 1'000'000'000, -1'000'000'000};
    m1une::ds::MergeSortTree<int, long long> wide(large);
    assert(wide.range_sum(0, 3) == 1'000'000'000LL);
    assert(wide.sum_less_equal(0, 3, 1'000'000'000) == 1'000'000'000LL);
}

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

    for (int trial = 0; trial < 500; trial++) {
        int size = int(random() % 60);
        std::vector<int> values(size);
        for (int& value : values) value = int(random() % 41) - 20;
        m1une::ds::MergeSortTree<int> tree(values);
        assert(tree.size() == size);
        assert(tree.empty() == values.empty());
        for (int i = 0; i < size; i++) assert(tree[i] == values[i]);

        for (int query = 0; query < 300; query++) {
            int left = int(random() % (size + 1));
            int right = int(random() % (size + 1));
            if (left > right) std::swap(left, right);
            int lower = int(random() % 51) - 25;
            int upper = int(random() % 51) - 25;
            if (lower > upper) std::swap(lower, upper);

            int less = 0;
            int less_equal = 0;
            int equal = 0;
            int between = 0;
            int total_sum = 0;
            int less_sum = 0;
            int less_equal_sum = 0;
            int equal_sum = 0;
            int between_sum = 0;
            std::optional<int> previous;
            std::optional<int> next;
            std::vector<int> sorted;
            for (int i = left; i < right; i++) {
                sorted.push_back(values[i]);
                less += values[i] < lower;
                less_equal += values[i] <= lower;
                equal += values[i] == lower;
                between += lower <= values[i] && values[i] < upper;
                total_sum += values[i];
                if (values[i] < lower) less_sum += values[i];
                if (values[i] <= lower) less_equal_sum += values[i];
                if (values[i] == lower) equal_sum += values[i];
                if (lower <= values[i] && values[i] < upper) between_sum += values[i];
                if (values[i] < lower && (!previous || *previous < values[i])) {
                    previous = values[i];
                }
                if (lower <= values[i] && (!next || values[i] < *next)) {
                    next = values[i];
                }
            }
            std::sort(sorted.begin(), sorted.end());

            assert(tree.count_less(left, right, lower) == less);
            assert(tree.count_less_equal(left, right, lower) == less_equal);
            assert(tree.count(left, right, lower) == equal);
            assert(tree.count(left, right, lower, upper) == between);
            assert(tree.range_sum(left, right) == total_sum);
            assert(tree.sum_less(left, right, lower) == less_sum);
            assert(tree.sum_less_equal(left, right, lower) == less_equal_sum);
            assert(tree.sum(left, right, lower) == equal_sum);
            assert(tree.sum(left, right, lower, upper) == between_sum);
            assert(tree.prev_value(left, right, lower) == previous);
            assert(tree.next_value(left, right, lower) == next);
            if (!sorted.empty()) {
                int k = int(random() % sorted.size());
                assert(tree.kth_smallest(left, right, k) == sorted[k]);
                assert(tree.kth_largest(left, right, k) == sorted[sorted.size() - 1 - k]);
            }
        }
    }
}

}  // namespace

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

    test_fixed();
    test_randomized();
    int n, query_count;
    fast_input >> n >> query_count;
    std::vector<int> values(n);
    for (int& value : values) fast_input >> value;

    m1une::ds::MergeSortTree<int> tree(values);
    while (query_count--) {
        int left, right, value;
        fast_input >> left >> right >> value;
        fast_output << tree.count(left, right, value) << '\n';
    }
}

Back to top page