This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub noshi91/Library
#include "other/int_alias.cpp" #include "other/popcount.cpp" #include "other/select64.cpp" #include <cstddef> #include <limits> #include <vector> class bit_vector { static constexpr usize wordsize = std::numeric_limits<usize>::digits; class node_type { public: usize bit; usize sum; node_type() : bit(0), sum(0) {} }; std::vector<node_type> v; public: bit_vector() = default; explicit bit_vector(const std::vector<bool> a) : v(a.size() / wordsize + 1) { { const usize s = a.size(); for (usize i = 0; i != s; i += 1) v[i / wordsize].bit |= static_cast<usize>(a[i] ? 1 : 0) << i % wordsize; } { const usize s = v.size(); for (usize i = 1; i != s; i += 1) v[i].sum = v[i - 1].sum + popcount(v[i - 1].bit); } } usize rank0(const usize index) const { return index - rank1(index); } usize rank1(const usize index) const { return v[index / wordsize].sum + popcount(v[index / wordsize].bit & ~(~static_cast<usize>(0) << index % wordsize)); } usize select0(const usize k) const { usize l = 0; usize r = v.size(); while (l != r) { const usize m = (l + r) / 2; if (m * wordsize - v[m].sum <= k) l = m + 1; else r = m; } const usize i = l - 1; return i * wordsize + select64(~v[i].bit, k - (i * wordsize - v[i].sum)); } usize select1(const usize k) const { usize l = 0; usize r = v.size(); while (l != r) { const usize m = (l + r) / 2; if (v[m].sum <= k) l = m + 1; else r = m; } const usize i = l - 1; return i * wordsize + select64(v[i].bit, k - v[i].sum); } }; /** * @brief Bit Vector */
#line 2 "other/int_alias.cpp" #include <cstddef> #include <cstdint> using i32 = std::int32_t; using i64 = std::int64_t; using u32 = std::uint32_t; using u64 = std::uint64_t; using isize = std::ptrdiff_t; using usize = std::size_t; #line 2 "other/popcount.cpp" #line 4 "other/popcount.cpp" usize popcount(u64 x) { #ifdef __GNUC__ return __builtin_popcountll(x); #else x -= x >> 1 & 0x5555555555555555; x = (x & 0x3333333333333333) + (x >> 2 & 0x3333333333333333); x = x + (x >> 4) & 0x0F0F0F0F0F0F0F0F; return x * 0x0101010101010101 >> 56 & 0x7f; #endif } #line 2 "other/select64.cpp" #line 5 "other/select64.cpp" usize select64(const u64 x0, usize k) { const u64 x1 = (x0 & 0x5555555555555555) + (x0 >> 1 & 0x5555555555555555); const u64 x2 = (x1 & 0x3333333333333333) + (x1 >> 2 & 0x3333333333333333); const u64 x3 = (x2 & 0x0F0F0F0F0F0F0F0F) + (x2 >> 4 & 0x0F0F0F0F0F0F0F0F); const u64 x4 = (x3 & 0x00FF00FF00FF00FF) + (x3 >> 8 & 0x00FF00FF00FF00FF); const u64 x5 = (x4 & 0x0000FFFF0000FFFF) + (x4 >> 16 & 0x0000FFFF0000FFFF); usize ret = 0; usize t; t = x5 >> ret & 0xFFFFFFFF; if (t <= k) { k -= t; ret += 32; } t = x4 >> ret & 0xFFFF; if (t <= k) { k -= t; ret += 16; } t = x3 >> ret & 0xFF; if (t <= k) { k -= t; ret += 8; } t = x2 >> ret & 0xF; if (t <= k) { k -= t; ret += 4; } t = x1 >> ret & 0x3; if (t <= k) { k -= t; ret += 2; } t = x0 >> ret & 0x1; if (t <= k) { k -= t; ret += 1; } return ret; } #line 4 "data_structure/bit_vector.cpp" #line 6 "data_structure/bit_vector.cpp" #include <limits> #include <vector> class bit_vector { static constexpr usize wordsize = std::numeric_limits<usize>::digits; class node_type { public: usize bit; usize sum; node_type() : bit(0), sum(0) {} }; std::vector<node_type> v; public: bit_vector() = default; explicit bit_vector(const std::vector<bool> a) : v(a.size() / wordsize + 1) { { const usize s = a.size(); for (usize i = 0; i != s; i += 1) v[i / wordsize].bit |= static_cast<usize>(a[i] ? 1 : 0) << i % wordsize; } { const usize s = v.size(); for (usize i = 1; i != s; i += 1) v[i].sum = v[i - 1].sum + popcount(v[i - 1].bit); } } usize rank0(const usize index) const { return index - rank1(index); } usize rank1(const usize index) const { return v[index / wordsize].sum + popcount(v[index / wordsize].bit & ~(~static_cast<usize>(0) << index % wordsize)); } usize select0(const usize k) const { usize l = 0; usize r = v.size(); while (l != r) { const usize m = (l + r) / 2; if (m * wordsize - v[m].sum <= k) l = m + 1; else r = m; } const usize i = l - 1; return i * wordsize + select64(~v[i].bit, k - (i * wordsize - v[i].sum)); } usize select1(const usize k) const { usize l = 0; usize r = v.size(); while (l != r) { const usize m = (l + r) / 2; if (v[m].sum <= k) l = m + 1; else r = m; } const usize i = l - 1; return i * wordsize + select64(v[i].bit, k - v[i].sum); } }; /** * @brief Bit Vector */