Tifa's CP Library

:heavy_check_mark: debruijn (src/code/util/debruijn.hpp)

Depends on

Verified with

Code

#ifndef TIFALIBS_UTIL_DEBRUIJN
#define TIFALIBS_UTIL_DEBRUIJN

#include "util.hpp"

namespace tifa_libs::util {

// Given alphabet $[0,k)$ constructs a cyclic string of length $k^n$ that contains every length $n$ string as substr
CEXP vecu deBruijn(u32 n, u32 k, u32 maxsz = 0) {
  if (k == 1) return {0};
  if (!maxsz) {
    maxsz = 1;
    flt_ (u32, i, 0, n) maxsz *= k;
  }
  vecu ret, _(n + 1);
  auto f = [&](auto&& f, u32 t, u32 p) -> void {
    if (ret.size() >= maxsz) return;
    if (t > n) {
      if (!(n % p))
        fle_ (u32, i, 1, p) ret.push_back(_[i]);
      if (ret.size() >= maxsz) return;
    } else {
      _[t] = _[t - p];
      if (ret.size() >= maxsz) return;
      f(f, t + 1, p);
      while (++_[t] < k) {
        if (ret.size() >= maxsz) return;
        f(f, t + 1, t);
      }
    }
  };
  f(f, 1, 1);
  ret.resize(maxsz);
  return ret;
}

}  // namespace tifa_libs::util

#endif
#line 1 "src/code/util/debruijn.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

#define CEXP constexpr
#define TPN typename
#define CR const&

#define cT_(...) std::conditional_t<sizeof(__VA_ARGS__) <= sizeof(size_t), __VA_ARGS__, __VA_ARGS__ CR>
#define fle_(T, i, l, r, ...) for (T i = (l), i##e = (r)__VA_OPT__(, ) __VA_ARGS__; i <= i##e; ++i)
#define flt_(T, i, l, r, ...) for (T i = (l), i##e = (r)__VA_OPT__(, ) __VA_ARGS__; i < i##e; ++i)

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
template <class U, class T>
using vecp = vec<std::pair<U, T>>;
template <class U, class T>
using vvecp = vvec<std::pair<U, T>>;
template <class T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

using namespace std::literals;

CEXP i8 operator""_i8(unsigned long long x) { return (i8)x; }
CEXP i16 operator""_i16(unsigned long long x) { return (i16)x; }
CEXP i32 operator""_i32(unsigned long long x) { return (i32)x; }
CEXP i64 operator""_i64(unsigned long long x) { return (i64)x; }
CEXP isz operator""_iz(unsigned long long x) { return (isz)x; }

CEXP u8 operator""_u8(unsigned long long x) { return (u8)x; }
CEXP u16 operator""_u16(unsigned long long x) { return (u16)x; }
CEXP u32 operator""_u32(unsigned long long x) { return (u32)x; }
CEXP u64 operator""_u64(unsigned long long x) { return (u64)x; }
CEXP usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};
inline const auto fn_is0 = [](auto x) { return x == 0; };

// std::sqrt(std::numeric_limits<FP>::epsilon())
template <std::floating_point FP>
CEXP inline FP eps_v = FP(1e-8L);
using std::numbers::pi_v;

namespace tifa_libs {
using std::min, std::max, std::swap;
template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }
}  // namespace tifa_libs


#line 5 "src/code/util/debruijn.hpp"

namespace tifa_libs::util {

// Given alphabet $[0,k)$ constructs a cyclic string of length $k^n$ that contains every length $n$ string as substr
CEXP vecu deBruijn(u32 n, u32 k, u32 maxsz = 0) {
  if (k == 1) return {0};
  if (!maxsz) {
    maxsz = 1;
    flt_ (u32, i, 0, n) maxsz *= k;
  }
  vecu ret, _(n + 1);
  auto f = [&](auto&& f, u32 t, u32 p) -> void {
    if (ret.size() >= maxsz) return;
    if (t > n) {
      if (!(n % p))
        fle_ (u32, i, 1, p) ret.push_back(_[i]);
      if (ret.size() >= maxsz) return;
    } else {
      _[t] = _[t - p];
      if (ret.size() >= maxsz) return;
      f(f, t + 1, p);
      while (++_[t] < k) {
        if (ret.size() >= maxsz) return;
        f(f, t + 1, t);
      }
    }
  };
  f(f, 1, 1);
  ret.resize(maxsz);
  return ret;
}

}  // namespace tifa_libs::util


Back to top page