m1une's library

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

View on GitHub

:heavy_check_mark: verify/game/classic_games.test.cpp

Depends on

Code

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

#include "../../game/green_hackenbush.hpp"
#include "../../game/silver_dollar_game.hpp"
#include "../../game/subtraction_game.hpp"

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

namespace {

void test_subtraction_games() {
    std::mt19937 random(314159265);
    for (int move_mask = 0; move_mask < (1 << 7); ++move_mask) {
        std::vector<int> moves;
        for (int move = 1; move <= 7; ++move) {
            if (move_mask >> (move - 1) & 1) moves.push_back(move);
        }

        constexpr int max_heap = 80;
        std::vector<int> expected(max_heap + 1);
        for (int heap = 1; heap <= max_heap; ++heap) {
            std::vector<bool> appears(moves.size() + 1);
            for (int move : moves) {
                if (move <= heap) appears[expected[heap - move]] = true;
            }
            while (appears[expected[heap]]) expected[heap]++;
        }
        assert(m1une::game::subtraction_game_grundy(max_heap, moves) == expected);

        for (int trial = 0; trial < 30; ++trial) {
            std::vector<int> heaps(10);
            int expected_sum = 0;
            for (int& heap : heaps) {
                heap = int(random() % (max_heap + 1));
                expected_sum ^= expected[heap];
            }
            assert(m1une::game::subtraction_game_nim_sum(heaps, moves) == expected_sum);
            assert(
                m1une::game::subtraction_game_first_player_wins(heaps, moves)
                == (expected_sum != 0)
            );
        }
    }
}

uint64_t brute_hackenbush(const std::vector<int>& parent) {
    const int size = int(parent.size());
    std::vector<unsigned> subtree(size);
    for (int edge = size - 1; edge >= 0; --edge) {
        subtree[edge] |= 1U << edge;
        if (parent[edge] != -1) subtree[parent[edge]] |= subtree[edge];
    }

    std::vector<int> memo(1U << size, -1);
    std::function<int(unsigned)> solve = [&](unsigned state) {
        int& result = memo[state];
        if (result != -1) return result;
        std::vector<bool> appears(size + 1);
        for (int edge = 0; edge < size; ++edge) {
            if (state >> edge & 1U) {
                appears[solve(state & ~subtree[edge])] = true;
            }
        }
        result = 0;
        while (appears[result]) result++;
        return result;
    };
    return uint64_t(solve((1U << size) - 1));
}

void test_hackenbush_forests() {
    for (int size = 0; size <= 8; ++size) {
        std::vector<int> parent(size);
        std::function<void(int)> enumerate = [&](int edge) {
            if (edge == size) {
                const uint64_t expected = brute_hackenbush(parent);
                assert(m1une::game::green_hackenbush_grundy(parent) == expected);
                assert(
                    m1une::game::green_hackenbush_first_player_wins(parent)
                    == (expected != 0)
                );
                return;
            }
            for (int value = -1; value < edge; ++value) {
                parent[edge] = value;
                enumerate(edge + 1);
            }
        };
        enumerate(0);
    }
}

int brute_silver_dollar(unsigned state, int board_size, std::vector<int>& memo) {
    int& result = memo[state];
    if (result != -1) return result;
    std::vector<int> coins;
    for (int position = 0; position < board_size; ++position) {
        if (state >> position & 1U) coins.push_back(position);
    }

    std::vector<bool> appears(board_size + 1);
    for (int index = 0; index < int(coins.size()); ++index) {
        const int lower = index == 0 ? 0 : coins[index - 1] + 1;
        for (int destination = lower; destination < coins[index]; ++destination) {
            const unsigned next = state ^ (1U << coins[index]) ^ (1U << destination);
            appears[brute_silver_dollar(next, board_size, memo)] = true;
        }
    }
    result = 0;
    while (appears[result]) result++;
    return result;
}

void test_silver_dollar_positions() {
    constexpr int board_size = 10;
    std::vector<int> memo(1 << board_size, -1);
    for (unsigned state = 0; state < (1U << board_size); ++state) {
        std::vector<int> coins;
        for (int position = 0; position < board_size; ++position) {
            if (state >> position & 1U) coins.push_back(position);
        }
        const int expected = brute_silver_dollar(state, board_size, memo);
        assert(m1une::game::silver_dollar_grundy(coins) == expected);
        assert(
            m1une::game::silver_dollar_first_player_wins(coins)
            == (expected != 0)
        );
    }

    std::vector<unsigned long long> unsigned_coins = {1, 3, 7};
    assert(m1une::game::silver_dollar_grundy(unsigned_coins) == 2);
}

}  // namespace

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

    test_subtraction_games();
    test_hackenbush_forests();
    test_silver_dollar_positions();

    long long first, second;
    fast_input >> first >> second;
    fast_output << first + second << '\n';
}
#line 1 "verify/game/classic_games.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"

#line 1 "game/green_hackenbush.hpp"



#include <cassert>
#include <cstdint>
#include <vector>

namespace m1une {
namespace game {

// Every vertex represents one green edge. parent[v] == -1 attaches that edge
// to the ground; otherwise it attaches it above the edge parent[v].
inline uint64_t green_hackenbush_grundy(const std::vector<int>& parent) {
    const int size = int(parent.size());
    std::vector<std::vector<int>> children(size);
    std::vector<int> roots;
    for (int edge = 0; edge < size; ++edge) {
        assert(-1 <= parent[edge] && parent[edge] < size);
        assert(parent[edge] != edge);
        if (parent[edge] == -1) {
            roots.push_back(edge);
        } else {
            children[parent[edge]].push_back(edge);
        }
    }

    std::vector<int> order = roots;
    order.reserve(size);
    for (int position = 0; position < int(order.size()); ++position) {
        const int edge = order[position];
        for (int child : children[edge]) order.push_back(child);
    }
    assert(int(order.size()) == size);

    std::vector<uint64_t> branch(size);
    for (int position = size - 1; position >= 0; --position) {
        const int edge = order[position];
        uint64_t children_grundy = 0;
        for (int child : children[edge]) children_grundy ^= branch[child];
        branch[edge] = children_grundy + 1;
    }

    uint64_t result = 0;
    for (int root : roots) result ^= branch[root];
    return result;
}

inline bool green_hackenbush_first_player_wins(
    const std::vector<int>& parent
) {
    return green_hackenbush_grundy(parent) != 0;
}

}  // namespace game
}  // namespace m1une


#line 1 "game/silver_dollar_game.hpp"



#line 5 "game/silver_dollar_game.hpp"
#include <type_traits>
#line 7 "game/silver_dollar_game.hpp"

namespace m1une {
namespace game {

template <typename T>
T silver_dollar_grundy(const std::vector<T>& coins) {
    for (int index = 0; index < int(coins.size()); ++index) {
        if constexpr (std::is_signed_v<T>) assert(coins[index] >= 0);
        if (index != 0) assert(coins[index - 1] < coins[index]);
    }

    T result{};
    int index = int(coins.size()) % 2;
    if (index == 1) result ^= coins[0];
    for (; index + 1 < int(coins.size()); index += 2) {
        result ^= coins[index + 1] - coins[index] - 1;
    }
    return result;
}

template <typename T>
bool silver_dollar_first_player_wins(const std::vector<T>& coins) {
    return silver_dollar_grundy(coins) != 0;
}

}  // namespace game
}  // namespace m1une


#line 1 "game/subtraction_game.hpp"



#include <algorithm>
#line 7 "game/subtraction_game.hpp"

namespace m1une {
namespace game {

inline std::vector<int> subtraction_game_grundy(
    int max_heap,
    const std::vector<int>& moves
) {
    assert(max_heap >= 0);
    for (int move : moves) assert(move > 0);

    std::vector<int> grundy(max_heap + 1);
    std::vector<int> seen(moves.size() + 1, -1);
    for (int heap = 1; heap <= max_heap; ++heap) {
        for (int move : moves) {
            if (move > heap) continue;
            const int value = grundy[heap - move];
            if (value < int(seen.size())) seen[value] = heap;
        }
        while (
            grundy[heap] < int(seen.size())
            && seen[grundy[heap]] == heap
        ) {
            grundy[heap]++;
        }
    }
    return grundy;
}

inline int subtraction_game_nim_sum(
    const std::vector<int>& heaps,
    const std::vector<int>& moves
) {
    int max_heap = 0;
    for (int heap : heaps) {
        assert(heap >= 0);
        max_heap = std::max(max_heap, heap);
    }
    const std::vector<int> grundy = subtraction_game_grundy(max_heap, moves);
    int result = 0;
    for (int heap : heaps) result ^= grundy[heap];
    return result;
}

inline bool subtraction_game_first_player_wins(
    const std::vector<int>& heaps,
    const std::vector<int>& moves
) {
    return subtraction_game_nim_sum(heaps, moves) != 0;
}

}  // namespace game
}  // namespace m1une


#line 6 "verify/game/classic_games.test.cpp"

#line 1 "utilities/fast_io.hpp"



#line 5 "utilities/fast_io.hpp"
#include <array>
#include <cerrno>
#include <charconv>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#line 12 "utilities/fast_io.hpp"
#include <cstring>
#include <iterator>
#include <string>
#include <sys/stat.h>
#line 17 "utilities/fast_io.hpp"
#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 11 "verify/game/classic_games.test.cpp"
#include <functional>
#include <random>
#line 14 "verify/game/classic_games.test.cpp"

namespace {

void test_subtraction_games() {
    std::mt19937 random(314159265);
    for (int move_mask = 0; move_mask < (1 << 7); ++move_mask) {
        std::vector<int> moves;
        for (int move = 1; move <= 7; ++move) {
            if (move_mask >> (move - 1) & 1) moves.push_back(move);
        }

        constexpr int max_heap = 80;
        std::vector<int> expected(max_heap + 1);
        for (int heap = 1; heap <= max_heap; ++heap) {
            std::vector<bool> appears(moves.size() + 1);
            for (int move : moves) {
                if (move <= heap) appears[expected[heap - move]] = true;
            }
            while (appears[expected[heap]]) expected[heap]++;
        }
        assert(m1une::game::subtraction_game_grundy(max_heap, moves) == expected);

        for (int trial = 0; trial < 30; ++trial) {
            std::vector<int> heaps(10);
            int expected_sum = 0;
            for (int& heap : heaps) {
                heap = int(random() % (max_heap + 1));
                expected_sum ^= expected[heap];
            }
            assert(m1une::game::subtraction_game_nim_sum(heaps, moves) == expected_sum);
            assert(
                m1une::game::subtraction_game_first_player_wins(heaps, moves)
                == (expected_sum != 0)
            );
        }
    }
}

uint64_t brute_hackenbush(const std::vector<int>& parent) {
    const int size = int(parent.size());
    std::vector<unsigned> subtree(size);
    for (int edge = size - 1; edge >= 0; --edge) {
        subtree[edge] |= 1U << edge;
        if (parent[edge] != -1) subtree[parent[edge]] |= subtree[edge];
    }

    std::vector<int> memo(1U << size, -1);
    std::function<int(unsigned)> solve = [&](unsigned state) {
        int& result = memo[state];
        if (result != -1) return result;
        std::vector<bool> appears(size + 1);
        for (int edge = 0; edge < size; ++edge) {
            if (state >> edge & 1U) {
                appears[solve(state & ~subtree[edge])] = true;
            }
        }
        result = 0;
        while (appears[result]) result++;
        return result;
    };
    return uint64_t(solve((1U << size) - 1));
}

void test_hackenbush_forests() {
    for (int size = 0; size <= 8; ++size) {
        std::vector<int> parent(size);
        std::function<void(int)> enumerate = [&](int edge) {
            if (edge == size) {
                const uint64_t expected = brute_hackenbush(parent);
                assert(m1une::game::green_hackenbush_grundy(parent) == expected);
                assert(
                    m1une::game::green_hackenbush_first_player_wins(parent)
                    == (expected != 0)
                );
                return;
            }
            for (int value = -1; value < edge; ++value) {
                parent[edge] = value;
                enumerate(edge + 1);
            }
        };
        enumerate(0);
    }
}

int brute_silver_dollar(unsigned state, int board_size, std::vector<int>& memo) {
    int& result = memo[state];
    if (result != -1) return result;
    std::vector<int> coins;
    for (int position = 0; position < board_size; ++position) {
        if (state >> position & 1U) coins.push_back(position);
    }

    std::vector<bool> appears(board_size + 1);
    for (int index = 0; index < int(coins.size()); ++index) {
        const int lower = index == 0 ? 0 : coins[index - 1] + 1;
        for (int destination = lower; destination < coins[index]; ++destination) {
            const unsigned next = state ^ (1U << coins[index]) ^ (1U << destination);
            appears[brute_silver_dollar(next, board_size, memo)] = true;
        }
    }
    result = 0;
    while (appears[result]) result++;
    return result;
}

void test_silver_dollar_positions() {
    constexpr int board_size = 10;
    std::vector<int> memo(1 << board_size, -1);
    for (unsigned state = 0; state < (1U << board_size); ++state) {
        std::vector<int> coins;
        for (int position = 0; position < board_size; ++position) {
            if (state >> position & 1U) coins.push_back(position);
        }
        const int expected = brute_silver_dollar(state, board_size, memo);
        assert(m1une::game::silver_dollar_grundy(coins) == expected);
        assert(
            m1une::game::silver_dollar_first_player_wins(coins)
            == (expected != 0)
        );
    }

    std::vector<unsigned long long> unsigned_coins = {1, 3, 7};
    assert(m1une::game::silver_dollar_grundy(unsigned_coins) == 2);
}

}  // namespace

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

    test_subtraction_games();
    test_hackenbush_forests();
    test_silver_dollar_positions();

    long long first, second;
    fast_input >> first >> second;
    fast_output << first + second << '\n';
}
Back to top page