#define PROBLEM "https://judge.yosupo.jp/problem/aplusb" #include "../../template/template.hpp" // #include "../../hashmap/hashset.hpp" uint64_t rng() { static uint64_t x_ = 10150724397891781847ULL; return x_ ^= (x_ << 7), x_ ^= (x_ >> 9); } // [l, r) int64_t randint(int64_t l, int64_t r) { assert(l < r); return l + rng() % (r - l); } namespace HashSetTest { template <typename HS, typename Data_t> void same_set(HS& hs, set<Data_t>& us, int mx) { assert(mx > 0); // iterator { set<Data_t> buf; for (auto& x : hs) buf.insert(x); assert(buf == us && "The range-based for statement"); } // itr::operator++(), itr::operator++(int) { set<Data_t> buf; for (auto it = hs.begin(); it != hs.end();) { buf.insert(*it); auto oit = it; assert(oit == it++ && "itr::operator++(int)"); ++oit; assert(oit == it && "itr::operator++()"); } assert(buf == us && "itr::operator++()"); } // itr::operator--(), itr::operator--(int) { set<Data_t> buf; for (auto it = hs.end(); it != hs.begin();) { auto oit = it; assert(oit == it-- && "itr::operator--(int)"); --oit; assert(oit == it && "itr::operator--()"); buf.insert(*it); } assert(buf == us && "itr::operator--()"); } // begin(*this), end(*this) assert(begin(hs) == hs.begin() && "begin(*this)"); assert(end(hs) == hs.end() && "end(*this)"); // ensure empty space in hash table { uint32_t s = 0; for (uint32_t i = 0; i < hs.cap; ++i) s += hs.occupied_flag[i]; assert(s != hs.cap && "hash table is full!"); } // find, contain if constexpr (is_integral<Data_t>::value) { for (Data_t k = 0; k < mx; ++k) { auto flg1 = hs.find(k) != hs.end(); auto flg2 = us.find(k) != us.end(); auto flg3 = hs.contain(k); assert(flg1 == flg2 && "find(k)"); assert(flg1 == flg3 && "contain(k)"); } } else { for (int t = 0; t < 2 * mx; ++t) { Data_t k{rng() % mx, rng() % mx}; auto flg1 = hs.find(k) != hs.end(); auto flg2 = us.find(k) != us.end(); auto flg3 = hs.contain(k); assert(flg1 == flg2 && "find(k)"); assert(flg1 == flg3 && "contain(k)"); } } // empty assert(hs.empty() == us.empty() && "empty()"); // size assert(hs.size() == (int)us.size() && "size()"); } #include <cxxabi.h> string get_name(const type_info& id) { int stat; char* name = abi::__cxa_demangle(id.name(), 0, 0, &stat); assert(name != NULL && stat == 0); string res = string(name); free(name); return res; } template <typename T> void stress_test(int mx, int loop_time) { cerr << "type : " << get_name(typeid(T)) << ", "; cerr << "loop : " << loop_time << ", "; cerr << "max : " << mx << endl; HashSet<T> hs; set<T> us; vector<T> ord; if constexpr (is_integral<T>::value) { ord.resize(mx); iota(begin(ord), end(ord), mx); } else { set<T> s; while ((int)s.size() < mx) s.insert(T{rng() % mx, rng() % mx}); for (auto& x : s) ord.push_back(x); } mt19937_64 mt(rng()); // insert, erase for (int _ = 0; _ < loop_time; _++) { shuffle(begin(ord), end(ord), mt); for (auto& i : ord) { hs.insert(i); us.insert(i); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); } assert(hs.size() == mx && "insert(k)"); shuffle(begin(ord), end(ord), mt); for (auto& i : ord) { hs.erase(i); us.erase(i); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); } assert(hs.size() == 0 && "erase(k)"); } // insert, erase for (int _ = 0; _ < 20; _++) { double ratio = rng() * pow(2, -64); for (int t = 0; t < loop_time / 5 * mx; t++) { T i{}; if constexpr (is_integral<T>::value) { i = rng() % mx; } else { i = T{rng() % mx, rng() % mx}; } double th = rng() * pow(2, -64); if (th < ratio) { // if constexpr (is_integral<T>::value) cerr<<"insert "<<i<<endl; hs.insert(i); us.insert(i); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); } else { // if constexpr (is_integral<T>::value) cerr<<"erase "<<i<<endl; hs.erase(i); us.erase(i); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); } } } hs.clear(); us.clear(); // clear for (int _ = 0; _ < loop_time; _++) { shuffle(begin(ord), end(ord), mt); for (auto& i : ord) { hs.insert(i); us.insert(i); } same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); assert(hs.size() == mx && "clear()"); hs.clear(); us.clear(); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); assert(hs.size() == 0 && "clear()"); } // reserve for (int _ = 0; _ < loop_time; _++) { hs.reserve(mx); uint32_t pcap = hs.cap; shuffle(begin(ord), end(ord), mt); for (auto& i : ord) { hs.insert(i); us.insert(i); } same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); assert(hs.size() == mx && "reserve()"); assert(hs.cap == pcap && "reserve()"); hs.clear(); us.clear(); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); assert(hs.size() == 0 && "reserve()"); } } template <typename T> void unit_test() { stress_test<T>(1, 1000); stress_test<T>(2, 1000); stress_test<T>(4, 1000); stress_test<T>(8, 1000); stress_test<T>(16, 100); stress_test<T>(64, 10); stress_test<T>(256, 5); } } // namespace HashSetTest void Nyaan::solve() { HashSetTest::unit_test<int>(); HashSetTest::unit_test<int64_t>(); HashSetTest::unit_test<pair<int, int>>(); int64_t a, b; cin >> a >> b; cout << (a + b) << endl; }
#line 1 "verify/verify-unit-test/hashset.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/aplusb" #line 2 "template/template.hpp" using namespace std; // intrinstic #include <immintrin.h> #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <cctype> #include <cfenv> #include <cfloat> #include <chrono> #include <cinttypes> #include <climits> #include <cmath> #include <complex> #include <cstdarg> #include <cstddef> #include <cstdint> #include <cstdio> #include <cstdlib> #include <cstring> #include <deque> #include <fstream> #include <functional> #include <initializer_list> #include <iomanip> #include <ios> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <streambuf> #include <string> #include <tuple> #include <type_traits> #include <typeinfo> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> // utility #line 1 "template/util.hpp" namespace Nyaan { using ll = long long; using i64 = long long; using u64 = unsigned long long; using i128 = __int128_t; using u128 = __uint128_t; template <typename T> using V = vector<T>; template <typename T> using VV = vector<vector<T>>; using vi = vector<int>; using vl = vector<long long>; using vd = V<double>; using vs = V<string>; using vvi = vector<vector<int>>; using vvl = vector<vector<long long>>; template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>; template <typename T, typename U> struct P : pair<T, U> { template <typename... Args> P(Args... args) : pair<T, U>(args...) {} using pair<T, U>::first; using pair<T, U>::second; P &operator+=(const P &r) { first += r.first; second += r.second; return *this; } P &operator-=(const P &r) { first -= r.first; second -= r.second; return *this; } P &operator*=(const P &r) { first *= r.first; second *= r.second; return *this; } template <typename S> P &operator*=(const S &r) { first *= r, second *= r; return *this; } P operator+(const P &r) const { return P(*this) += r; } P operator-(const P &r) const { return P(*this) -= r; } P operator*(const P &r) const { return P(*this) *= r; } template <typename S> P operator*(const S &r) const { return P(*this) *= r; } P operator-() const { return P{-first, -second}; } }; using pl = P<ll, ll>; using pi = P<int, int>; using vp = V<pl>; constexpr int inf = 1001001001; constexpr long long infLL = 4004004004004004004LL; template <typename T> int sz(const T &t) { return t.size(); } template <typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template <typename T> inline T Max(const vector<T> &v) { return *max_element(begin(v), end(v)); } template <typename T> inline T Min(const vector<T> &v) { return *min_element(begin(v), end(v)); } template <typename T> inline long long Sum(const vector<T> &v) { return accumulate(begin(v), end(v), 0LL); } template <typename T> int lb(const vector<T> &v, const T &a) { return lower_bound(begin(v), end(v), a) - begin(v); } template <typename T> int ub(const vector<T> &v, const T &a) { return upper_bound(begin(v), end(v), a) - begin(v); } constexpr long long TEN(int n) { long long ret = 1, x = 10; for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1); return ret; } template <typename T, typename U> pair<T, U> mkp(const T &t, const U &u) { return make_pair(t, u); } template <typename T> vector<T> mkrui(const vector<T> &v, bool rev = false) { vector<T> ret(v.size() + 1); if (rev) { for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1]; } else { for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i]; } return ret; }; template <typename T> vector<T> mkuni(const vector<T> &v) { vector<T> ret(v); sort(ret.begin(), ret.end()); ret.erase(unique(ret.begin(), ret.end()), ret.end()); return ret; } template <typename F> vector<int> mkord(int N, F f) { vector<int> ord(N); iota(begin(ord), end(ord), 0); sort(begin(ord), end(ord), f); return ord; } template <typename T> vector<int> mkinv(vector<T> &v) { int max_val = *max_element(begin(v), end(v)); vector<int> inv(max_val + 1, -1); for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i; return inv; } vector<int> mkiota(int n) { vector<int> ret(n); iota(begin(ret), end(ret), 0); return ret; } template <typename T> T mkrev(const T &v) { T w{v}; reverse(begin(w), end(w)); return w; } template <typename T> bool nxp(T &v) { return next_permutation(begin(v), end(v)); } // 返り値の型は入力の T に依存 // i 要素目 : [0, a[i]) template <typename T> vector<vector<T>> product(const vector<T> &a) { vector<vector<T>> ret; vector<T> v; auto dfs = [&](auto rc, int i) -> void { if (i == (int)a.size()) { ret.push_back(v); return; } for (int j = 0; j < a[i]; j++) v.push_back(j), rc(rc, i + 1), v.pop_back(); }; dfs(dfs, 0); return ret; } // F : function(void(T&)), mod を取る操作 // T : 整数型のときはオーバーフローに注意する template <typename T> T Power(T a, long long n, const T &I, const function<void(T &)> &f) { T res = I; for (; n; f(a = a * a), n >>= 1) { if (n & 1) f(res = res * a); } return res; } // T : 整数型のときはオーバーフローに注意する template <typename T> T Power(T a, long long n, const T &I = T{1}) { return Power(a, n, I, function<void(T &)>{[](T &) -> void {}}); } template <typename T> T Rev(const T &v) { T res = v; reverse(begin(res), end(res)); return res; } template <typename T> vector<T> Transpose(const vector<T> &v) { using U = typename T::value_type; if(v.empty()) return {}; int H = v.size(), W = v[0].size(); vector res(W, T(H, U{})); for (int i = 0; i < H; i++) { for (int j = 0; j < W; j++) { res[j][i] = v[i][j]; } } return res; } template <typename T> vector<T> Rotate(const vector<T> &v, int clockwise = true) { using U = typename T::value_type; int H = v.size(), W = v[0].size(); vector res(W, T(H, U{})); for (int i = 0; i < H; i++) { for (int j = 0; j < W; j++) { if (clockwise) { res[W - 1 - j][i] = v[i][j]; } else { res[j][H - 1 - i] = v[i][j]; } } } return res; } } // namespace Nyaan #line 58 "template/template.hpp" // bit operation #line 1 "template/bitop.hpp" namespace Nyaan { __attribute__((target("popcnt"))) inline int popcnt(const u64 &a) { return __builtin_popcountll(a); } inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; } inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; } inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; } template <typename T> inline int gbit(const T &a, int i) { return (a >> i) & 1; } template <typename T> inline void sbit(T &a, int i, bool b) { if (gbit(a, i) != b) a ^= T(1) << i; } constexpr long long PW(int n) { return 1LL << n; } constexpr long long MSK(int n) { return (1LL << n) - 1; } } // namespace Nyaan #line 61 "template/template.hpp" // inout #line 1 "template/inout.hpp" namespace Nyaan { template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p) { is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; } istream &operator>>(istream &is, __int128_t &x) { string S; is >> S; x = 0; int flag = 0; for (auto &c : S) { if (c == '-') { flag = true; continue; } x *= 10; x += c - '0'; } if (flag) x = -x; return is; } istream &operator>>(istream &is, __uint128_t &x) { string S; is >> S; x = 0; for (auto &c : S) { x *= 10; x += c - '0'; } return is; } ostream &operator<<(ostream &os, __int128_t x) { if (x == 0) return os << 0; if (x < 0) os << '-', x = -x; string S; while (x) S.push_back('0' + x % 10), x /= 10; reverse(begin(S), end(S)); return os << S; } ostream &operator<<(ostream &os, __uint128_t x) { if (x == 0) return os << 0; string S; while (x) S.push_back('0' + x % 10), x /= 10; reverse(begin(S), end(S)); return os << S; } void in() {} template <typename T, class... U> void in(T &t, U &...u) { cin >> t; in(u...); } void out() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void out(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; out(u...); } struct IoSetupNya { IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetupnya; } // namespace Nyaan #line 64 "template/template.hpp" // debug #line 1 "template/debug.hpp" namespace DebugImpl { template <typename U, typename = void> struct is_specialize : false_type {}; template <typename U> struct is_specialize< U, typename conditional<false, typename U::iterator, void>::type> : true_type {}; template <typename U> struct is_specialize< U, typename conditional<false, decltype(U::first), void>::type> : true_type {}; template <typename U> struct is_specialize<U, enable_if_t<is_integral<U>::value, void>> : true_type { }; void dump(const char& t) { cerr << t; } void dump(const string& t) { cerr << t; } void dump(const bool& t) { cerr << (t ? "true" : "false"); } void dump(__int128_t t) { if (t == 0) cerr << 0; if (t < 0) cerr << '-', t = -t; string S; while (t) S.push_back('0' + t % 10), t /= 10; reverse(begin(S), end(S)); cerr << S; } void dump(__uint128_t t) { if (t == 0) cerr << 0; string S; while (t) S.push_back('0' + t % 10), t /= 10; reverse(begin(S), end(S)); cerr << S; } template <typename U, enable_if_t<!is_specialize<U>::value, nullptr_t> = nullptr> void dump(const U& t) { cerr << t; } template <typename T> void dump(const T& t, enable_if_t<is_integral<T>::value>* = nullptr) { string res; if (t == Nyaan::inf) res = "inf"; if constexpr (is_signed<T>::value) { if (t == -Nyaan::inf) res = "-inf"; } if constexpr (sizeof(T) == 8) { if (t == Nyaan::infLL) res = "inf"; if constexpr (is_signed<T>::value) { if (t == -Nyaan::infLL) res = "-inf"; } } if (res.empty()) res = to_string(t); cerr << res; } template <typename T, typename U> void dump(const pair<T, U>&); template <typename T> void dump(const pair<T*, int>&); template <typename T> void dump(const T& t, enable_if_t<!is_void<typename T::iterator>::value>* = nullptr) { cerr << "[ "; for (auto it = t.begin(); it != t.end();) { dump(*it); cerr << (++it == t.end() ? "" : ", "); } cerr << " ]"; } template <typename T, typename U> void dump(const pair<T, U>& t) { cerr << "( "; dump(t.first); cerr << ", "; dump(t.second); cerr << " )"; } template <typename T> void dump(const pair<T*, int>& t) { cerr << "[ "; for (int i = 0; i < t.second; i++) { dump(t.first[i]); cerr << (i == t.second - 1 ? "" : ", "); } cerr << " ]"; } void trace() { cerr << endl; } template <typename Head, typename... Tail> void trace(Head&& head, Tail&&... tail) { cerr << " "; dump(head); if (sizeof...(tail) != 0) cerr << ","; trace(std::forward<Tail>(tail)...); } } // namespace DebugImpl #ifdef NyaanDebug #define trc(...) \ do { \ cerr << "## " << #__VA_ARGS__ << " = "; \ DebugImpl::trace(__VA_ARGS__); \ } while (0) #else #define trc(...) (void(0)) #endif #ifdef NyaanLocal #define trc2(...) \ do { \ cerr << "## " << #__VA_ARGS__ << " = "; \ DebugImpl::trace(__VA_ARGS__); \ } while (0) #else #define trc2(...) (void(0)) #endif #line 67 "template/template.hpp" // macro #line 1 "template/macro.hpp" #define each(x, v) for (auto&& x : v) #define each2(x, y, v) for (auto&& [x, y] : v) #define all(v) (v).begin(), (v).end() #define rep(i, N) for (long long i = 0; i < (long long)(N); i++) #define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--) #define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++) #define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--) #define reg(i, a, b) for (long long i = (a); i < (b); i++) #define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--) #define fi first #define se second #define ini(...) \ int __VA_ARGS__; \ in(__VA_ARGS__) #define inl(...) \ long long __VA_ARGS__; \ in(__VA_ARGS__) #define ins(...) \ string __VA_ARGS__; \ in(__VA_ARGS__) #define in2(s, t) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i]); \ } #define in3(s, t, u) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i], u[i]); \ } #define in4(s, t, u, v) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i], u[i], v[i]); \ } #define die(...) \ do { \ Nyaan::out(__VA_ARGS__); \ return; \ } while (0) #line 70 "template/template.hpp" namespace Nyaan { void solve(); } int main() { Nyaan::solve(); } #line 4 "verify/verify-unit-test/hashset.test.cpp" // #line 2 "hashmap/hashset.hpp" #line 2 "hashmap/hashmap-base.hpp" #line 4 "hashmap/hashmap-base.hpp" using namespace std; namespace HashMapImpl { using u32 = uint32_t; using u64 = uint64_t; template <typename Key, typename Data> struct HashMapBase; template <typename Key, typename Data> struct itrB : iterator<bidirectional_iterator_tag, Data, ptrdiff_t, Data*, Data&> { using base = iterator<bidirectional_iterator_tag, Data, ptrdiff_t, Data*, Data&>; using ptr = typename base::pointer; using ref = typename base::reference; u32 i; HashMapBase<Key, Data>* p; explicit constexpr itrB() : i(0), p(nullptr) {} explicit constexpr itrB(u32 _i, HashMapBase<Key, Data>* _p) : i(_i), p(_p) {} explicit constexpr itrB(u32 _i, const HashMapBase<Key, Data>* _p) : i(_i), p(const_cast<HashMapBase<Key, Data>*>(_p)) {} friend void swap(itrB& l, itrB& r) { swap(l.i, r.i), swap(l.p, r.p); } friend bool operator==(const itrB& l, const itrB& r) { return l.i == r.i; } friend bool operator!=(const itrB& l, const itrB& r) { return l.i != r.i; } const ref operator*() const { return const_cast<const HashMapBase<Key, Data>*>(p)->data[i]; } ref operator*() { return p->data[i]; } ptr operator->() const { return &(p->data[i]); } itrB& operator++() { assert(i != p->cap && "itr::operator++()"); do { i++; if (i == p->cap) break; if (p->occupied_flag[i] && !p->deleted_flag[i]) break; } while (true); return (*this); } itrB operator++(int) { itrB it(*this); ++(*this); return it; } itrB& operator--() { do { i--; if (p->occupied_flag[i] && !p->deleted_flag[i]) break; assert(i != 0 && "itr::operator--()"); } while (true); return (*this); } itrB operator--(int) { itrB it(*this); --(*this); return it; } }; template <typename Key, typename Data> struct HashMapBase { using u32 = uint32_t; using u64 = uint64_t; using iterator = itrB<Key, Data>; using itr = iterator; protected: template <typename K> inline u64 randomized(const K& key) const { return u64(key) ^ r; } template <typename K, enable_if_t<is_same<K, Key>::value, nullptr_t> = nullptr, enable_if_t<is_integral<K>::value, nullptr_t> = nullptr> inline u32 inner_hash(const K& key) const { return (randomized(key) * 11995408973635179863ULL) >> shift; } template < typename K, enable_if_t<is_same<K, Key>::value, nullptr_t> = nullptr, enable_if_t<is_integral<decltype(K::first)>::value, nullptr_t> = nullptr, enable_if_t<is_integral<decltype(K::second)>::value, nullptr_t> = nullptr> inline u32 inner_hash(const K& key) const { u64 a = randomized(key.first), b = randomized(key.second); a *= 11995408973635179863ULL; b *= 10150724397891781847ULL; return (a + b) >> shift; } template <typename K, enable_if_t<is_same<K, Key>::value, nullptr_t> = nullptr, enable_if_t<is_integral<typename K::value_type>::value, nullptr_t> = nullptr> inline u32 inner_hash(const K& key) const { static constexpr u64 mod = (1LL << 61) - 1; static constexpr u64 base = 950699498548472943ULL; u64 res = 0; for (auto& elem : key) { __uint128_t x = __uint128_t(res) * base + (randomized(elem) & mod); res = (x & mod) + (x >> 61); } __uint128_t x = __uint128_t(res) * base; res = (x & mod) + (x >> 61); if (res >= mod) res -= mod; return res >> (shift - 3); } template <typename D = Data, enable_if_t<is_same<D, Key>::value, nullptr_t> = nullptr> inline u32 hash(const D& dat) const { return inner_hash(dat); } template < typename D = Data, enable_if_t<is_same<decltype(D::first), Key>::value, nullptr_t> = nullptr> inline u32 hash(const D& dat) const { return inner_hash(dat.first); } template <typename D = Data, enable_if_t<is_same<D, Key>::value, nullptr_t> = nullptr> inline Key data_to_key(const D& dat) const { return dat; } template < typename D = Data, enable_if_t<is_same<decltype(D::first), Key>::value, nullptr_t> = nullptr> inline Key data_to_key(const D& dat) const { return dat.first; } void reallocate(u32 ncap) { vector<Data> ndata(ncap); vector<bool> nf(ncap); shift = 64 - __lg(ncap); for (u32 i = 0; i < cap; i++) { if (occupied_flag[i] && !deleted_flag[i]) { u32 h = hash(data[i]); while (nf[h]) h = (h + 1) & (ncap - 1); ndata[h] = move(data[i]); nf[h] = true; } } data.swap(ndata); occupied_flag.swap(nf); cap = ncap; occupied = s; deleted_flag.resize(cap); fill(std::begin(deleted_flag), std::end(deleted_flag), false); } inline bool extend_rate(u32 x) const { return x * 2 >= cap; } inline bool shrink_rate(u32 x) const { return HASHMAP_DEFAULT_SIZE < cap && x * 10 <= cap; } inline void extend() { reallocate(cap << 1); } inline void shrink() { reallocate(cap >> 1); } public: u32 cap, s, occupied; vector<Data> data; vector<bool> occupied_flag, deleted_flag; u32 shift; static u64 r; static constexpr uint32_t HASHMAP_DEFAULT_SIZE = 4; explicit HashMapBase() : cap(HASHMAP_DEFAULT_SIZE), s(0), occupied(0), data(cap), occupied_flag(cap), deleted_flag(cap), shift(64 - __lg(cap)) {} itr begin() const { u32 h = 0; while (h != cap) { if (occupied_flag[h] && !deleted_flag[h]) break; h++; } return itr(h, this); } itr end() const { return itr(this->cap, this); } friend itr begin(const HashMapBase& h) { return h.begin(); } friend itr end(const HashMapBase& h) { return h.end(); } itr find(const Key& key) const { u32 h = inner_hash(key); while (true) { if (occupied_flag[h] == false) return this->end(); if (data_to_key(data[h]) == key) { if (deleted_flag[h] == true) return this->end(); return itr(h, this); } h = (h + 1) & (cap - 1); } } bool contain(const Key& key) const { return find(key) != this->end(); } itr insert(const Data& d) { u32 h = hash(d); while (true) { if (occupied_flag[h] == false) { if (extend_rate(occupied + 1)) { extend(); h = hash(d); continue; } data[h] = d; occupied_flag[h] = true; ++occupied, ++s; return itr(h, this); } if (data_to_key(data[h]) == data_to_key(d)) { if (deleted_flag[h] == true) { data[h] = d; deleted_flag[h] = false; ++s; } return itr(h, this); } h = (h + 1) & (cap - 1); } } // tips for speed up : // if return value is unnecessary, make argument_2 false. itr erase(itr it, bool get_next = true) { if (it == this->end()) return this->end(); s--; if (!get_next) { this->deleted_flag[it.i] = true; if (shrink_rate(s)) shrink(); return this->end(); } itr nxt = it; nxt++; this->deleted_flag[it.i] = true; if (shrink_rate(s)) { Data d = data[nxt.i]; shrink(); it = find(data_to_key(d)); } return nxt; } itr erase(const Key& key) { return erase(find(key)); } int count(const Key& key) { return find(key) == end() ? 0 : 1; } bool empty() const { return s == 0; } int size() const { return s; } void clear() { fill(std::begin(occupied_flag), std::end(occupied_flag), false); fill(std::begin(deleted_flag), std::end(deleted_flag), false); s = occupied = 0; } void reserve(int n) { if (n <= 0) return; n = 1 << min(23, __lg(n) + 2); if (cap < u32(n)) reallocate(n); } }; template <typename Key, typename Data> uint64_t HashMapBase<Key, Data>::r = chrono::duration_cast<chrono::nanoseconds>( chrono::high_resolution_clock::now().time_since_epoch()) .count(); } // namespace HashMapImpl /** * @brief Hash Map(base) (ハッシュマップ・基底クラス) */ #line 4 "hashmap/hashset.hpp" template <typename Key> struct HashSet : HashMapImpl::HashMapBase<Key, Key> { using HashMapImpl::HashMapBase<Key, Key>::HashMapBase; }; /* * @brief ハッシュセット(集合) * @docs docs/hashmap/hashset.md **/ #line 6 "verify/verify-unit-test/hashset.test.cpp" uint64_t rng() { static uint64_t x_ = 10150724397891781847ULL; return x_ ^= (x_ << 7), x_ ^= (x_ >> 9); } // [l, r) int64_t randint(int64_t l, int64_t r) { assert(l < r); return l + rng() % (r - l); } namespace HashSetTest { template <typename HS, typename Data_t> void same_set(HS& hs, set<Data_t>& us, int mx) { assert(mx > 0); // iterator { set<Data_t> buf; for (auto& x : hs) buf.insert(x); assert(buf == us && "The range-based for statement"); } // itr::operator++(), itr::operator++(int) { set<Data_t> buf; for (auto it = hs.begin(); it != hs.end();) { buf.insert(*it); auto oit = it; assert(oit == it++ && "itr::operator++(int)"); ++oit; assert(oit == it && "itr::operator++()"); } assert(buf == us && "itr::operator++()"); } // itr::operator--(), itr::operator--(int) { set<Data_t> buf; for (auto it = hs.end(); it != hs.begin();) { auto oit = it; assert(oit == it-- && "itr::operator--(int)"); --oit; assert(oit == it && "itr::operator--()"); buf.insert(*it); } assert(buf == us && "itr::operator--()"); } // begin(*this), end(*this) assert(begin(hs) == hs.begin() && "begin(*this)"); assert(end(hs) == hs.end() && "end(*this)"); // ensure empty space in hash table { uint32_t s = 0; for (uint32_t i = 0; i < hs.cap; ++i) s += hs.occupied_flag[i]; assert(s != hs.cap && "hash table is full!"); } // find, contain if constexpr (is_integral<Data_t>::value) { for (Data_t k = 0; k < mx; ++k) { auto flg1 = hs.find(k) != hs.end(); auto flg2 = us.find(k) != us.end(); auto flg3 = hs.contain(k); assert(flg1 == flg2 && "find(k)"); assert(flg1 == flg3 && "contain(k)"); } } else { for (int t = 0; t < 2 * mx; ++t) { Data_t k{rng() % mx, rng() % mx}; auto flg1 = hs.find(k) != hs.end(); auto flg2 = us.find(k) != us.end(); auto flg3 = hs.contain(k); assert(flg1 == flg2 && "find(k)"); assert(flg1 == flg3 && "contain(k)"); } } // empty assert(hs.empty() == us.empty() && "empty()"); // size assert(hs.size() == (int)us.size() && "size()"); } #include <cxxabi.h> string get_name(const type_info& id) { int stat; char* name = abi::__cxa_demangle(id.name(), 0, 0, &stat); assert(name != NULL && stat == 0); string res = string(name); free(name); return res; } template <typename T> void stress_test(int mx, int loop_time) { cerr << "type : " << get_name(typeid(T)) << ", "; cerr << "loop : " << loop_time << ", "; cerr << "max : " << mx << endl; HashSet<T> hs; set<T> us; vector<T> ord; if constexpr (is_integral<T>::value) { ord.resize(mx); iota(begin(ord), end(ord), mx); } else { set<T> s; while ((int)s.size() < mx) s.insert(T{rng() % mx, rng() % mx}); for (auto& x : s) ord.push_back(x); } mt19937_64 mt(rng()); // insert, erase for (int _ = 0; _ < loop_time; _++) { shuffle(begin(ord), end(ord), mt); for (auto& i : ord) { hs.insert(i); us.insert(i); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); } assert(hs.size() == mx && "insert(k)"); shuffle(begin(ord), end(ord), mt); for (auto& i : ord) { hs.erase(i); us.erase(i); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); } assert(hs.size() == 0 && "erase(k)"); } // insert, erase for (int _ = 0; _ < 20; _++) { double ratio = rng() * pow(2, -64); for (int t = 0; t < loop_time / 5 * mx; t++) { T i{}; if constexpr (is_integral<T>::value) { i = rng() % mx; } else { i = T{rng() % mx, rng() % mx}; } double th = rng() * pow(2, -64); if (th < ratio) { // if constexpr (is_integral<T>::value) cerr<<"insert "<<i<<endl; hs.insert(i); us.insert(i); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); } else { // if constexpr (is_integral<T>::value) cerr<<"erase "<<i<<endl; hs.erase(i); us.erase(i); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); } } } hs.clear(); us.clear(); // clear for (int _ = 0; _ < loop_time; _++) { shuffle(begin(ord), end(ord), mt); for (auto& i : ord) { hs.insert(i); us.insert(i); } same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); assert(hs.size() == mx && "clear()"); hs.clear(); us.clear(); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); assert(hs.size() == 0 && "clear()"); } // reserve for (int _ = 0; _ < loop_time; _++) { hs.reserve(mx); uint32_t pcap = hs.cap; shuffle(begin(ord), end(ord), mt); for (auto& i : ord) { hs.insert(i); us.insert(i); } same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); assert(hs.size() == mx && "reserve()"); assert(hs.cap == pcap && "reserve()"); hs.clear(); us.clear(); same_set<HashSet<T>, T>(hs, us, mx); same_set<const HashSet<T>, T>(hs, us, mx); assert(hs.size() == 0 && "reserve()"); } } template <typename T> void unit_test() { stress_test<T>(1, 1000); stress_test<T>(2, 1000); stress_test<T>(4, 1000); stress_test<T>(8, 1000); stress_test<T>(16, 100); stress_test<T>(64, 10); stress_test<T>(256, 5); } } // namespace HashSetTest void Nyaan::solve() { HashSetTest::unit_test<int>(); HashSetTest::unit_test<int64_t>(); HashSetTest::unit_test<pair<int, int>>(); int64_t a, b; cin >> a >> b; cout << (a + b) << endl; }