m1une's library

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

View on GitHub

:heavy_check_mark: verify/string/deque_eertree.test.cpp

Depends on

Code

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

#include "../../string/deque_eertree.hpp"

#include <algorithm>
#include <cassert>
#include <cstdint>
#include <deque>
#include <set>
#include <string>
#include "../../utilities/fast_io.hpp"

namespace {

struct NaiveResult {
    int distinct;
    int longest_prefix;
    int longest_suffix;
};

bool is_palindrome(const std::string& text, int left, int right) {
    while (left < right) {
        right--;
        if (text[left] != text[right]) return false;
        left++;
    }
    return true;
}

NaiveResult solve_naively(const std::deque<char>& sequence) {
    std::string text(sequence.begin(), sequence.end());
    std::set<std::string> distinct;
    int longest_prefix = 0;
    int longest_suffix = 0;
    for (int left = 0; left < int(text.size()); left++) {
        for (int right = left + 1; right <= int(text.size()); right++) {
            if (!is_palindrome(text, left, right)) continue;
            distinct.insert(text.substr(left, right - left));
            if (left == 0) longest_prefix = std::max(longest_prefix, right);
            if (right == int(text.size())) longest_suffix = std::max(longest_suffix, right - left);
        }
    }
    return {int(distinct.size()), longest_prefix, longest_suffix};
}

void check(
    const m1une::string::DequeEertree<4, 'a'>& tree,
    const std::deque<char>& sequence
) {
    NaiveResult expected = solve_naively(sequence);
    assert(tree.size() == expected.distinct);
    assert(tree.text_length() == int(sequence.size()));
    assert(tree.empty() == sequence.empty());
    assert(tree.distinct_palindrome_count() == expected.distinct);
    assert(tree.longest_prefix_length() == expected.longest_prefix);
    assert(tree.longest_suffix_length() == expected.longest_suffix);
}

void test_features() {
    m1une::string::DequeEertree<4, 'a'> tree;
    tree.reserve(32);
    std::deque<char> sequence;
    check(tree, sequence);

    tree.push_back('a');
    sequence.push_back('a');
    tree.push_back('b');
    sequence.push_back('b');
    tree.push_front('b');
    sequence.push_front('b');
    check(tree, sequence);

    tree.pop_back();
    sequence.pop_back();
    check(tree, sequence);
    tree.clear();
    sequence.clear();
    check(tree, sequence);

    m1une::string::DoubleEndedEertree<4, 'a'> built(std::string("abacaba"));
    assert(built.text_length() == 7);
    assert(built.size() == 7);
    assert(built.distinct_palindrome_count() == 7);
    assert(built.longest_prefix_length() == 7);
    assert(built.longest_suffix_length() == 7);
}

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

    for (int trial = 0; trial < 1500; trial++) {
        m1une::string::DequeEertree<4, 'a'> tree;
        tree.reserve(120);
        std::deque<char> sequence;
        for (int operation = 0; operation < 120; operation++) {
            int type = sequence.empty() ? int(random() % 2) : int(random() % 4);
            char symbol = char('a' + random() % 4);
            if (type == 0) {
                tree.push_front(symbol);
                sequence.push_front(symbol);
            } else if (type == 1) {
                tree.push_back(symbol);
                sequence.push_back(symbol);
            } else if (type == 2) {
                tree.pop_front();
                sequence.pop_front();
            } else {
                tree.pop_back();
                sequence.pop_back();
            }
            check(tree, sequence);
        }
    }
}

}  // namespace

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

    test_features();
    test_randomized();

    int query_count;
    fast_input >> query_count;
    m1une::string::DequeEertree<> tree;
    tree.reserve(query_count);
    for (int query = 0; query < query_count; query++) {
        int type;
        fast_input >> type;
        if (type == 0) {
            char symbol;
            fast_input >> symbol;
            tree.push_front(symbol);
        } else if (type == 1) {
            char symbol;
            fast_input >> symbol;
            tree.push_back(symbol);
        } else if (type == 2) {
            tree.pop_front();
        } else {
            assert(type == 3);
            tree.pop_back();
        }
        fast_output << tree.distinct_palindrome_count() << ' '
                    << tree.longest_prefix_length() << ' '
                    << tree.longest_suffix_length() << '\n';
    }
}
#line 1 "verify/string/deque_eertree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/palindromes_in_deque"

#line 1 "string/deque_eertree.hpp"



#include <array>
#include <cassert>
#include <cstddef>
#include <deque>
#include <limits>
#include <vector>

namespace m1une {
namespace string {

template <int AlphabetSize = 26, int FirstCharacter = 'a'>
struct DequeEertree {
    static_assert(0 < AlphabetSize);

    using node_id = int;
    static constexpr node_id odd_root = 0;
    static constexpr node_id even_root = 1;
    static constexpr node_id null_node = -1;

   private:
    struct Node {
        std::array<node_id, AlphabetSize> next;
        node_id parent;
        node_id suffix_link;
        node_id quick_link;
        int length;
        int surface_count;
        int suffix_link_children;
        bool active;

        Node(
            int length_value = 0,
            node_id parent_value = null_node,
            node_id suffix_link_value = null_node,
            node_id quick_link_value = null_node
        )
            : parent(parent_value),
              suffix_link(suffix_link_value),
              quick_link(quick_link_value),
              length(length_value),
              surface_count(0),
              suffix_link_children(0),
              active(true) {
            next.fill(null_node);
        }
    };

    struct Position {
        int symbol;
        node_id prefix_surface;
        node_id suffix_surface;
    };

    std::vector<Node> _nodes;
    std::deque<Position> _text;
    int _distinct_palindromes;

    template <class Symbol>
    static int symbol_index(const Symbol& value) {
        int symbol = int(value) - FirstCharacter;
        assert(0 <= symbol && symbol < AlphabetSize);
        return symbol;
    }

    node_id new_node(node_id parent, node_id suffix_link, int length, int symbol) {
        assert(_nodes.size() < std::size_t(std::numeric_limits<int>::max()));
        node_id id = int(_nodes.size());
        _nodes.emplace_back(length, parent, suffix_link, odd_root);
        _nodes[parent].next[symbol] = id;
        _nodes[suffix_link].suffix_link_children++;
        _distinct_palindromes++;
        return id;
    }

    void remove_node(node_id id, int symbol) {
        Node& removed = _nodes[id];
        assert(removed.active);
        assert(removed.surface_count == 0);
        assert(removed.suffix_link_children == 0);
        assert(_nodes[removed.parent].next[symbol] == id);
        _nodes[removed.parent].next[symbol] = null_node;
        _nodes[removed.suffix_link].suffix_link_children--;
        removed.active = false;
        _distinct_palindromes--;
    }

    node_id back_appendable(int symbol, node_id node) const {
        int n = int(_text.size());
        while (true) {
            int length = _nodes[node].length;
            if (length == -1 || (length < n && _text[n - length - 1].symbol == symbol)) {
                return node;
            }
            node_id suffix = _nodes[node].suffix_link;
            int suffix_length = _nodes[suffix].length;
            if (suffix_length == -1 || _text[n - suffix_length - 1].symbol == symbol) {
                return suffix;
            }
            node = _nodes[node].quick_link;
        }
    }

    node_id front_appendable(int symbol, node_id node) const {
        int n = int(_text.size());
        while (true) {
            int length = _nodes[node].length;
            if (length == -1 || (length < n && _text[length].symbol == symbol)) {
                return node;
            }
            node_id suffix = _nodes[node].suffix_link;
            int suffix_length = _nodes[suffix].length;
            if (suffix_length == -1 || _text[suffix_length].symbol == symbol) {
                return suffix;
            }
            node = _nodes[node].quick_link;
        }
    }

    node_id prefix_node() const {
        return _text.empty() ? even_root : _text.front().prefix_surface;
    }

    node_id suffix_node() const {
        return _text.empty() ? even_root : _text.back().suffix_surface;
    }

    void initialize_roots() {
        _nodes.clear();
        _nodes.emplace_back(-1, odd_root, odd_root, odd_root);
        _nodes.emplace_back(0, odd_root, odd_root, odd_root);
        _distinct_palindromes = 0;
    }

   public:
    DequeEertree() {
        initialize_roots();
    }

    template <class Sequence>
    explicit DequeEertree(const Sequence& sequence) {
        initialize_roots();
        build(sequence);
    }

    int size() const {
        return _distinct_palindromes;
    }

    int text_length() const {
        return int(_text.size());
    }

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

    int distinct_palindrome_count() const {
        return _distinct_palindromes;
    }

    int longest_prefix_length() const {
        return _nodes[prefix_node()].length;
    }

    int longest_suffix_length() const {
        return _nodes[suffix_node()].length;
    }

    void reserve(std::size_t operation_capacity) {
        _nodes.reserve(operation_capacity + 2);
    }

    void clear() {
        _text.clear();
        initialize_roots();
    }

    template <class Symbol>
    void push_back(const Symbol& value) {
        int symbol = symbol_index(value);
        node_id parent = _text.empty() ? odd_root : back_appendable(symbol, suffix_node());
        node_id palindrome = _nodes[parent].next[symbol];
        node_id suffix = even_root;

        if (palindrome == null_node) {
            if (parent != odd_root) {
                node_id suffix_parent = back_appendable(symbol, _nodes[parent].suffix_link);
                suffix = _nodes[suffix_parent].next[symbol];
                assert(suffix != null_node);
            }
        } else {
            suffix = _nodes[palindrome].suffix_link;
        }

        _text.push_back(Position{symbol, even_root, even_root});
        int n = int(_text.size());
        if (palindrome == null_node) {
            palindrome = new_node(parent, suffix, _nodes[parent].length + 2, symbol);

            Node& created = _nodes[palindrome];
            if (
                _nodes[suffix].suffix_link != odd_root &&
                _text[n - _nodes[suffix].length - 1].symbol ==
                    _text[n - _nodes[_nodes[suffix].suffix_link].length - 1].symbol
            ) {
                created.quick_link = _nodes[suffix].quick_link;
            } else {
                created.quick_link = _nodes[suffix].suffix_link;
            }
        }

        int left = n - _nodes[palindrome].length;
        _text.back().suffix_surface = palindrome;
        _text[left].prefix_surface = palindrome;
        if (
            _nodes[suffix].length >= 1 &&
            _text[left + _nodes[suffix].length - 1].suffix_surface == suffix
        ) {
            _text[left + _nodes[suffix].length - 1].suffix_surface = even_root;
        }
        _nodes[palindrome].surface_count++;
    }

    template <class Symbol>
    void push_front(const Symbol& value) {
        int symbol = symbol_index(value);
        node_id parent = _text.empty() ? odd_root : front_appendable(symbol, prefix_node());
        node_id palindrome = _nodes[parent].next[symbol];
        node_id suffix = even_root;

        if (palindrome == null_node) {
            if (parent != odd_root) {
                node_id suffix_parent = front_appendable(symbol, _nodes[parent].suffix_link);
                suffix = _nodes[suffix_parent].next[symbol];
                assert(suffix != null_node);
            }
        } else {
            suffix = _nodes[palindrome].suffix_link;
        }

        _text.push_front(Position{symbol, even_root, even_root});
        if (palindrome == null_node) {
            palindrome = new_node(parent, suffix, _nodes[parent].length + 2, symbol);

            Node& created = _nodes[palindrome];
            if (
                _nodes[suffix].suffix_link != odd_root &&
                _text[_nodes[suffix].length].symbol ==
                    _text[_nodes[_nodes[suffix].suffix_link].length].symbol
            ) {
                created.quick_link = _nodes[suffix].quick_link;
            } else {
                created.quick_link = _nodes[suffix].suffix_link;
            }
        }

        _text.front().prefix_surface = palindrome;
        _text[_nodes[palindrome].length - 1].suffix_surface = palindrome;
        if (
            _nodes[suffix].length >= 1 &&
            _text[_nodes[palindrome].length - _nodes[suffix].length].prefix_surface == suffix
        ) {
            _text[_nodes[palindrome].length - _nodes[suffix].length].prefix_surface = even_root;
        }
        _nodes[palindrome].surface_count++;
    }

    void pop_back() {
        assert(!_text.empty());
        node_id palindrome = suffix_node();
        node_id suffix = _nodes[palindrome].suffix_link;
        int left = text_length() - _nodes[palindrome].length;
        int suffix_end = left + _nodes[suffix].length - 1;

        if (
            _nodes[palindrome].length >= 2 &&
            _nodes[_text[suffix_end].suffix_surface].length < _nodes[suffix].length
        ) {
            _text[suffix_end].suffix_surface = suffix;
            _text[left].prefix_surface = suffix;
        } else {
            _text[left].prefix_surface = even_root;
        }

        _nodes[palindrome].surface_count--;
        int symbol = _text.back().symbol;
        if (
            _nodes[palindrome].surface_count == 0 &&
            _nodes[palindrome].suffix_link_children == 0
        ) {
            remove_node(palindrome, symbol);
        }
        _text.pop_back();
    }

    void pop_front() {
        assert(!_text.empty());
        node_id palindrome = prefix_node();
        node_id suffix = _nodes[palindrome].suffix_link;
        int suffix_start = _nodes[palindrome].length - _nodes[suffix].length;

        if (
            _nodes[palindrome].length >= 2 &&
            _nodes[_text[suffix_start].prefix_surface].length < _nodes[suffix].length
        ) {
            _text[suffix_start].prefix_surface = suffix;
            _text[_nodes[palindrome].length - 1].suffix_surface = suffix;
        } else {
            _text[_nodes[palindrome].length - 1].suffix_surface = even_root;
        }

        _nodes[palindrome].surface_count--;
        int symbol = _text.front().symbol;
        if (
            _nodes[palindrome].surface_count == 0 &&
            _nodes[palindrome].suffix_link_children == 0
        ) {
            remove_node(palindrome, symbol);
        }
        _text.pop_front();
    }

    template <class Sequence>
    void build(const Sequence& sequence) {
        for (const auto& symbol : sequence) push_back(symbol);
    }
};

template <int AlphabetSize = 26, int FirstCharacter = 'a'>
using DoubleEndedEertree = DequeEertree<AlphabetSize, FirstCharacter>;

template <int AlphabetSize = 26, int FirstCharacter = 'a'>
using DequePalindromicTree = DequeEertree<AlphabetSize, FirstCharacter>;

}  // namespace string
}  // namespace m1une


#line 4 "verify/string/deque_eertree.test.cpp"

#include <algorithm>
#line 7 "verify/string/deque_eertree.test.cpp"
#include <cstdint>
#line 9 "verify/string/deque_eertree.test.cpp"
#include <set>
#include <string>
#line 1 "utilities/fast_io.hpp"



#line 6 "utilities/fast_io.hpp"
#include <cerrno>
#include <charconv>
#line 9 "utilities/fast_io.hpp"
#include <cstdio>
#include <cstdlib>
#line 12 "utilities/fast_io.hpp"
#include <cstring>
#include <iterator>
#line 15 "utilities/fast_io.hpp"
#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 12 "verify/string/deque_eertree.test.cpp"

namespace {

struct NaiveResult {
    int distinct;
    int longest_prefix;
    int longest_suffix;
};

bool is_palindrome(const std::string& text, int left, int right) {
    while (left < right) {
        right--;
        if (text[left] != text[right]) return false;
        left++;
    }
    return true;
}

NaiveResult solve_naively(const std::deque<char>& sequence) {
    std::string text(sequence.begin(), sequence.end());
    std::set<std::string> distinct;
    int longest_prefix = 0;
    int longest_suffix = 0;
    for (int left = 0; left < int(text.size()); left++) {
        for (int right = left + 1; right <= int(text.size()); right++) {
            if (!is_palindrome(text, left, right)) continue;
            distinct.insert(text.substr(left, right - left));
            if (left == 0) longest_prefix = std::max(longest_prefix, right);
            if (right == int(text.size())) longest_suffix = std::max(longest_suffix, right - left);
        }
    }
    return {int(distinct.size()), longest_prefix, longest_suffix};
}

void check(
    const m1une::string::DequeEertree<4, 'a'>& tree,
    const std::deque<char>& sequence
) {
    NaiveResult expected = solve_naively(sequence);
    assert(tree.size() == expected.distinct);
    assert(tree.text_length() == int(sequence.size()));
    assert(tree.empty() == sequence.empty());
    assert(tree.distinct_palindrome_count() == expected.distinct);
    assert(tree.longest_prefix_length() == expected.longest_prefix);
    assert(tree.longest_suffix_length() == expected.longest_suffix);
}

void test_features() {
    m1une::string::DequeEertree<4, 'a'> tree;
    tree.reserve(32);
    std::deque<char> sequence;
    check(tree, sequence);

    tree.push_back('a');
    sequence.push_back('a');
    tree.push_back('b');
    sequence.push_back('b');
    tree.push_front('b');
    sequence.push_front('b');
    check(tree, sequence);

    tree.pop_back();
    sequence.pop_back();
    check(tree, sequence);
    tree.clear();
    sequence.clear();
    check(tree, sequence);

    m1une::string::DoubleEndedEertree<4, 'a'> built(std::string("abacaba"));
    assert(built.text_length() == 7);
    assert(built.size() == 7);
    assert(built.distinct_palindrome_count() == 7);
    assert(built.longest_prefix_length() == 7);
    assert(built.longest_suffix_length() == 7);
}

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

    for (int trial = 0; trial < 1500; trial++) {
        m1une::string::DequeEertree<4, 'a'> tree;
        tree.reserve(120);
        std::deque<char> sequence;
        for (int operation = 0; operation < 120; operation++) {
            int type = sequence.empty() ? int(random() % 2) : int(random() % 4);
            char symbol = char('a' + random() % 4);
            if (type == 0) {
                tree.push_front(symbol);
                sequence.push_front(symbol);
            } else if (type == 1) {
                tree.push_back(symbol);
                sequence.push_back(symbol);
            } else if (type == 2) {
                tree.pop_front();
                sequence.pop_front();
            } else {
                tree.pop_back();
                sequence.pop_back();
            }
            check(tree, sequence);
        }
    }
}

}  // namespace

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

    test_features();
    test_randomized();

    int query_count;
    fast_input >> query_count;
    m1une::string::DequeEertree<> tree;
    tree.reserve(query_count);
    for (int query = 0; query < query_count; query++) {
        int type;
        fast_input >> type;
        if (type == 0) {
            char symbol;
            fast_input >> symbol;
            tree.push_front(symbol);
        } else if (type == 1) {
            char symbol;
            fast_input >> symbol;
            tree.push_back(symbol);
        } else if (type == 2) {
            tree.pop_front();
        } else {
            assert(type == 3);
            tree.pop_back();
        }
        fast_output << tree.distinct_palindrome_count() << ' '
                    << tree.longest_prefix_length() << ' '
                    << tree.longest_suffix_length() << '\n';
    }
}
Back to top page