Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/library-checker/enumerate_palindromes.hashstr2-ds.test.cpp

Depends on

Code

#define AUTO_GENERATED
#define PROBLEM "https://judge.yosupo.jp/problem/enumerate_palindromes"

#include "../../code/util/util.hpp"
//
constexpr u32 MOD0 = 998244353;
constexpr u32 MOD1 = 1000000007;

#include "../../code/math/mint_ds.hpp"
#include "../../code/str/hash_substr2.hpp"

using mint0 = tifa_libs::math::mint_ds<-1>;
using mint1 = tifa_libs::math::mint_ds<-2>;
using hashstr = tifa_libs::str::hash_substr2<mint0, mint1>;

int main() {
  mint0::set_mod(MOD0);
  mint1::set_mod(MOD1);
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  strn s;
  std::cin >> s;
  {
    strn x;
    x.reserve(s.size() * 2 + 1);
    x.push_back('$');
    for (char c : s) x.push_back(c), x.push_back('$');
    s.swap(x);
  }
  strn t = s;
  std::ranges::reverse(t);
  hashstr hs, ht;
  hs.set(s), ht.set(t);
  u32 n = (u32)s.size();
  vecu ans(n);
  for (u32 i = 0; i < n; ++i) {
    u32 l = 0, r = std::min(i, n - 1 - i) + 1;
    while (l + 1 < r) {
      u32 m = (l + r) / 2, l_ = i - m, r_ = i + m;
      (hs.get(l_, r_ + 1 - l_) == ht.get(n - 1 - r_, r_ + 1 - l_) ? l : r) = m;
    }
    ans[i] = l;
  }
  for (u32 i = 1; i < n - 1; ++i) std::cout << ans[i] << " \n"[i + 2 == n];
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/enumerate_palindromes.hashstr2-ds.test.cpp"
#define AUTO_GENERATED
#define PROBLEM "https://judge.yosupo.jp/problem/enumerate_palindromes"

#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&&...) {};


#line 5 "src/test_cpverifier/library-checker/enumerate_palindromes.hashstr2-ds.test.cpp"
//
constexpr u32 MOD0 = 998244353;
constexpr u32 MOD1 = 1000000007;

#line 1 "src/code/math/mint_ds.hpp"



#line 1 "src/code/math/mint.hpp"



#line 1 "src/code/nt/inverse.hpp"



#line 1 "src/code/nt/inv_gcd.hpp"



#line 1 "src/code/math/safe_mod.hpp"



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



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

namespace tifa_libs {

template <class T>
concept iterable_c = requires(T v) {
  { v.begin() } -> std::same_as<typename T::iterator>;
  { v.end() } -> std::same_as<typename T::iterator>;
};

template <class T>
concept container_c = iterable_c<T> && !std::derived_from<T, std::basic_string<typename T::value_type>>;

template <class T>
constexpr bool is_char_v = std::is_same_v<T, char> || std::is_same_v<T, signed char> || std::is_same_v<T, unsigned char>;
template <class T>
concept char_c = is_char_v<T>;

template <class T>
constexpr bool is_s128_v = std::is_same_v<T, __int128_t> || std::is_same_v<T, __int128>;
template <class T>
concept s128_c = is_s128_v<T>;

template <class T>
constexpr bool is_u128_v = std::is_same_v<T, __uint128_t> || std::is_same_v<T, unsigned __int128>;
template <class T>
concept u128_c = is_u128_v<T>;

template <class T>
constexpr bool is_i128_v = is_s128_v<T> || is_u128_v<T>;
template <class T>
concept i128_c = is_u128_v<T>;

template <class T>
constexpr bool is_int_v = std::is_integral_v<T> || is_i128_v<T>;
template <class T>
concept int_c = is_int_v<T>;

template <class T>
constexpr bool is_sint_v = is_s128_v<T> || (is_int_v<T> && std::is_signed_v<T>);
template <class T>
concept sint_c = is_sint_v<T>;

template <class T>
constexpr bool is_uint_v = is_u128_v<T> || (is_int_v<T> && std::is_unsigned_v<T>);
template <class T>
concept uint_c = is_uint_v<T>;

template <class T>
concept mint_c = requires(T x) {
  { x.mod() } -> uint_c;
  { x.val() } -> uint_c;
};

template <class T>
constexpr bool is_arithm_v = std::is_arithmetic_v<T> || is_int_v<T>;
template <class T>
concept arithm_c = is_arithm_v<T>;

template <class T>
struct to_sint : std::make_signed<T> {};
template <>
struct to_sint<u128> {
  using type = u128;
};
template <>
struct to_sint<i128> {
  using type = u128;
};
template <class T>
using to_sint_t = typename to_sint<T>::type;

template <class T>
struct to_uint : std::make_unsigned<T> {};
template <>
struct to_uint<u128> {
  using type = u128;
};
template <>
struct to_uint<i128> {
  using type = u128;
};
template <class T>
using to_uint_t = typename to_uint<T>::type;

}  // namespace tifa_libs


#line 5 "src/code/math/safe_mod.hpp"

namespace tifa_libs::math {

template <sint_c T>
constexpr T safe_mod(T x, to_uint_t<T> mod) { return ((x %= (T)mod) < 0 ? x + (T)mod : x); }

}  // namespace tifa_libs::math


#line 1 "src/code/nt/exgcd.hpp"



#line 5 "src/code/nt/exgcd.hpp"

namespace tifa_libs::math {

// Binary exgcd
template <uint_c U, bool only_x = false>
constexpr auto exgcd_b(U a, U b) {
  using T = to_sint_t<U>;
  if constexpr (only_x) {
    if (!a) return std::make_tuple(b, (T)0);
    if (!b) return std::make_tuple(a, (T)1);
  } else {
    if (!a) return std::make_tuple(b, (T)0, (T) !!b);
    if (!b) return std::make_tuple(a, (T)1, (T)0);
  }
  auto r = std::__countr_zero(a | b);
  a >>= r, b >>= r;
  T x = (T)a, y = (T)b;
  T s = 1, t = 0, u = 0, v = 1;
  while (x) {
    while (!(x & 1)) {
      x /= 2;
      if (!((s | t) & 1)) s /= 2, t /= 2;
      else s = (s + (T)b) / 2, t = (t - (T)a) / 2;
    }
    while (!(y & 1)) {
      y /= 2;
      if (!((u | v) & 1)) u /= 2, v /= 2;
      else u = (u + (T)b) / 2, v = (v - (T)a) / 2;
    }
    if (x >= y) x -= y, s -= u, t -= v;
    else y -= x, u -= s, v -= t;
  }
  if (y > 1) a /= (U)y, b /= (U)y;
  if (a && (U)abs(v) >= a) {
    T _ = v / (T)a;
    v -= _ * (T)a, u += _ * (T)b;
  }
  if (b && (U)abs(u) >= b) {
    T _ = u / (T)b;
    u -= _ * (T)b, v += _ * (T)a;
  }
  if (T u_ = u + (T)b, v_ = v - (T)a; abs(u_) + abs(v_) <= abs(u) + abs(v)) u = u_, v = v_;
  if (T u_ = u - (T)b, v_ = v + (T)a; abs(u_) + abs(v_) <= abs(u) + abs(v)) u = u_, v = v_;
  if constexpr (only_x) return std::make_tuple(U(y << r), u);
  else return std::make_tuple(U(y << r), u, v);
}
// @return then return tuple(g, x[, y]) s.t. g = gcd(a, b), xa + yb = g, |x| + |y| is the minimal (primary) and x <= y (secondarily)
template <sint_c T, bool only_x = false>
constexpr auto exgcd(T a, T b) {
  using U = to_uint_t<T>;
  if (auto [x, y] = std::minmax(a, b); x >= 0 && y <= T(U(-1) >> sizeof(U))) return exgcd_b<U, only_x>((U)a, (U)b);
  if constexpr (only_x) {
    T s = 1, u = 0;
    while (b) {
      T c = a / b;
      std::tie(s, u, a, b) = std::make_tuple(u, s - u * c, b, a - b * c);
    }
    return std::make_tuple((U)a, s);
  } else {
    T s = 1, t = 0, u = 0, v = 1;
    while (b) {
      T c = a / b;
      std::tie(s, t, u, v, a, b) = std::make_tuple(u, v, s - u * c, t - v * c, b, a - b * c);
    }
    return std::make_tuple((U)a, s, t);
  }
}

}  // namespace tifa_libs::math


#line 6 "src/code/nt/inv_gcd.hpp"

namespace tifa_libs::math {

template <uint_c T>
constexpr ptt<T> inv_gcd(T n, T mod) {
  using U = to_sint_t<T>;
  auto [g, x] = exgcd<U, true>(U(n % mod), (U)mod);
  return {g, safe_mod(x, mod)};
}

}  // namespace tifa_libs::math


#line 5 "src/code/nt/inverse.hpp"

namespace tifa_libs::math {

template <uint_c T, uint_c U>
constexpr U inverse(T n, U mod) {
  auto [g, x] = inv_gcd(U(n % mod), mod);
  assert(g == 1);
  return x;
}

}  // namespace tifa_libs::math


#line 6 "src/code/math/mint.hpp"

namespace tifa_libs::math {

template <class D, uint_c Rt>
class mint {
  constexpr D const &d() const { return static_cast<D const &>(*this); }
  constexpr D &d() { return static_cast<D &>(*this); }

 protected:
  Rt v_{};

 public:
  constexpr mint() {}
  template <int_c T>
  constexpr mint(T v) : v_(D::mod_(v)) {}
  constexpr operator D() { return d(); }

  using raw_type = Rt;
  using sraw_type = to_sint_t<Rt>;
  static constexpr raw_type mod() { return D::mod_(); }
  static constexpr sraw_type smod() { return (sraw_type)D::mod_(); }
  constexpr raw_type val() const { return d().val_(); }
  constexpr sraw_type sval() const { return (sraw_type)d().val_(); }
  constexpr raw_type &data() { return d().data_(); }

  template <int_c T>
  explicit constexpr operator T() const { return (T)val(); }
  constexpr mint &operator+=(mint const &r) { return d().adde_(r.d()); }
  constexpr mint &operator-=(mint const &r) { return d().sube_(r.d()); }
  constexpr mint &operator*=(mint const &r) { return d().mule_(r.d()); }
  constexpr mint &operator/=(mint const &r) { return *this = *this * r.inv(); }
  constexpr mint const &operator+() const { return *this; }
  constexpr mint operator-() const { return d().neg_(); }
  constexpr mint inv() const { return inverse(val(), mod()); }
  friend constexpr mint operator+(mint l, mint const &r) { return l += r; }
  friend constexpr mint operator-(mint l, mint const &r) { return l -= r; }
  friend constexpr mint operator*(mint l, mint const &r) { return l *= r; }
  friend constexpr mint operator/(mint l, mint const &r) { return l /= r; }
  friend constexpr bool operator==(mint const &l, mint const &r) { return l.val() == r.val(); }
  friend constexpr auto operator<=>(mint const &l, mint const &r) { return l.sval() - r.sval(); }
  friend std::istream &operator>>(std::istream &is, mint &x) {
    i64 _;
    is >> _;
    x = mint(_);
    return is;
  }
  friend std::ostream &operator<<(std::ostream &os, mint const &x) { return os << x.val(); }
  friend constexpr mint abs(mint const &x) { return x.val(); }
};

}  // namespace tifa_libs::math


#line 5 "src/code/math/mint_ds.hpp"

namespace tifa_libs::math {

template <i32 ID>
class mint_ds : public mint<mint_ds<ID>, u32> {
  using base = mint<mint_ds<ID>, u32>;
  friend base;

  struct barrett {
    u32 m_;
    u64 im;
    // @param m `1 <= m < 2^31`
    explicit constexpr barrett(u32 m = 998244353) : m_(m), im(-1_u64 / m + 1) {}
    // @return m
    constexpr u32 umod() const { return m_; }
    constexpr u32 mul(u32 a, u32 b) const {
      u64 z = (u64)a * b, x = (u64)(((u128)z * im) >> 64);
      u32 v = (u32)(z - x * m_);
      return v + (m_ <= v ? m_ : 0);
    }
  };

  static inline barrett bt_;

 public:
  static constexpr bool FIXED_MOD = false;
  static constexpr void set_mod(u32 m) {
    assert(1 <= m);
    bt_ = barrett(m);
  }

  constexpr mint_ds() {}
  template <int_c T>
  constexpr mint_ds(T v) { this->v_ = mod_(v); }

 private:
  using raw_t = typename base::raw_type;
  using sraw_t = typename base::sraw_type;
  template <sint_c T>
  static constexpr raw_t mod_(T v) {
    i64 x = i64(v % (i64)mod_());
    return raw_t(x + (x < 0 ? mod_() : 0));
  }
  template <uint_c T>
  static constexpr raw_t mod_(T v) { return raw_t(v % mod_()); }
  static constexpr raw_t mod_() { return bt_.umod(); }
  constexpr raw_t val_() const { return this->v_; }
  constexpr raw_t &data_() { return this->v_; }

  constexpr mint_ds neg_() const { return -(sraw_t)val_(); }
  constexpr mint_ds &adde_(mint_ds const &r) {
    data_() += r.val_();
    if (val_() >= mod_()) data_() -= mod_();
    return *this;
  }
  constexpr mint_ds &sube_(mint_ds const &r) {
    data_() -= r.val_();
    if (val_() >= mod_()) data_() += mod_();
    return *this;
  }
  constexpr mint_ds &mule_(mint_ds const &r) {
    data_() = bt_.mul(val_(), r.val_());
    return *this;
  }
};

}  // namespace tifa_libs::math


#line 1 "src/code/str/hash_substr2.hpp"



#line 1 "src/code/str/hash_substr.hpp"



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

namespace tifa_libs::str {

template <class mint, u32 base = 131>
class hash_substr {
  static inline vec<mint> p;
  vec<mint> hash;

 public:
  explicit constexpr hash_substr() {}

  constexpr void set(strnv s) {
    hash.resize(1, 0), hash.reserve(s.size() + 1);
    for (char c : s) hash.push_back(hash.back() * base + (u32)c + 1);
    if (p.size() <= s.size()) {
      if (p.empty()) p.push_back(1);
      p.reserve(s.size() + 1);
      while (p.size() <= s.size()) p.push_back(p.back() * base);
    }
  }
  constexpr u32 size() const { return u32(hash.size() - 1); }
  constexpr mint get(u32 pos, u32 len = -1_u32) const {
    assert(!p.empty() && pos < hash.size());
    return hash[pos + std::min(len, (u32)hash.size() - 1 - pos)] - hash[pos] * p[len];
  }
};

}  // namespace tifa_libs::str


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

namespace tifa_libs::str {

template <class mint0, class mint1, u32 base = 131>
class hash_substr2 {
  hash_substr<mint0, base> h0;
  hash_substr<mint1, base> h1;

 public:
  explicit constexpr hash_substr2() {}

  constexpr void set(strnv s) { h0.set(s), h1.set(s); }
  constexpr u32 size() const { return h0.size(); }
  constexpr std::pair<mint0, mint1> get(u32 pos, u32 len = -1_u32) const { return {h0.get(pos, len), h1.get(pos, len)}; }
};

}  // namespace tifa_libs::str


#line 11 "src/test_cpverifier/library-checker/enumerate_palindromes.hashstr2-ds.test.cpp"

using mint0 = tifa_libs::math::mint_ds<-1>;
using mint1 = tifa_libs::math::mint_ds<-2>;
using hashstr = tifa_libs::str::hash_substr2<mint0, mint1>;

int main() {
  mint0::set_mod(MOD0);
  mint1::set_mod(MOD1);
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  strn s;
  std::cin >> s;
  {
    strn x;
    x.reserve(s.size() * 2 + 1);
    x.push_back('$');
    for (char c : s) x.push_back(c), x.push_back('$');
    s.swap(x);
  }
  strn t = s;
  std::ranges::reverse(t);
  hashstr hs, ht;
  hs.set(s), ht.set(t);
  u32 n = (u32)s.size();
  vecu ans(n);
  for (u32 i = 0; i < n; ++i) {
    u32 l = 0, r = std::min(i, n - 1 - i) + 1;
    while (l + 1 < r) {
      u32 m = (l + r) / 2, l_ = i - m, r_ = i + m;
      (hs.get(l_, r_ + 1 - l_) == ht.get(n - 1 - r_, r_ + 1 - l_) ? l : r) = m;
    }
    ans[i] = l;
  }
  for (u32 i = 1; i < n - 1; ++i) std::cout << ans[i] << " \n"[i + 2 == n];
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 all_same_00 :heavy_check_mark: AC 454 ms 33 MB
g++-12 all_same_01 :heavy_check_mark: AC 443 ms 33 MB
g++-12 all_same_02 :heavy_check_mark: AC 432 ms 33 MB
g++-12 all_same_03 :heavy_check_mark: AC 445 ms 33 MB
g++-12 all_same_04 :heavy_check_mark: AC 437 ms 33 MB
g++-12 example_00 :heavy_check_mark: AC 8 ms 4 MB
g++-12 example_01 :heavy_check_mark: AC 8 ms 4 MB
g++-12 example_02 :heavy_check_mark: AC 7 ms 4 MB
g++-12 example_03 :heavy_check_mark: AC 7 ms 4 MB
g++-12 max_random_00 :heavy_check_mark: AC 328 ms 33 MB
g++-12 max_random_01 :heavy_check_mark: AC 333 ms 33 MB
g++-12 max_random_02 :heavy_check_mark: AC 334 ms 33 MB
g++-12 max_random_03 :heavy_check_mark: AC 328 ms 33 MB
g++-12 max_random_04 :heavy_check_mark: AC 327 ms 33 MB
g++-12 random_00 :heavy_check_mark: AC 250 ms 26 MB
g++-12 random_01 :heavy_check_mark: AC 306 ms 31 MB
g++-12 random_02 :heavy_check_mark: AC 36 ms 7 MB
g++-12 random_03 :heavy_check_mark: AC 275 ms 29 MB
g++-12 random_04 :heavy_check_mark: AC 175 ms 20 MB
g++-12 small_00 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_01 :heavy_check_mark: AC 8 ms 4 MB
g++-12 small_02 :heavy_check_mark: AC 8 ms 4 MB
g++-12 small_03 :heavy_check_mark: AC 8 ms 4 MB
g++-12 small_04 :heavy_check_mark: AC 8 ms 4 MB
Back to top page