m1une's library

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

View on GitHub

:heavy_check_mark: verify/ds/queue/persistent_queue.test.cpp

Depends on

Code

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

#include "../../../ds/queue/persistent_queue.hpp"
#include "../../../utilities/fast_io.hpp"

#include <cassert>
#include <cstdint>
#include <deque>
#include <memory>
#include <utility>
#include <vector>

namespace {

void test_randomized() {
    using Queue = m1une::ds::PersistentQueue<int>;

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

    std::vector<std::pair<Queue, std::deque<int>>> versions;
    versions.emplace_back();
    for (int step = 0; step < 5000; step++) {
        int version = int(random() % versions.size());
        const Queue& current = versions[version].first;
        const std::deque<int>& expected = versions[version].second;
        assert(current.size() == int(expected.size()));
        assert(current.empty() == expected.empty());
        if (!expected.empty()) {
            assert(current.front() == expected.front());
            assert(current.back() == expected.back());
        }

        Queue next = current;
        std::deque<int> next_expected = expected;
        if (expected.empty() || random() % 3 != 0) {
            int value = int(random() % 1000000);
            next = current.push(value);
            next_expected.push_back(value);
        } else {
            next = current.pop();
            next_expected.pop_front();
        }
        assert(current.size() == int(expected.size()));
        if (!expected.empty()) assert(current.front() == expected.front());
        assert(next.size() == int(next_expected.size()));
        if (!next_expected.empty()) {
            assert(next.front() == next_expected.front());
            assert(next.back() == next_expected.back());
        }
        versions.emplace_back(std::move(next), std::move(next_expected));
    }

    Queue stable = Queue().push(1);
    const int& reference = stable.front();
    Queue growing = stable;
    for (int value = 2; value <= 1000; value++) {
        growing = growing.push_back(value);
    }
    assert(reference == 1);
    assert(growing.back() == 1000);
    assert(growing.clear().empty());

    m1une::ds::PersistentQueue<std::unique_ptr<int>> move_only;
    auto first = move_only.push(std::make_unique<int>(4));
    auto second = first.push(std::make_unique<int>(9));
    assert(*first.front() == 4);
    assert(*second.front() == 4);
    assert(*second.back() == 9);
    assert(*second.pop_front().front() == 9);
}

}  // namespace

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

    test_randomized();

    int query_count = 0;
    fast_input >> query_count;
    using Queue = m1une::ds::PersistentQueue<int>;
    Queue empty;
    std::vector<Queue> versions(query_count + 1, empty);
    for (int query = 0; query < query_count; query++) {
        int type = 0, base = 0;
        fast_input >> type >> base;
        const auto& source = versions[base + 1];
        if (type == 0) {
            int value = 0;
            fast_input >> value;
            versions[query + 1] = source.push(value);
        } else {
            fast_output << source.front() << '\n';
            versions[query + 1] = source.pop();
        }
    }
}
#line 1 "verify/ds/queue/persistent_queue.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/persistent_queue"

#line 1 "ds/queue/persistent_queue.hpp"



#include <cassert>
#include <cstddef>
#include <deque>
#include <memory>
#include <optional>
#include <utility>
#include <vector>

namespace m1une {
namespace ds {

// Purely persistent FIFO queue with worst-case O(1) operations.
template <class T>
struct PersistentQueue {
   private:
    struct Link {
        int value_index;
        int next;

        Link(int index, int next_link) : value_index(index), next(next_link) {}
    };

    struct Pool {
        std::deque<std::optional<T>> values;
        std::deque<std::optional<Link>> links;
        std::vector<int> value_references, link_references;
        std::vector<int> next_free_value, next_free_link;
        std::vector<int> unowned_values, unowned_links;
        int first_free_value = -1;
        int first_free_link = -1;
        std::size_t live_values = 0;
        std::size_t live_links = 0;

        void retain_value(int value) {
            if (value != -1) ++value_references[value];
        }

        void release_value(int value) {
            if (value == -1) return;
            assert(values[value].has_value() && value_references[value] > 0);
            if (--value_references[value] != 0) return;
            values[value].reset();
            next_free_value[value] = first_free_value;
            first_free_value = value;
            --live_values;
        }

        void retain_link(int link) {
            if (link != -1) ++link_references[link];
        }

        void release_zero_link(int link) {
            while (link != -1) {
                assert(links[link].has_value() && link_references[link] == 0);
                int value = links[link]->value_index;
                int next = links[link]->next;
                links[link].reset();
                next_free_link[link] = first_free_link;
                first_free_link = link;
                --live_links;
                release_value(value);
                if (next == -1 || --link_references[next] != 0) return;
                link = next;
            }
        }

        void release_link(int link) {
            if (link == -1) return;
            assert(links[link].has_value() && link_references[link] > 0);
            if (--link_references[link] == 0) release_zero_link(link);
        }

        int store_value(T value) {
            int result;
            if (first_free_value == -1) {
                result = int(values.size());
                values.emplace_back(std::in_place, std::move(value));
                value_references.push_back(0);
                next_free_value.push_back(-1);
            } else {
                result = first_free_value;
                first_free_value = next_free_value[result];
                values[result].emplace(std::move(value));
                value_references[result] = 0;
            }
            unowned_values.push_back(result);
            ++live_values;
            return result;
        }

        int make_link(int value, int next) {
            int result;
            if (first_free_link == -1) {
                result = int(links.size());
                links.emplace_back(std::in_place, value, next);
                link_references.push_back(0);
                next_free_link.push_back(-1);
            } else {
                result = first_free_link;
                first_free_link = next_free_link[result];
                links[result].emplace(value, next);
                link_references[result] = 0;
            }
            retain_value(value);
            retain_link(next);
            unowned_links.push_back(result);
            ++live_links;
            return result;
        }

        void discard_unreferenced() {
            while (!unowned_links.empty()) {
                int link = unowned_links.back();
                unowned_links.pop_back();
                if (links[link].has_value() && link_references[link] == 0) release_zero_link(link);
            }
            while (!unowned_values.empty()) {
                int value = unowned_values.back();
                unowned_values.pop_back();
                if (values[value].has_value() && value_references[value] == 0) {
                    values[value].reset();
                    next_free_value[value] = first_free_value;
                    first_free_value = value;
                    --live_values;
                }
            }
        }

        std::size_t size() const { return live_values + live_links; }
    };

    enum class RotationPhase {
        idle,
        reversing,
        appending,
        done,
    };

    struct RotationState {
        RotationPhase phase = RotationPhase::idle;
        int valid_count = 0;
        int remaining_front = -1;
        int reversed_front = -1;
        int remaining_rear = -1;
        int reversed_rear = -1;
    };

    int _front_size;
    int _front;
    RotationState _rotation;
    int _rear_size;
    int _rear;
    int _back_value;
    std::shared_ptr<Pool> _pool;

    PersistentQueue(
        int front_size,
        int front,
        RotationState rotation,
        int rear_size,
        int rear,
        int back_value,
        std::shared_ptr<Pool> pool
    )
        : _front_size(front_size),
          _front(front),
          _rotation(rotation),
          _rear_size(rear_size),
          _rear(rear),
          _back_value(back_value),
          _pool(std::move(pool)) {
        retain_state();
        _pool->discard_unreferenced();
    }

    void retain_state() const {
        _pool->retain_link(_front);
        _pool->retain_link(_rotation.remaining_front);
        _pool->retain_link(_rotation.reversed_front);
        _pool->retain_link(_rotation.remaining_rear);
        _pool->retain_link(_rotation.reversed_rear);
        _pool->retain_link(_rear);
        _pool->retain_value(_back_value);
    }

    void release_state() const {
        _pool->release_link(_front);
        _pool->release_link(_rotation.remaining_front);
        _pool->release_link(_rotation.reversed_front);
        _pool->release_link(_rotation.remaining_rear);
        _pool->release_link(_rotation.reversed_rear);
        _pool->release_link(_rear);
        _pool->release_value(_back_value);
    }

    int next_link(int link) const {
        assert(link != -1);
        return (*_pool->links[link]).next;
    }

    int link_value(int link) const {
        assert(link != -1);
        return (*_pool->links[link]).value_index;
    }

    int make_link(int value_index, int next) const {
        return _pool->make_link(value_index, next);
    }

    int store_value(T value) const {
        return _pool->store_value(std::move(value));
    }

    RotationState execute(RotationState state) const {
        if (state.phase == RotationPhase::reversing) {
            assert(state.remaining_rear != -1);
            if (state.remaining_front != -1) {
                state.reversed_front = make_link(
                    link_value(state.remaining_front),
                    state.reversed_front
                );
                state.remaining_front = next_link(state.remaining_front);
                state.reversed_rear = make_link(
                    link_value(state.remaining_rear),
                    state.reversed_rear
                );
                state.remaining_rear = next_link(state.remaining_rear);
                state.valid_count++;
            } else {
                assert(next_link(state.remaining_rear) == -1);
                state.reversed_rear = make_link(
                    link_value(state.remaining_rear),
                    state.reversed_rear
                );
                state.remaining_rear = -1;
                state.phase = RotationPhase::appending;
            }
        } else if (state.phase == RotationPhase::appending) {
            assert(state.valid_count >= 0);
            if (state.valid_count == 0) {
                state.phase = RotationPhase::done;
            } else {
                assert(state.reversed_front != -1);
                state.reversed_rear = make_link(
                    link_value(state.reversed_front),
                    state.reversed_rear
                );
                state.reversed_front = next_link(state.reversed_front);
                state.valid_count--;
            }
        }
        return state;
    }

    RotationState invalidate(RotationState state) const {
        if (state.phase == RotationPhase::reversing) {
            state.valid_count--;
        } else if (state.phase == RotationPhase::appending) {
            if (state.valid_count == 0) {
                assert(state.reversed_rear != -1);
                state.reversed_rear = next_link(state.reversed_rear);
                state.phase = RotationPhase::done;
            } else {
                state.valid_count--;
            }
        }
        return state;
    }

    PersistentQueue execute_twice(
        int front_size,
        int front,
        RotationState rotation,
        int rear_size,
        int rear,
        int back_value
    ) const {
        rotation = execute(std::move(rotation));
        rotation = execute(std::move(rotation));
        if (rotation.phase == RotationPhase::done) {
            front = rotation.reversed_rear;
            rotation = RotationState();
        }
        return PersistentQueue(
            front_size,
            front,
            rotation,
            rear_size,
            rear,
            back_value,
            _pool
        );
    }

    PersistentQueue check(
        int front_size,
        int front,
        RotationState rotation,
        int rear_size,
        int rear,
        int back_value
    ) const {
        if (rear_size <= front_size) {
            return execute_twice(
                front_size,
                front,
                rotation,
                rear_size,
                rear,
                back_value
            );
        }

        RotationState next_rotation;
        next_rotation.phase = RotationPhase::reversing;
        next_rotation.remaining_front = front;
        next_rotation.remaining_rear = rear;
        return execute_twice(
            front_size + rear_size,
            front,
            next_rotation,
            0,
            -1,
            back_value
        );
    }

   public:
    PersistentQueue()
        : _front_size(0),
          _front(-1),
          _rear_size(0),
          _rear(-1),
          _back_value(-1),
          _pool(std::make_shared<Pool>()) {}

    PersistentQueue(const PersistentQueue& other)
        : _front_size(other._front_size),
          _front(other._front),
          _rotation(other._rotation),
          _rear_size(other._rear_size),
          _rear(other._rear),
          _back_value(other._back_value),
          _pool(other._pool) {
        if (_pool) retain_state();
    }

    PersistentQueue(PersistentQueue&& other) noexcept
        : _front_size(other._front_size),
          _front(other._front),
          _rotation(other._rotation),
          _rear_size(other._rear_size),
          _rear(other._rear),
          _back_value(other._back_value),
          _pool(std::move(other._pool)) {
        other._front_size = other._rear_size = 0;
        other._front = other._rear = other._back_value = -1;
        other._rotation = RotationState();
    }

    PersistentQueue& operator=(const PersistentQueue& other) {
        if (this == &other) return *this;
        if (other._pool) other.retain_state();
        if (_pool) release_state();
        _front_size = other._front_size;
        _front = other._front;
        _rotation = other._rotation;
        _rear_size = other._rear_size;
        _rear = other._rear;
        _back_value = other._back_value;
        _pool = other._pool;
        return *this;
    }

    PersistentQueue& operator=(PersistentQueue&& other) noexcept {
        if (this == &other) return *this;
        if (_pool) release_state();
        _front_size = other._front_size;
        _front = other._front;
        _rotation = other._rotation;
        _rear_size = other._rear_size;
        _rear = other._rear;
        _back_value = other._back_value;
        _pool = std::move(other._pool);
        other._front_size = other._rear_size = 0;
        other._front = other._rear = other._back_value = -1;
        other._rotation = RotationState();
        return *this;
    }

    ~PersistentQueue() {
        if (_pool) release_state();
    }

    int size() const {
        return _front_size + _rear_size;
    }

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

    void release() {
        if (_pool) release_state();
        _front_size = _rear_size = 0;
        _front = _rear = _back_value = -1;
        _rotation = RotationState();
        _pool = std::make_shared<Pool>();
    }

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

    const T& front() const {
        assert(!empty() && _front != -1);
        return *_pool->values[link_value(_front)];
    }

    const T& back() const {
        assert(!empty() && _back_value != -1);
        return *_pool->values[_back_value];
    }

    PersistentQueue push(T value) const {
        int value_index = store_value(std::move(value));
        int rear = make_link(value_index, _rear);
        return check(
            _front_size,
            _front,
            _rotation,
            _rear_size + 1,
            rear,
            value_index
        );
    }

    PersistentQueue push_back(T value) const {
        return push(std::move(value));
    }

    PersistentQueue pop() const {
        assert(!empty() && _front != -1);
        int back_value = size() == 1 ? -1 : _back_value;
        return check(
            _front_size - 1,
            next_link(_front),
            invalidate(_rotation),
            _rear_size,
            _rear,
            back_value
        );
    }

    PersistentQueue pop_front() const {
        return pop();
    }

    PersistentQueue clear() const {
        return PersistentQueue(
            0,
            -1,
            RotationState(),
            0,
            -1,
            -1,
            _pool
        );
    }
};

}  // namespace ds
}  // namespace m1une


#line 1 "utilities/fast_io.hpp"



#include <algorithm>
#include <array>
#include <cerrno>
#include <charconv>
#line 9 "utilities/fast_io.hpp"
#include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>
#include <iterator>
#include <string>
#include <sys/stat.h>
#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 5 "verify/ds/queue/persistent_queue.test.cpp"

#line 12 "verify/ds/queue/persistent_queue.test.cpp"

namespace {

void test_randomized() {
    using Queue = m1une::ds::PersistentQueue<int>;

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

    std::vector<std::pair<Queue, std::deque<int>>> versions;
    versions.emplace_back();
    for (int step = 0; step < 5000; step++) {
        int version = int(random() % versions.size());
        const Queue& current = versions[version].first;
        const std::deque<int>& expected = versions[version].second;
        assert(current.size() == int(expected.size()));
        assert(current.empty() == expected.empty());
        if (!expected.empty()) {
            assert(current.front() == expected.front());
            assert(current.back() == expected.back());
        }

        Queue next = current;
        std::deque<int> next_expected = expected;
        if (expected.empty() || random() % 3 != 0) {
            int value = int(random() % 1000000);
            next = current.push(value);
            next_expected.push_back(value);
        } else {
            next = current.pop();
            next_expected.pop_front();
        }
        assert(current.size() == int(expected.size()));
        if (!expected.empty()) assert(current.front() == expected.front());
        assert(next.size() == int(next_expected.size()));
        if (!next_expected.empty()) {
            assert(next.front() == next_expected.front());
            assert(next.back() == next_expected.back());
        }
        versions.emplace_back(std::move(next), std::move(next_expected));
    }

    Queue stable = Queue().push(1);
    const int& reference = stable.front();
    Queue growing = stable;
    for (int value = 2; value <= 1000; value++) {
        growing = growing.push_back(value);
    }
    assert(reference == 1);
    assert(growing.back() == 1000);
    assert(growing.clear().empty());

    m1une::ds::PersistentQueue<std::unique_ptr<int>> move_only;
    auto first = move_only.push(std::make_unique<int>(4));
    auto second = first.push(std::make_unique<int>(9));
    assert(*first.front() == 4);
    assert(*second.front() == 4);
    assert(*second.back() == 9);
    assert(*second.pop_front().front() == 9);
}

}  // namespace

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

    test_randomized();

    int query_count = 0;
    fast_input >> query_count;
    using Queue = m1une::ds::PersistentQueue<int>;
    Queue empty;
    std::vector<Queue> versions(query_count + 1, empty);
    for (int query = 0; query < query_count; query++) {
        int type = 0, base = 0;
        fast_input >> type >> base;
        const auto& source = versions[base + 1];
        if (type == 0) {
            int value = 0;
            fast_input >> value;
            versions[query + 1] = source.push(value);
        } else {
            fast_output << source.front() << '\n';
            versions[query + 1] = source.pop();
        }
    }
}
Back to top page