#line 1 "verify/ds/hash_table/hash_map.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/associative_array"
#line 1 "ds/hash_table/hash_map.hpp"
#line 1 "ds/hash_table/hash_common.hpp"
#include <algorithm>
#include <chrono>
#include <cstddef>
#include <cstdint>
#include <new>
#include <type_traits>
#include <utility>
namespace m1une {
namespace ds {
namespace detail {
inline std::uint64_t splitmix64(std::uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
template <typename Key, typename Hash>
std::size_t mixed_hash(const Key& key, const Hash& hash) {
static const std::uint64_t fixed_random =
std::chrono::steady_clock::now().time_since_epoch().count();
return static_cast<std::size_t>(splitmix64(static_cast<std::uint64_t>(hash(key)) + fixed_random));
}
inline std::size_t bit_ceil(std::size_t n) {
std::size_t result = 1;
while (result < n) result <<= 1;
return result;
}
inline std::size_t bucket_count_for(std::size_t expected_size) {
return bit_ceil(std::max<std::size_t>(16, expected_size * 10 / 7 + 1));
}
template <typename T>
struct Slot {
alignas(T) unsigned char storage[sizeof(T)];
T* ptr() {
return std::launder(reinterpret_cast<T*>(storage));
}
const T* ptr() const {
return std::launder(reinterpret_cast<const T*>(storage));
}
template <typename... Args>
void construct(Args&&... args) {
::new (static_cast<void*>(storage)) T(std::forward<Args>(args)...);
}
void destroy() {
if constexpr (!std::is_trivially_destructible_v<T>) {
ptr()->~T();
}
}
};
} // namespace detail
} // namespace ds
} // namespace m1une
#line 5 "ds/hash_table/hash_map.hpp"
#line 8 "ds/hash_table/hash_map.hpp"
#include <functional>
#include <initializer_list>
#include <stdexcept>
#line 12 "ds/hash_table/hash_map.hpp"
#include <vector>
namespace m1une {
namespace ds {
template <typename Key, typename T, typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<Key>>
struct HashMap {
private:
struct Node {
Key key;
T value;
template <typename K, typename V>
Node(K&& node_key, V&& node_value) : key(std::forward<K>(node_key)), value(std::forward<V>(node_value)) {}
};
static constexpr unsigned char EMPTY = 0;
static constexpr unsigned char DELETED = 1;
static constexpr std::size_t npos = static_cast<std::size_t>(-1);
std::vector<unsigned char> ctrl;
std::vector<detail::Slot<Node>> data;
std::size_t _size = 0;
std::size_t _deleted = 0;
Hash hasher;
KeyEqual key_equal;
std::size_t mask() const {
return ctrl.size() - 1;
}
std::size_t make_hash(const Key& key) const {
return detail::mixed_hash(key, hasher);
}
static unsigned char fingerprint(std::size_t h) {
return static_cast<unsigned char>(2 + (h >> (sizeof(std::size_t) * 8 - 7)));
}
static bool occupied(unsigned char c) {
return c >= 2;
}
Node* node_at(std::size_t i) {
return data[i].ptr();
}
const Node* node_at(std::size_t i) const {
return data[i].ptr();
}
void destroy_all() {
for (std::size_t i = 0; i < ctrl.size(); i++) {
if (occupied(ctrl[i])) data[i].destroy();
}
}
void reset(std::size_t bucket_count) {
destroy_all();
bucket_count = detail::bit_ceil(std::max<std::size_t>(16, bucket_count));
ctrl.assign(bucket_count, EMPTY);
data.clear();
data.resize(bucket_count);
_size = 0;
_deleted = 0;
}
std::size_t find_index_with_hash(const Key& key, std::size_t h) const {
const unsigned char fp = fingerprint(h);
std::size_t i = h & mask();
while (true) {
const unsigned char c = ctrl[i];
if (c == EMPTY) return npos;
if (c == fp && key_equal(node_at(i)->key, key)) return i;
i = (i + 1) & mask();
}
}
std::size_t find_index(const Key& key) const {
return find_index_with_hash(key, make_hash(key));
}
void insert_existing(Node&& node, std::size_t h) {
std::size_t i = h & mask();
while (occupied(ctrl[i])) i = (i + 1) & mask();
ctrl[i] = fingerprint(h);
data[i].construct(std::move(node));
_size++;
}
void rebuild(std::size_t bucket_count) {
std::vector<unsigned char> old_ctrl = std::move(ctrl);
std::vector<detail::Slot<Node>> old_data = std::move(data);
ctrl.clear();
data.clear();
bucket_count = detail::bit_ceil(std::max<std::size_t>(16, bucket_count));
ctrl.assign(bucket_count, EMPTY);
data.resize(bucket_count);
_size = 0;
_deleted = 0;
for (std::size_t i = 0; i < old_ctrl.size(); i++) {
if (occupied(old_ctrl[i])) {
Node* node = old_data[i].ptr();
insert_existing(std::move(*node), make_hash(node->key));
old_data[i].destroy();
}
}
}
void ensure_for_insert() {
const std::size_t used = _size + _deleted;
if ((used + 1) * 10 >= ctrl.size() * 7) {
rebuild(ctrl.size() * 2);
} else if (_deleted > _size && (_size + 1) * 10 < ctrl.size() * 7) {
rebuild(ctrl.size());
}
}
template <typename K, typename V>
std::pair<T*, bool> insert_impl(K&& key, V&& value) {
ensure_for_insert();
const std::size_t h = make_hash(key);
const unsigned char fp = fingerprint(h);
std::size_t first_deleted = npos;
std::size_t i = h & mask();
while (true) {
const unsigned char c = ctrl[i];
if (occupied(c)) {
Node* node = node_at(i);
if (c == fp && key_equal(node->key, key)) return {&node->value, false};
} else if (c == DELETED) {
if (first_deleted == npos) first_deleted = i;
} else {
const std::size_t pos = first_deleted == npos ? i : first_deleted;
if (first_deleted != npos) _deleted--;
ctrl[pos] = fp;
data[pos].construct(std::forward<K>(key), std::forward<V>(value));
_size++;
return {&node_at(pos)->value, true};
}
i = (i + 1) & mask();
}
}
public:
HashMap() : hasher(Hash()), key_equal(KeyEqual()) {
reset(16);
}
explicit HashMap(std::size_t reserve_count, Hash hash_fn = Hash(), KeyEqual equal_fn = KeyEqual())
: hasher(std::move(hash_fn)), key_equal(std::move(equal_fn)) {
reset(detail::bucket_count_for(reserve_count));
}
HashMap(std::initializer_list<std::pair<Key, T>> init, Hash hash_fn = Hash(), KeyEqual equal_fn = KeyEqual())
: HashMap(init.size(), std::move(hash_fn), std::move(equal_fn)) {
for (const auto& [key, value] : init) insert(key, value);
}
template <typename Iterator>
HashMap(Iterator first, Iterator last, Hash hash_fn = Hash(), KeyEqual equal_fn = KeyEqual())
: HashMap(0, std::move(hash_fn), std::move(equal_fn)) {
while (first != last) {
insert(first->first, first->second);
++first;
}
}
HashMap(const HashMap& other) : hasher(other.hasher), key_equal(other.key_equal) {
ctrl.assign(other.ctrl.size(), EMPTY);
data.resize(other.data.size());
for (std::size_t i = 0; i < other.ctrl.size(); i++) {
ctrl[i] = other.ctrl[i];
if (occupied(other.ctrl[i])) data[i].construct(other.node_at(i)->key, other.node_at(i)->value);
}
_size = other._size;
_deleted = other._deleted;
}
HashMap(HashMap&& other) noexcept
: ctrl(std::move(other.ctrl)),
data(std::move(other.data)),
_size(other._size),
_deleted(other._deleted),
hasher(std::move(other.hasher)),
key_equal(std::move(other.key_equal)) {
other.ctrl.clear();
other.data.clear();
other._size = 0;
other._deleted = 0;
}
HashMap& operator=(const HashMap& other) {
if (this == &other) return *this;
HashMap copy(other);
*this = std::move(copy);
return *this;
}
HashMap& operator=(HashMap&& other) noexcept {
if (this == &other) return *this;
destroy_all();
ctrl = std::move(other.ctrl);
data = std::move(other.data);
_size = other._size;
_deleted = other._deleted;
hasher = std::move(other.hasher);
key_equal = std::move(other.key_equal);
other.ctrl.clear();
other.data.clear();
other._size = 0;
other._deleted = 0;
return *this;
}
~HashMap() {
destroy_all();
}
int size() const {
return static_cast<int>(_size);
}
bool empty() const {
return _size == 0;
}
std::size_t bucket_count() const {
return ctrl.size();
}
double load_factor() const {
return static_cast<double>(_size) / static_cast<double>(ctrl.size());
}
void clear() {
reset(ctrl.size());
}
void reserve(std::size_t count) {
const std::size_t target = detail::bucket_count_for(count);
if (target > ctrl.size() || _deleted > 0) rebuild(std::max(target, ctrl.size()));
}
std::pair<T*, bool> insert(const Key& key, const T& value) {
return insert_impl(key, value);
}
std::pair<T*, bool> insert(Key&& key, T&& value) {
return insert_impl(std::move(key), std::move(value));
}
std::pair<T*, bool> insert(const std::pair<Key, T>& value) {
return insert_impl(value.first, value.second);
}
std::pair<T*, bool> insert(std::pair<Key, T>&& value) {
return insert_impl(std::move(value.first), std::move(value.second));
}
template <typename V>
T* insert_or_assign(const Key& key, V&& value) {
auto result = insert_impl(key, std::forward<V>(value));
if (!result.second) *result.first = std::forward<V>(value);
return result.first;
}
template <typename V>
T* insert_or_assign(Key&& key, V&& value) {
auto result = insert_impl(std::move(key), std::forward<V>(value));
if (!result.second) *result.first = std::forward<V>(value);
return result.first;
}
bool erase(const Key& key) {
const std::size_t h = make_hash(key);
const std::size_t i = find_index_with_hash(key, h);
if (i == npos) return false;
data[i].destroy();
ctrl[i] = DELETED;
_size--;
_deleted++;
return true;
}
T* find(const Key& key) {
const std::size_t i = find_index(key);
return i == npos ? nullptr : &node_at(i)->value;
}
const T* find(const Key& key) const {
const std::size_t i = find_index(key);
return i == npos ? nullptr : &node_at(i)->value;
}
bool contains(const Key& key) const {
return find_index(key) != npos;
}
int count(const Key& key) const {
return contains(key) ? 1 : 0;
}
T& at(const Key& key) {
T* p = find(key);
if (p == nullptr) throw std::out_of_range("HashMap::at");
return *p;
}
const T& at(const Key& key) const {
const T* p = find(key);
if (p == nullptr) throw std::out_of_range("HashMap::at");
return *p;
}
T& operator[](const Key& key) {
return *insert_impl(key, T()).first;
}
T& operator[](Key&& key) {
return *insert_impl(std::move(key), T()).first;
}
std::vector<std::pair<Key, T>> to_vector() const {
std::vector<std::pair<Key, T>> result;
result.reserve(_size);
for (std::size_t i = 0; i < ctrl.size(); i++) {
if (occupied(ctrl[i])) result.emplace_back(node_at(i)->key, node_at(i)->value);
}
return result;
}
};
} // namespace ds
} // namespace m1une
#line 4 "verify/ds/hash_table/hash_map.test.cpp"
#include <cassert>
#line 1 "utilities/fast_io.hpp"
#line 5 "utilities/fast_io.hpp"
#include <array>
#include <cerrno>
#include <charconv>
#line 9 "utilities/fast_io.hpp"
#include <cstdio>
#include <cstdlib>
#line 12 "utilities/fast_io.hpp"
#include <cstring>
#include <iterator>
#include <string>
#include <sys/stat.h>
#line 18 "utilities/fast_io.hpp"
#include <unistd.h>
#line 20 "utilities/fast_io.hpp"
namespace m1une {
namespace utilities {
struct FastOutput;
namespace internal {
// Shared with the convenience helpers in template.hpp.
inline FastOutput* standard_output_instance = nullptr;
// Detect std::begin(x), std::end(x).
template <class T, class = void>
struct is_range : std::false_type {};
template <class T>
struct is_range<T, std::void_t<
decltype(std::begin(std::declval<T&>())),
decltype(std::end(std::declval<T&>()))
>> : std::true_type {};
template <class T>
inline constexpr bool is_range_v = is_range<T>::value;
template <class T>
using range_reference_t = decltype(*std::begin(std::declval<T&>()));
template <class T>
using range_value_t = std::remove_cv_t<std::remove_reference_t<range_reference_t<T>>>;
template <class T, class = void>
struct range_stored_value {
using type = range_value_t<T>;
};
template <class T>
struct range_stored_value<T, std::void_t<typename std::remove_cv_t<std::remove_reference_t<T>>::value_type>> {
using type = typename std::remove_cv_t<std::remove_reference_t<T>>::value_type;
};
template <class T>
using range_stored_value_t = typename range_stored_value<T>::type;
// Treat strings and C strings as scalar output objects, not as ranges.
template <class T>
struct is_char_array : std::false_type {};
template <class T, std::size_t N>
struct is_char_array<T[N]>
: std::bool_constant<std::is_same_v<std::remove_cv_t<T>, char>> {};
template <class T>
struct is_string_like
: std::bool_constant<
std::is_same_v<std::decay_t<T>, std::string>
|| std::is_same_v<std::decay_t<T>, const char*>
|| std::is_same_v<std::decay_t<T>, char*>
|| is_char_array<std::remove_reference_t<T>>::value
> {};
template <class T>
inline constexpr bool is_string_like_v = is_string_like<T>::value;
// ModInt-like type: x.val() is printable, and x can be assigned from long long.
template <class T, class = void>
struct has_val_method : std::false_type {};
template <class T>
struct has_val_method<T, std::void_t<decltype(std::declval<const T&>().val())>>
: std::true_type {};
template <class T>
inline constexpr bool has_val_method_v = has_val_method<T>::value;
template <class T, class = void>
struct has_static_mod_raw : std::false_type {};
template <class T>
struct has_static_mod_raw<
T, std::void_t<decltype(T::mod()), decltype(T::raw(std::declval<uint32_t>()))>>
: std::true_type {};
template <class T>
inline constexpr bool has_static_mod_raw_v = has_static_mod_raw<T>::value;
// libstdc++ before GCC 16 does not classify __int128 as an integral type in
// strict ISO modes such as -std=c++23. Keep the fast-I/O interface independent
// of that implementation detail.
template <class T>
inline constexpr bool is_integral_v =
std::is_integral_v<T>
|| std::is_same_v<std::remove_cv_t<T>, __int128_t>
|| std::is_same_v<std::remove_cv_t<T>, __uint128_t>;
template <class T>
inline constexpr bool is_signed_v =
std::is_signed_v<T>
|| std::is_same_v<std::remove_cv_t<T>, __int128_t>;
template <class T>
struct make_unsigned {
using type = std::make_unsigned_t<T>;
};
template <>
struct make_unsigned<__int128_t> {
using type = __uint128_t;
};
template <>
struct make_unsigned<__uint128_t> {
using type = __uint128_t;
};
template <class T>
using make_unsigned_t = typename make_unsigned<std::remove_cv_t<T>>::type;
} // namespace internal
struct FastInput {
static constexpr int buffer_size = 1 << 20;
private:
std::FILE* _stream;
char _buffer[buffer_size];
int _position;
int _length;
int _file_descriptor;
bool _streaming;
bool refill() {
_position = 0;
if (_streaming) {
ssize_t length;
do {
length = ::read(_file_descriptor, _buffer, buffer_size);
} while (length < 0 && errno == EINTR);
if (length <= 0) {
_length = 0;
return false;
}
_length = int(length);
} else {
_length = int(std::fread(_buffer, 1, buffer_size, _stream));
}
return _length != 0;
}
template <class T>
bool read_integer_from_stream(T& value) {
if (!skip_spaces()) return false;
int c = read_char_raw();
bool negative = false;
if (c == '-') {
negative = true;
c = read_char_raw();
}
if constexpr (internal::is_signed_v<T>) {
T result = 0;
while ('0' <= c && c <= '9') {
result = negative ? result * 10 - (c - '0')
: result * 10 + (c - '0');
c = read_char_raw();
}
value = result;
} else {
T result = 0;
while ('0' <= c && c <= '9') {
result = result * 10 + T(c - '0');
c = read_char_raw();
}
value = negative ? T(0) - result : result;
}
return true;
}
bool prepare_number() {
if (_length - _position >= 64) return true;
const int remaining = _length - _position;
if (remaining > 0) std::memmove(_buffer, _buffer + _position, remaining);
const int added = int(std::fread(_buffer + remaining, 1, buffer_size - remaining, _stream));
_position = 0;
_length = remaining + added;
if (_length < buffer_size) _buffer[_length] = '\0';
return _length != 0;
}
public:
explicit FastInput(std::FILE* stream = stdin)
: _stream(stream),
_position(0),
_length(0),
_file_descriptor(::fileno(stream)),
_streaming([&] {
struct stat status;
return _file_descriptor >= 0
&& ::fstat(_file_descriptor, &status) == 0
&& !S_ISREG(status.st_mode);
}()) {}
FastInput(const FastInput&) = delete;
FastInput& operator=(const FastInput&) = delete;
int read_char_raw() {
if (_position == _length && !refill()) return EOF;
return _buffer[_position++];
}
bool skip_spaces() {
int c = read_char_raw();
while (c != EOF && c <= ' ') c = read_char_raw();
if (c == EOF) return false;
--_position;
return true;
}
bool read(char& value) {
if (!skip_spaces()) return false;
value = char(read_char_raw());
return true;
}
bool read(std::string& value) {
if (!skip_spaces()) return false;
value.clear();
while (true) {
const int begin = _position;
while (_position < _length &&
static_cast<unsigned char>(_buffer[_position]) > ' ') {
++_position;
}
value.append(_buffer + begin, _position - begin);
if (_position < _length) {
++_position;
return true;
}
if (!refill()) return true;
}
}
bool read(bool& value) {
int x;
if (!read(x)) return false;
value = x != 0;
return true;
}
template <class T>
std::enable_if_t<
internal::is_integral_v<T>
&& !std::is_same_v<std::remove_cv_t<T>, bool>
&& !std::is_same_v<std::remove_cv_t<T>, char>,
bool
>
read(T& value) {
if (_streaming) return read_integer_from_stream(value);
if (!prepare_number()) return false;
int c = static_cast<unsigned char>(_buffer[_position++]);
while (c <= ' ') c = static_cast<unsigned char>(_buffer[_position++]);
bool negative = false;
if (c == '-') {
negative = true;
c = static_cast<unsigned char>(_buffer[_position++]);
}
if constexpr (internal::is_signed_v<T>) {
T result = 0;
while ('0' <= c && c <= '9') {
const int first = c - '0';
const int second = static_cast<unsigned char>(_buffer[_position]) - '0';
if (0 <= second && second <= 9) {
result = negative ? result * 100 - (first * 10 + second)
: result * 100 + (first * 10 + second);
++_position;
} else {
result = negative ? result * 10 - first : result * 10 + first;
}
c = static_cast<unsigned char>(_buffer[_position++]);
}
value = result;
} else {
T result = 0;
while ('0' <= c && c <= '9') {
const unsigned first = unsigned(c - '0');
const int second = static_cast<unsigned char>(_buffer[_position]) - '0';
if (0 <= second && second <= 9) {
result = result * 100 + T(first * 10 + unsigned(second));
++_position;
} else {
result = result * 10 + T(first);
}
c = static_cast<unsigned char>(_buffer[_position++]);
}
value = negative ? T(0) - result : result;
}
if (_position > _length) _position = _length;
return true;
}
template <class T>
std::enable_if_t<std::is_floating_point_v<T>, bool>
read(T& value) {
if (!skip_spaces()) return false;
int c = read_char_raw();
bool negative = false;
if (c == '-' || c == '+') {
negative = c == '-';
c = read_char_raw();
}
long double result = 0;
while ('0' <= c && c <= '9') {
result = result * 10 + (c - '0');
c = read_char_raw();
}
if (c == '.') {
long double place = 0.1L;
c = read_char_raw();
while ('0' <= c && c <= '9') {
result += (c - '0') * place;
place *= 0.1L;
c = read_char_raw();
}
}
if (c == 'e' || c == 'E') {
c = read_char_raw();
bool exponent_negative = false;
if (c == '-' || c == '+') {
exponent_negative = c == '-';
c = read_char_raw();
}
int exponent = 0;
while ('0' <= c && c <= '9') {
exponent = exponent * 10 + (c - '0');
c = read_char_raw();
}
long double scale = 1;
long double power = 10;
while (exponent > 0) {
if (exponent & 1) scale *= power;
power *= power;
exponent >>= 1;
}
result = exponent_negative ? result / scale : result * scale;
}
value = static_cast<T>(negative ? -result : result);
return true;
}
template <class T>
std::enable_if_t<
internal::has_val_method_v<T>
&& !internal::is_integral_v<T>
&& !internal::is_range_v<T>,
bool
>
read(T& value) {
long long x;
if (!read(x)) return false;
if constexpr (internal::has_static_mod_raw_v<T>) {
if (x >= 0 && uint64_t(x) < uint64_t(T::mod())) {
value = T::raw(uint32_t(x));
} else {
value = T(x);
}
} else {
value = T(x);
}
return true;
}
template <class First, class Second>
bool read(std::pair<First, Second>& value) {
if (!read(value.first)) return false;
return read(value.second);
}
template <class Range>
std::enable_if_t<
internal::is_range_v<Range>
&& !internal::is_string_like_v<Range>,
bool
>
read(Range& range) {
using StoredValue = internal::range_stored_value_t<Range>;
constexpr bool nested = internal::is_range_v<StoredValue>
&& !internal::is_string_like_v<StoredValue>;
for (auto&& value : range) {
if constexpr (std::is_same_v<StoredValue, bool> && !nested) {
bool x;
if (!read(x)) return false;
value = x;
} else {
if (!read(value)) return false;
}
}
return true;
}
template <class First, class Second, class... Rest>
bool read(First& first, Second& second, Rest&... rest) {
if (!read(first)) return false;
return read(second, rest...);
}
template <class T>
FastInput& operator>>(T& value) {
if (!read(value)) std::abort();
return *this;
}
};
struct FastOutput {
static constexpr int buffer_size = 1 << 20;
private:
inline static const auto digit_quads = [] {
std::array<char, 40000> result{};
for (int i = 0; i < 10000; i++) {
int value = i;
for (int j = 3; j >= 0; j--) {
result[4 * i + j] = char('0' + value % 10);
value /= 10;
}
}
return result;
}();
std::FILE* _stream;
char _buffer[buffer_size];
int _position;
int _precision;
std::chars_format _float_format;
char _range_separator;
std::string* _capture = nullptr;
template <class T>
std::string format_cell(const T& value) {
std::string result;
struct CaptureGuard {
std::string*& target;
std::string* previous;
~CaptureGuard() { target = previous; }
} guard{_capture, _capture};
_capture = &result;
write(value);
return result;
}
template <class Matrix>
void write_aligned_matrix(const Matrix& matrix) {
std::vector<std::vector<std::string>> rows;
std::vector<std::size_t> widths;
for (const auto& row : matrix) {
auto& cells = rows.emplace_back();
std::size_t column = 0;
for (const auto& value : row) {
cells.push_back(format_cell(value));
if (column == widths.size()) widths.push_back(0);
widths[column] = std::max(widths[column], cells.back().size());
++column;
}
}
bool first = true;
for (const auto& row : rows) {
if (!first) write_char('\n');
first = false;
for (std::size_t column = 0; column < row.size(); ++column) {
if (column != 0) write_char(_range_separator);
for (std::size_t padding = row[column].size();
padding < widths[column]; ++padding) {
write_char(' ');
}
write(row[column]);
}
}
}
public:
explicit FastOutput(std::FILE* stream = stdout)
: _stream(stream),
_position(0),
_precision(6),
_float_format(std::chars_format::general),
_range_separator(' ') {
if (_stream == stdout
&& internal::standard_output_instance == nullptr) {
internal::standard_output_instance = this;
}
}
FastOutput(const FastOutput&) = delete;
FastOutput& operator=(const FastOutput&) = delete;
~FastOutput() {
flush();
if (internal::standard_output_instance == this) {
internal::standard_output_instance = nullptr;
}
}
void flush() {
if (_position != 0) {
std::fwrite(_buffer, 1, _position, _stream);
_position = 0;
}
std::fflush(_stream);
}
void write_char(char c) {
if (_capture != nullptr) {
_capture->push_back(c);
return;
}
if (_position == buffer_size) flush();
_buffer[_position++] = c;
}
void write(const char* s) {
while (*s != '\0') write_char(*s++);
}
void write(const std::string& s) {
if (_capture != nullptr) {
_capture->append(s);
return;
}
std::size_t position = 0;
while (position < s.size()) {
if (_position == buffer_size) flush();
const std::size_t copied =
std::min<std::size_t>(buffer_size - _position, s.size() - position);
std::memcpy(_buffer + _position, s.data() + position, copied);
_position += int(copied);
position += copied;
}
}
void write(char c) {
write_char(c);
}
void write(bool value) {
write_char(value ? '1' : '0');
}
template <class T>
std::enable_if_t<std::is_floating_point_v<T>>
write(T value) {
char digits[128];
auto [end, error] = std::to_chars(
digits,
digits + sizeof(digits),
value,
_float_format,
_precision
);
if (error != std::errc()) std::abort();
for (const char* pointer = digits; pointer != end; pointer++) {
write_char(*pointer);
}
}
template <class T>
std::enable_if_t<
internal::is_integral_v<T>
&& !std::is_same_v<std::remove_cv_t<T>, bool>
&& !std::is_same_v<std::remove_cv_t<T>, char>
>
write(T value) {
using Raw = std::remove_cv_t<T>;
using Unsigned = internal::make_unsigned_t<Raw>;
Unsigned magnitude;
if constexpr (internal::is_signed_v<Raw>) {
if (value < 0) {
write_char('-');
magnitude = Unsigned(0) - Unsigned(value);
} else {
magnitude = Unsigned(value);
}
} else {
magnitude = value;
}
if (magnitude == 0) {
write_char('0');
return;
}
unsigned chunks[16];
int count = 0;
while (magnitude >= 10000) {
const Unsigned quotient = magnitude / 10000;
chunks[count++] = unsigned(magnitude - quotient * 10000);
magnitude = quotient;
}
if (_capture == nullptr && _position > buffer_size - 64) flush();
char captured[64];
char* const begin = _capture != nullptr ? captured : _buffer + _position;
char* destination = begin;
const unsigned leading = unsigned(magnitude);
const char* first = digit_quads.data() + 4 * leading;
int skip = leading < 10 ? 3 : leading < 100 ? 2 : leading < 1000 ? 1 : 0;
for (; skip < 4; skip++) *destination++ = first[skip];
while (count--) {
const char* digits = digit_quads.data() + 4 * chunks[count];
std::memcpy(destination, digits, 4);
destination += 4;
}
if (_capture != nullptr) {
_capture->append(begin, destination - begin);
} else {
_position += int(destination - begin);
}
}
template <class T>
std::enable_if_t<
internal::has_val_method_v<T>
&& !internal::is_integral_v<T>
&& !internal::is_range_v<T>
>
write(const T& value) {
write(value.val());
}
template <class First, class Second>
void write(const std::pair<First, Second>& value) {
write(value.first);
write_char(' ');
write(value.second);
}
template <class Range>
std::enable_if_t<
internal::is_range_v<Range>
&& !internal::is_string_like_v<Range>
>
write(const Range& range) {
using StoredValue = internal::range_stored_value_t<const Range>;
constexpr bool nested = internal::is_range_v<StoredValue>
&& !internal::is_string_like_v<StoredValue>;
bool first = true;
for (const auto& value : range) {
if (!first) write_char(nested ? '\n' : _range_separator);
first = false;
if constexpr (std::is_same_v<StoredValue, bool> && !nested) {
write(static_cast<bool>(value));
} else {
write(value);
}
}
}
template <class First, class... Rest>
void print(const First& first, const Rest&... rest) {
write(first);
((write_char(' '), write(rest)), ...);
}
void println() {
write_char('\n');
}
void set_precision(int precision) {
_precision = precision;
}
void set_fixed(int precision = 6) {
_float_format = std::chars_format::fixed;
_precision = precision;
}
void set_general(int precision = 6) {
_float_format = std::chars_format::general;
_precision = precision;
}
void set_range_separator(char separator) {
_range_separator = separator;
}
template <class Matrix>
void write_aligned(const Matrix& matrix) {
using Row = internal::range_stored_value_t<const Matrix>;
using Cell = internal::range_stored_value_t<const Row>;
static_assert(internal::is_range_v<Row> && !internal::is_string_like_v<Row>,
"write_aligned requires a two-dimensional range");
static_assert(!internal::is_range_v<Cell> || internal::is_string_like_v<Cell>,
"write_aligned requires scalar cells");
write_aligned_matrix(matrix);
}
template <class Matrix>
void println_aligned(const Matrix& matrix) {
write_aligned(matrix);
write_char('\n');
}
template <class... Args>
void println(const Args&... args) {
print(args...);
write_char('\n');
}
template <class T>
FastOutput& operator<<(const T& value) {
write(value);
return *this;
}
};
} // namespace utilities
} // namespace m1une
#line 8 "verify/ds/hash_table/hash_map.test.cpp"
#include <unordered_map>
void self_test() {
m1une::ds::HashMap<long long, std::string> mp;
assert(mp.empty());
auto inserted = mp.insert(5, std::string("five"));
assert(inserted.second);
assert(*inserted.first == "five");
assert(!mp.insert(5, std::string("ignored")).second);
assert(mp.insert({6, "six"}).second);
assert(mp.at(6) == "six");
assert(mp.at(5) == "five");
mp[7] = "seven";
mp.insert_or_assign(5, "FIVE");
assert(mp.at(5) == "FIVE");
assert(mp.contains(7));
assert(mp.erase(7));
assert(!mp.contains(7));
m1une::ds::HashMap<long long, int> large;
large.reserve(1000);
for (int i = 0; i < 1000; i++) large[i * 1000000007LL] = i;
for (int i = 0; i < 1000; i++) assert(large.at(i * 1000000007LL) == i);
for (int i = 0; i < 500; i++) assert(large.erase(i * 1000000007LL));
for (int i = 0; i < 500; i++) assert(!large.contains(i * 1000000007LL));
for (int i = 500; i < 1000; i++) assert(large.at(i * 1000000007LL) == i);
auto copied_large = large;
auto moved_large = std::move(copied_large);
for (int i = 500; i < 1000; i++) assert(moved_large.at(i * 1000000007LL) == i);
m1une::ds::HashMap<int, int> tested;
std::unordered_map<int, int> expected;
unsigned long long seed = 987654321;
for (int q = 0; q < 10000; q++) {
seed = seed * 6364136223846793005ULL + 1442695040888963407ULL;
int x = static_cast<int>((seed >> 32) % 400) - 200;
int y = static_cast<int>(seed & 1023);
int type = static_cast<int>(seed % 5);
if (type == 0) {
auto a = tested.insert(x, y);
auto b = expected.insert({x, y});
assert(a.second == b.second);
assert(*a.first == b.first->second);
} else if (type == 1) {
tested.insert_or_assign(x, y);
expected[x] = y;
} else if (type == 2) {
assert(tested.erase(x) == (expected.erase(x) == 1));
} else if (type == 3) {
assert(tested.contains(x) == (expected.find(x) != expected.end()));
assert(tested.count(x) == static_cast<int>(expected.count(x)));
} else {
tested[x] += y;
expected[x] += y;
}
assert(tested.size() == static_cast<int>(expected.size()));
for (const auto& [key, value] : expected) assert(tested.at(key) == value);
}
}
int main() {
m1une::utilities::FastInput fast_input;
m1une::utilities::FastOutput fast_output;
self_test();
int q;
fast_input >> q;
m1une::ds::HashMap<long long, long long> map;
while (q--) {
int type;
long long key;
fast_input >> type >> key;
if (type == 0) {
long long value;
fast_input >> value;
map[key] = value;
} else {
fast_output << map[key] << '\n';
}
}
}
verify/ds/hash_table/hash_map.test.cpp