verify/convex/li_chao_tree.test.cpp

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

Depends on

• Convex Hull Trick (convex/convex_hull_trick.hpp)
• Li Chao Tree (convex/li_chao_tree.hpp)
• Fast IO (utilities/fast_io.hpp)

Code

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

#include "../../convex/li_chao_tree.hpp"

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

namespace {

struct SegmentLine {
    int left;
    int right;
    long long slope;
    long long intercept;
};

template <m1une::convex::LineOptimization Objective>
void check(const std::vector<SegmentLine>& lines) {
    m1une::convex::LiChaoTree<long long, Objective> tree(-64, 65);
    for (const SegmentLine& line : lines) {
        if (line.left == -64 && line.right == 65) {
            tree.add_line(line.slope, line.intercept);
        } else {
            tree.add_segment(
                line.left,
                line.right,
                line.slope,
                line.intercept
            );
        }
    }

    for (long long x = -64; x < 65; ++x) {
        std::optional<__int128_t> expected;
        for (const SegmentLine& line : lines) {
            if (x < line.left || line.right <= x) continue;
            __int128_t value =
                __int128_t(line.slope) * x + line.intercept;
            if (
                !expected
                || (
                    Objective
                        == m1une::convex::LineOptimization::Minimize
                    ? value < *expected
                    : *expected < value
                )
            ) {
                expected = value;
            }
        }
        assert(tree.query(x) == expected);
        if (expected) assert(tree.get(x) == *expected);
    }
}

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

    for (int trial = 0; trial < 3000; ++trial) {
        int count = int(random() % 50);
        std::vector<SegmentLine> lines;
        for (int index = 0; index < count; ++index) {
            int left = int(random() % 129) - 64;
            int right = int(random() % 129) - 64;
            if (right < left) std::swap(left, right);
            if (random() % 3 == 0) {
                left = -64;
                right = 65;
            }
            lines.push_back(SegmentLine{
                left,
                right,
                static_cast<long long>(random() % 101) - 50,
                static_cast<long long>(random() % 201) - 100,
            });
        }
        check<m1une::convex::LineOptimization::Minimize>(lines);
        check<m1une::convex::LineOptimization::Maximize>(lines);
    }
}

}  // namespace

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

    test_randomized();

    int line_count, query_count;
    fast_input >> line_count >> query_count;
    constexpr long long left = -1'000'000'000LL;
    constexpr long long right = 1'000'000'001LL;
    m1une::convex::MinLiChaoTree<long long> tree(left, right);
    for (int index = 0; index < line_count; ++index) {
        long long slope, intercept;
        fast_input >> slope >> intercept;
        tree.add_line(slope, intercept);
    }

    while (query_count--) {
        int type;
        fast_input >> type;
        if (type == 0) {
            long long slope, intercept;
            fast_input >> slope >> intercept;
            tree.add_line(slope, intercept);
        } else {
            long long x;
            fast_input >> x;
            fast_output << static_cast<long long>(tree.get(x)) << '\n';
        }
    }
}

#line 1 "verify/convex/li_chao_tree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/line_add_get_min"

#line 1 "convex/li_chao_tree.hpp"



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

#line 1 "convex/convex_hull_trick.hpp"



#line 10 "convex/convex_hull_trick.hpp"

namespace m1une {
namespace convex {

enum class LineOptimization {
    Minimize,
    Maximize,
};

template <std::signed_integral T>
using line_wide_type = __int128_t;

template <std::signed_integral T>
struct LinearFunction {
    using value_type = line_wide_type<T>;

    value_type slope;
    value_type intercept;

    constexpr LinearFunction() : slope(0), intercept(0) {}

    constexpr LinearFunction(T slope_value, T intercept_value) : slope(slope_value), intercept(intercept_value) {}

    constexpr value_type operator()(T x) const {
        return slope * value_type(x) + intercept;
    }
};

// Convex hull trick for lines inserted in nondecreasing slope order.
template <std::signed_integral T, LineOptimization Objective = LineOptimization::Minimize>
struct ConvexHullTrick {
    using Line = LinearFunction<T>;
    using value_type = typename Line::value_type;

   private:
    std::vector<Line> _lines;

    static bool better(value_type first, value_type second) {
        if constexpr (Objective == LineOptimization::Minimize) {
            return first < second;
        } else {
            return second < first;
        }
    }

    static bool redundant(const Line& first, const Line& middle, const Line& last) {
        value_type left = (first.intercept - middle.intercept) * (last.slope - middle.slope);
        value_type right = (middle.intercept - last.intercept) * (middle.slope - first.slope);
        if constexpr (Objective == LineOptimization::Minimize) {
            return left <= right;
        } else {
            return right <= left;
        }
    }

   public:
    ConvexHullTrick() = default;

    int size() const {
        return int(_lines.size());
    }

    bool empty() const {
        return _lines.empty();
    }

    const std::vector<Line>& lines() const {
        return _lines;
    }

    void reserve(std::size_t line_capacity) {
        _lines.reserve(line_capacity);
    }

    void clear() {
        _lines.clear();
    }

    // Slopes must be inserted in nondecreasing order.
    void add_line(T slope, T intercept) {
        Line line(slope, intercept);
        if (!_lines.empty()) {
            assert(_lines.back().slope <= line.slope);
        }

        if (!_lines.empty() && _lines.back().slope == line.slope) {
            if (!better(line.intercept, _lines.back().intercept)) return;
            _lines.pop_back();
        }

        while (_lines.size() >= 2 && redundant(_lines[_lines.size() - 2], _lines.back(), line)) {
            _lines.pop_back();
        }
        _lines.push_back(line);
    }

    std::optional<value_type> try_query(T x) const {
        if (_lines.empty()) return std::nullopt;
        int low = 0;
        int high = int(_lines.size()) - 1;
        while (low < high) {
            int middle = low + (high - low) / 2;
            value_type first = _lines[middle](x);
            value_type second = _lines[middle + 1](x);
            if (better(first, second) || first == second) {
                high = middle;
            } else {
                low = middle + 1;
            }
        }
        return _lines[low](x);
    }

    value_type query(T x) const {
        assert(!empty());
        return *try_query(x);
    }
};

template <std::signed_integral T>
using MinConvexHullTrick = ConvexHullTrick<T, LineOptimization::Minimize>;

template <std::signed_integral T>
using MaxConvexHullTrick = ConvexHullTrick<T, LineOptimization::Maximize>;

}  // namespace convex
}  // namespace m1une


#line 15 "convex/li_chao_tree.hpp"

namespace m1une {
namespace convex {

// Dynamic Li Chao tree over an integral half-open coordinate domain.
template <std::signed_integral T, LineOptimization Objective = LineOptimization::Minimize>
struct LiChaoTree {
    using Line = LinearFunction<T>;
    using value_type = typename Line::value_type;

   private:
    struct Node {
        Line line;
        bool has_line;
        int left;
        int right;

        Node() : has_line(false), left(-1), right(-1) {}

        explicit Node(Line value) : line(std::move(value)), has_line(true), left(-1), right(-1) {}
    };

    T _left;
    T _right;
    int _root;
    std::vector<Node> _nodes;

    static bool better(value_type first, value_type second) {
        if constexpr (Objective == LineOptimization::Minimize) {
            return first < second;
        } else {
            return second < first;
        }
    }

    int new_node() {
        assert(_nodes.size() < std::size_t(std::numeric_limits<int>::max()));
        _nodes.emplace_back();
        return int(_nodes.size()) - 1;
    }

    int new_node(Line line) {
        assert(_nodes.size() < std::size_t(std::numeric_limits<int>::max()));
        _nodes.emplace_back(std::move(line));
        return int(_nodes.size()) - 1;
    }

    int add_line_node(int node, T left, T right, Line line) {
        if (node == -1) return new_node(std::move(line));
        if (!_nodes[node].has_line) {
            _nodes[node].line = std::move(line);
            _nodes[node].has_line = true;
            return node;
        }

        T middle = std::midpoint(left, right);
        bool left_better = better(line(left), _nodes[node].line(left));
        bool middle_better = better(line(middle), _nodes[node].line(middle));
        if (middle_better) std::swap(line, _nodes[node].line);
        if (middle == left) return node;

        if (left_better != middle_better) {
            int child = add_line_node(_nodes[node].left, left, middle, std::move(line));
            _nodes[node].left = child;
        } else {
            int child = add_line_node(_nodes[node].right, middle, right, std::move(line));
            _nodes[node].right = child;
        }
        return node;
    }

    int add_segment_node(int node, T left, T right, T query_left, T query_right, const Line& line) {
        if (query_right <= left || right <= query_left) return node;
        if (query_left <= left && right <= query_right) {
            return add_line_node(node, left, right, line);
        }
        if (node == -1) node = new_node();

        T middle = std::midpoint(left, right);
        if (middle == left) return add_line_node(node, left, right, line);
        int left_child = add_segment_node(_nodes[node].left, left, middle, query_left, query_right, line);
        int right_child = add_segment_node(_nodes[node].right, middle, right, query_left, query_right, line);
        _nodes[node].left = left_child;
        _nodes[node].right = right_child;
        return node;
    }

   public:
    LiChaoTree() : _left(0), _right(0), _root(-1) {}

    LiChaoTree(T left, T right) : _left(left), _right(right), _root(-1) {
        assert(left <= right);
    }

    T left_bound() const {
        return _left;
    }

    T right_bound() const {
        return _right;
    }

    bool empty() const {
        return _root == -1;
    }

    std::size_t node_count() const {
        return _nodes.size();
    }

    void reserve(std::size_t node_capacity) {
        _nodes.reserve(node_capacity);
    }

    void clear() {
        _root = -1;
        _nodes.clear();
    }

    void add_line(T slope, T intercept) {
        assert(_left < _right);
        _root = add_line_node(_root, _left, _right, Line(slope, intercept));
    }

    void add_segment(T segment_left, T segment_right, T slope, T intercept) {
        assert(_left <= segment_left && segment_left <= segment_right && segment_right <= _right);
        if (segment_left == segment_right) return;
        _root = add_segment_node(_root, _left, _right, segment_left, segment_right, Line(slope, intercept));
    }

    // Returns nullopt when no inserted line covers x.
    std::optional<value_type> query(T x) const {
        assert(_left <= x && x < _right);
        std::optional<value_type> result;
        int node = _root;
        T left = _left;
        T right = _right;
        while (node != -1) {
            if (_nodes[node].has_line) {
                value_type candidate = _nodes[node].line(x);
                if (!result || better(candidate, *result)) {
                    result = candidate;
                }
            }

            T middle = std::midpoint(left, right);
            if (middle == left) break;
            if (x < middle) {
                node = _nodes[node].left;
                right = middle;
            } else {
                node = _nodes[node].right;
                left = middle;
            }
        }
        return result;
    }

    value_type get(T x) const {
        std::optional<value_type> result = query(x);
        assert(result.has_value());
        return result.value_or(value_type());
    }
};

template <std::signed_integral T>
using MinLiChaoTree = LiChaoTree<T, LineOptimization::Minimize>;

template <std::signed_integral T>
using MaxLiChaoTree = LiChaoTree<T, LineOptimization::Maximize>;

}  // namespace convex
}  // namespace m1une


#line 4 "verify/convex/li_chao_tree.test.cpp"

#include <algorithm>
#line 7 "verify/convex/li_chao_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>
#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 12 "verify/convex/li_chao_tree.test.cpp"

namespace {

struct SegmentLine {
    int left;
    int right;
    long long slope;
    long long intercept;
};

template <m1une::convex::LineOptimization Objective>
void check(const std::vector<SegmentLine>& lines) {
    m1une::convex::LiChaoTree<long long, Objective> tree(-64, 65);
    for (const SegmentLine& line : lines) {
        if (line.left == -64 && line.right == 65) {
            tree.add_line(line.slope, line.intercept);
        } else {
            tree.add_segment(
                line.left,
                line.right,
                line.slope,
                line.intercept
            );
        }
    }

    for (long long x = -64; x < 65; ++x) {
        std::optional<__int128_t> expected;
        for (const SegmentLine& line : lines) {
            if (x < line.left || line.right <= x) continue;
            __int128_t value =
                __int128_t(line.slope) * x + line.intercept;
            if (
                !expected
                || (
                    Objective
                        == m1une::convex::LineOptimization::Minimize
                    ? value < *expected
                    : *expected < value
                )
            ) {
                expected = value;
            }
        }
        assert(tree.query(x) == expected);
        if (expected) assert(tree.get(x) == *expected);
    }
}

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

    for (int trial = 0; trial < 3000; ++trial) {
        int count = int(random() % 50);
        std::vector<SegmentLine> lines;
        for (int index = 0; index < count; ++index) {
            int left = int(random() % 129) - 64;
            int right = int(random() % 129) - 64;
            if (right < left) std::swap(left, right);
            if (random() % 3 == 0) {
                left = -64;
                right = 65;
            }
            lines.push_back(SegmentLine{
                left,
                right,
                static_cast<long long>(random() % 101) - 50,
                static_cast<long long>(random() % 201) - 100,
            });
        }
        check<m1une::convex::LineOptimization::Minimize>(lines);
        check<m1une::convex::LineOptimization::Maximize>(lines);
    }
}

}  // namespace

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

    test_randomized();

    int line_count, query_count;
    fast_input >> line_count >> query_count;
    constexpr long long left = -1'000'000'000LL;
    constexpr long long right = 1'000'000'001LL;
    m1une::convex::MinLiChaoTree<long long> tree(left, right);
    for (int index = 0; index < line_count; ++index) {
        long long slope, intercept;
        fast_input >> slope >> intercept;
        tree.add_line(slope, intercept);
    }

    while (query_count--) {
        int type;
        fast_input >> type;
        if (type == 0) {
            long long slope, intercept;
            fast_input >> slope >> intercept;
            tree.add_line(slope, intercept);
        } else {
            long long x;
            fast_input >> x;
            fast_output << static_cast<long long>(tree.get(x)) << '\n';
        }
    }
}

Back to top page