Tifa's CP Library

:warning: aho_corasick_automaton (src/code/str/aho_corasick_automaton.hpp)

Depends on

Code

#ifndef TIFALIBS_STR_AHO_CORASICK_AUTOMATON
#define TIFALIBS_STR_AHO_CORASICK_AUTOMATON

#include "../util/util.hpp"

namespace tifa_libs::str {

template <u32 SZ = 26, u32 BASE = u32('a')>
class aho_corasick_automaton {
  // super root is 0
  struct YYZ {
    arr<u32, SZ> nex{};
    u32 fail, tot;
    vecu end;
  };

 public:
  vec<YYZ> t;
  u32 sz;

  explicit constexpr aho_corasick_automaton() : t(1), sz(1) {}

  constexpr void insert(strnv s, u32 id = -1u) {
    u32 u = 0;
    ++t[u].tot;
    for (auto c : s) {
      u32 a = u32(c) - BASE;
      if (!t[u].nex[a]) t[u].nex[a] = sz++, t.push_back(YYZ());
      u = t[u].nex[a], ++t[u].tot;
    }
    if (~id) t[u].end.push_back(id);
  }
  void getfail() {
    std::queue<u32> q;
    for (u32 i = 0; i < SZ; ++i)
      if (t[0].nex[i]) q.push(t[0].nex[i]);
    while (!q.empty()) {
      u32 u = q.front();
      q.pop();
      for (u32 i = 0; i < SZ; ++i) {
        if (t[u].nex[i]) t[t[u].nex[i]].fail = t[t[u].fail].nex[i], q.push(t[u].nex[i]);
        else t[u].nex[i] = t[t[u].fail].nex[i];
      }
    }
  }
  constexpr void build(vec<strn> const& s_) {
    for (u32 i = 0; i < s_.size(); ++i) insert(s_[i], i);
    getfail();
  }
};
}  // namespace tifa_libs::str

#endif
#line 1 "src/code/str/aho_corasick_automaton.hpp"



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



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

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>;

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

using namespace std::literals;

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

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr 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; };


#line 5 "src/code/str/aho_corasick_automaton.hpp"

namespace tifa_libs::str {

template <u32 SZ = 26, u32 BASE = u32('a')>
class aho_corasick_automaton {
  // super root is 0
  struct YYZ {
    arr<u32, SZ> nex{};
    u32 fail, tot;
    vecu end;
  };

 public:
  vec<YYZ> t;
  u32 sz;

  explicit constexpr aho_corasick_automaton() : t(1), sz(1) {}

  constexpr void insert(strnv s, u32 id = -1u) {
    u32 u = 0;
    ++t[u].tot;
    for (auto c : s) {
      u32 a = u32(c) - BASE;
      if (!t[u].nex[a]) t[u].nex[a] = sz++, t.push_back(YYZ());
      u = t[u].nex[a], ++t[u].tot;
    }
    if (~id) t[u].end.push_back(id);
  }
  void getfail() {
    std::queue<u32> q;
    for (u32 i = 0; i < SZ; ++i)
      if (t[0].nex[i]) q.push(t[0].nex[i]);
    while (!q.empty()) {
      u32 u = q.front();
      q.pop();
      for (u32 i = 0; i < SZ; ++i) {
        if (t[u].nex[i]) t[t[u].nex[i]].fail = t[t[u].fail].nex[i], q.push(t[u].nex[i]);
        else t[u].nex[i] = t[t[u].fail].nex[i];
      }
    }
  }
  constexpr void build(vec<strn> const& s_) {
    for (u32 i = 0; i < s_.size(); ++i) insert(s_[i], i);
    getfail();
  }
};
}  // namespace tifa_libs::str


Back to top page