cpp-library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub shino16/cpp-library

:heavy_check_mark: ds/bit_vector.hpp

Depends on

Required by

Verified with

Code

#pragma once
#include "bit/popcnt.hpp"
#include "prelude.hpp"

class bit_vector {
 public:
  bit_vector(int n = 0) : bit(n / 8 + 1), sum(n / 8 + 2) {}
  template <class It>
  bit_vector(It a, It last) : bit_vector(last - a) {
    int n = last - a;
    rep(i, n) bit[i / 64] |= uint64_t(a[i] != 0) << (i % 64);
    rep(i, bit.size()) sum[i + 1] = sum[i] + popcnt(bit[i]);
  }
  int size() const { return bit.size() * 64; }
  bool operator[](int i) const { return bit[i / 64] >> (i % 64) & 1; }
  int rank0(int r) const { return r - rank1(r); }
  int rank0(int l, int r) const { return rank0(r) - rank0(l); }
  int rank1(int r) const {
    return sum[r / 64] + popcnt(bit[r / 64] & ~(~uint64_t(0) << (r % 64)));
  }
  int rank1(int l, int r) const { return rank1(r) - rank1(l); }
  int rank(bool b, int r) const { return b ? rank1(r) : rank0(r); }
  int rank(bool b, int l, int r) const { return b ? rank1(l, r) : rank0(l, r); }
  int select0(int l, int k) const {
    int r = bit.size() * 8;
    while (l + 1 < r) {
      int m = (l + r) / 2;
      (rank0(m) <= k ? l : r) = m;
    }
    return l;
  }
  int select0(int k) const { return select0(0, k); }
  int select1(int l, int k) const {
    int r = bit.size() * 8;
    while (l + 1 < r) {
      int m = (l + r) / 2;
      (rank1(m) <= k ? l : r) = m;
    }
    return l;
  }
  int select1(int k) const { return select1(0, k); }
  int select(bool v, int k) const { return v ? select1(k) : select0(k); }
  int select(bool v, int l, int k) const {
    return v ? select1(l, k) : select0(l, k);
  }

 private:
  vector<uint64_t> bit;
  vector<int> sum;
};

#line 2 "prelude.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vc = vector<char>;
#define rep2(i, m, n) for (auto i = (m); i < (n); i++)
#define rep(i, n) rep2(i, 0, n)
#define repr2(i, m, n) for (auto i = (n); i-- > (m);)
#define repr(i, n) repr2(i, 0, n)
#define all(x) begin(x), end(x)
auto ndvec(int n, auto e) { return vector(n, e); }
auto ndvec(int n, auto ...e) { return vector(n, ndvec(e...)); }
auto comp_key(auto&& f) { return [&](auto&& a, auto&& b) { return f(a) < f(b); }; }
auto& max(const auto& a, const auto& b) { return a < b ? b : a; }
auto& min(const auto& a, const auto& b) { return b < a ? b : a; }
#if __cpp_lib_ranges
namespace R = std::ranges;
namespace V = std::views;
#endif
#line 3 "bit/popcnt.hpp"

#pragma GCC target("popcnt")

template <class T>
int popcnt(T a) {
  if constexpr (sizeof(T) <= sizeof(unsigned)) {
    return __builtin_popcount((unsigned)a);
  } else if constexpr (sizeof(T) <= sizeof(unsigned long long)) {
    return __builtin_popcountll((unsigned long long)a);
  } else if constexpr (sizeof(T) <= sizeof(unsigned long long) * 2) {
    return popcnt((unsigned long long)a) +
           popcnt((unsigned long long)(a >> sizeof(unsigned long long) * 8));
  }
}
#line 4 "ds/bit_vector.hpp"

class bit_vector {
 public:
  bit_vector(int n = 0) : bit(n / 8 + 1), sum(n / 8 + 2) {}
  template <class It>
  bit_vector(It a, It last) : bit_vector(last - a) {
    int n = last - a;
    rep(i, n) bit[i / 64] |= uint64_t(a[i] != 0) << (i % 64);
    rep(i, bit.size()) sum[i + 1] = sum[i] + popcnt(bit[i]);
  }
  int size() const { return bit.size() * 64; }
  bool operator[](int i) const { return bit[i / 64] >> (i % 64) & 1; }
  int rank0(int r) const { return r - rank1(r); }
  int rank0(int l, int r) const { return rank0(r) - rank0(l); }
  int rank1(int r) const {
    return sum[r / 64] + popcnt(bit[r / 64] & ~(~uint64_t(0) << (r % 64)));
  }
  int rank1(int l, int r) const { return rank1(r) - rank1(l); }
  int rank(bool b, int r) const { return b ? rank1(r) : rank0(r); }
  int rank(bool b, int l, int r) const { return b ? rank1(l, r) : rank0(l, r); }
  int select0(int l, int k) const {
    int r = bit.size() * 8;
    while (l + 1 < r) {
      int m = (l + r) / 2;
      (rank0(m) <= k ? l : r) = m;
    }
    return l;
  }
  int select0(int k) const { return select0(0, k); }
  int select1(int l, int k) const {
    int r = bit.size() * 8;
    while (l + 1 < r) {
      int m = (l + r) / 2;
      (rank1(m) <= k ? l : r) = m;
    }
    return l;
  }
  int select1(int k) const { return select1(0, k); }
  int select(bool v, int k) const { return v ? select1(k) : select0(k); }
  int select(bool v, int l, int k) const {
    return v ? select1(l, k) : select0(l, k);
  }

 private:
  vector<uint64_t> bit;
  vector<int> sum;
};
Back to top page