Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/library-checker/suffixarray.test.cpp

Depends on

Code

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

#include "../../code/str/suffix_array.hpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  strn s;
  std::cin >> s;
  u32 n = (u32)s.size();
  s = " " + s;
  tifa_libs::str::suffixarray sa(s);
  for (u32 i = 1; i <= n; ++i) std::cout << sa.sa[i] - 1 << " \n"[i == n];
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/suffixarray.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/suffixarray"

#line 1 "src/code/str/suffix_array.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&&...) {};


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

namespace tifa_libs::str {

template <class T = strn>
class suffixarray {
  T s;

 public:
  vecu sa, rk, height;

  // s must start from 1
  explicit constexpr suffixarray(T const& s_) : s(s_), sa(s.size()), rk(s.size()) {
    u32 n = u32(s.size() - 1), m = 0, p;
    for (auto x : s_) m = std::max(m, u32(x));
    vecu oldrk(n + n + 1), id(n + 1), cnt(m + 1, 0);
    for (u32 i = 1; i <= n; ++i) ++cnt[rk[i] = u32(s[i])];
    for (u32 i = 1; i <= m; ++i) cnt[i] += cnt[i - 1];
    for (u32 i = n; i >= 1; --i) sa[cnt[rk[i]]--] = i;

    for (u32 w = 1;; w *= 2, m = p) {
      p = 0;
      for (u32 i = n; i > n - w; --i) id[++p] = i;
      for (u32 i = 1; i <= n; ++i)
        if (sa[i] > w) id[++p] = sa[i] - w;

      cnt = vecu(m + 1, 0);
      for (u32 i = 1; i <= n; ++i) ++cnt[rk[id[i]]];
      for (u32 i = 1; i <= m; ++i) cnt[i] += cnt[i - 1];
      for (u32 i = n; i >= 1; --i) sa[cnt[rk[id[i]]]--] = id[i];
      std::ranges::copy(rk, oldrk.begin());
      p = 0;
      for (u32 i = 1; i <= n; ++i) {
        u32 x = sa[i], y = sa[i - 1];
        rk[x] = oldrk[x] == oldrk[y] && oldrk[x + w] == oldrk[y + w] ? p : ++p;
      }
      if (p == n) break;
    }
  }

  constexpr void get_height() {
    u32 n = u32(s.size() - 1);
    height = vecu(n + 1);
    for (u32 i = 1, k = 0; i <= n; ++i) {
      if (rk[i] == 1) continue;
      if (k) --k;
      while (i + k <= n && s[i + k] == s[sa[rk[i] - 1] + k]) ++k;
      height[rk[i]] = k;
    }
  }
  /*
    s.substr(begs) := s[begs..s.size() - 1]
    -1:  t > s.substr
    0 :  t == s.substr
    1 :  t < s.substr, t is a prefix of s.substr
    2 :  t < s.substr, t isn't prefix of s.substr
  */
  constexpr i32 compare_substr(T t, u32 begs = 1, u32 begt = 1) const {
    while (begs < s.size() && begt < t.size()) {
      if (t[begt] > s[begs]) return -1;
      if (t[begt] < s[begs]) return 2;
      ++begs, ++begt;
    }
    return begs == s.size() && begt == t.size() ? 0 : (begt >= t.size() ? 1 : -1);
  }
  // the smallest rank of suffix that is greater than or equal t
  constexpr u32 lower_bound(T t) const {
    u32 l = 1, r = u32(s.size() - 1), ret = u32(s.size());
    while (r >= l) {
      u32 mid = l + (r - l) / 2;
      if (compare_substr(t, sa[mid]) < 0) l = mid + 1;
      else r = mid - 1, ret = mid;
    }
    return ret;
  }
  // the smallest rank of suffix that is greater than t and t isn't prefix of that
  constexpr u32 upper_bound(T t) const {
    u32 l = 1, r = u32(s.size() - 1), ret = u32(s.size());
    while (r >= l) {
      u32 mid = l + (r - l) / 2;
      if (compare_substr(t, sa[mid]) <= 1) l = mid + 1;
      else r = mid - 1, ret = mid;
    }
    return ret;
  }
  constexpr u32 frequency(T t) const { return upper_bound(t) - lower_bound(t); }
};

}  // namespace tifa_libs::str


#line 4 "src/test_cpverifier/library-checker/suffixarray.test.cpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  strn s;
  std::cin >> s;
  u32 n = (u32)s.size();
  s = " " + s;
  tifa_libs::str::suffixarray sa(s);
  for (u32 i = 1; i <= n; ++i) std::cout << sa.sa[i] - 1 << " \n"[i == n];
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 all_same_00 :heavy_check_mark: AC 82 ms 16 MB
g++-12 all_same_01 :heavy_check_mark: AC 82 ms 16 MB
g++-12 all_same_02 :heavy_check_mark: AC 85 ms 16 MB
g++-12 all_same_03 :heavy_check_mark: AC 86 ms 16 MB
g++-12 all_same_04 :heavy_check_mark: AC 83 ms 16 MB
g++-12 binary_carry_00 :heavy_check_mark: AC 224 ms 17 MB
g++-12 binary_carry_01 :heavy_check_mark: AC 220 ms 17 MB
g++-12 example_00 :heavy_check_mark: AC 9 ms 4 MB
g++-12 example_01 :heavy_check_mark: AC 9 ms 4 MB
g++-12 example_02 :heavy_check_mark: AC 9 ms 4 MB
g++-12 example_03 :heavy_check_mark: AC 9 ms 4 MB
g++-12 fib_str_00 :heavy_check_mark: AC 125 ms 17 MB
g++-12 fib_str_01 :heavy_check_mark: AC 92 ms 13 MB
g++-12 fib_str_02 :heavy_check_mark: AC 85 ms 13 MB
g++-12 fib_str_03 :heavy_check_mark: AC 76 ms 12 MB
g++-12 fib_str_04 :heavy_check_mark: AC 122 ms 17 MB
g++-12 max_random_00 :heavy_check_mark: AC 67 ms 17 MB
g++-12 max_random_01 :heavy_check_mark: AC 60 ms 15 MB
g++-12 max_random_02 :heavy_check_mark: AC 61 ms 15 MB
g++-12 max_random_03 :heavy_check_mark: AC 59 ms 15 MB
g++-12 max_random_04 :heavy_check_mark: AC 59 ms 15 MB
g++-12 near_power_of_2_max_random_00 :heavy_check_mark: AC 34 ms 10 MB
g++-12 near_power_of_2_max_random_01 :heavy_check_mark: AC 34 ms 10 MB
g++-12 near_power_of_2_max_same_00 :heavy_check_mark: AC 48 ms 10 MB
g++-12 near_power_of_2_max_same_01 :heavy_check_mark: AC 46 ms 10 MB
g++-12 one_00 :heavy_check_mark: AC 10 ms 4 MB
g++-12 random_00 :heavy_check_mark: AC 46 ms 13 MB
g++-12 random_01 :heavy_check_mark: AC 58 ms 15 MB
g++-12 random_02 :heavy_check_mark: AC 14 ms 5 MB
g++-12 random_03 :heavy_check_mark: AC 51 ms 14 MB
g++-12 random_04 :heavy_check_mark: AC 38 ms 10 MB
Back to top page