test/str/suffix_array.test.cpp

• View this file on GitHub
• Last update: 2024-11-09 00:49:07+00:00
• Problem: https://judge.yosupo.jp/problem/suffixarray

Depends on

• prelude.hpp
• str/suffix_array.hpp

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/suffixarray

#include "str/suffix_array.hpp"

char S[500001];

int main() {
  scanf("%s", S);
  int n = strlen(S);
  auto sa = sort_cyclic_shifts(S, S+n+1);
  sa.erase(sa.begin());
  rep(i, n) printf("%d%c", sa[i], " \n"[i==n-1]);
}

#line 1 "test/str/suffix_array.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/suffixarray

#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 "str/suffix_array.hpp"

// p[i] = starting position of i-th smallest shift
template <class It>
vector<int> sort_cyclic_shifts(It s, It s_last, int lim = 256) {
  int n = s_last - s;
  // c[i] = ordered tag of i-shift
  vector<int> p(n), p2(n), c(n), c2(n), cnt(max(n, lim), 0);

  rep(i, n) cnt[s[i]]++;
  rep(i, lim - 1) cnt[i + 1] += cnt[i];
  repr(i, n) p[--cnt[s[i]]] = i;
  int k = 0;
  rep(i, n - 1) c[p[i + 1]] = k += s[p[i]] != s[p[i + 1]];
  k++;

  for (int w = 1; w < n; w <<= 1) {
    rep(i, n) {
      int t = p[i] - w;
      p2[i] = t < 0 ? t + n : t;
    }
    fill(cnt.begin(), cnt.begin() + k, 0);
    rep(i, n) cnt[c[i]]++;
    rep(i, k - 1) cnt[i + 1] += cnt[i];
    repr(i, n) p[--cnt[c[p2[i]]]] = p2[i];
    c[p[0]] = k = 0;
    rep(i, n-1) {
      int piw = p[i] + w >= n ? p[i] + w - n : p[i] + w;
      int pi2w = p[i+1] + w >= n ? p[i+1] + w - n : p[i+1] + w;
      pair<int, int> prv(c[p[i]], c[piw]);
      pair<int, int> nxt(c[p[i + 1]], c[pi2w]);
      c2[p[i+1]] = k += prv != nxt;
    }
    k++;
    swap(c, c2);
  }
  return p;
}
#line 4 "test/str/suffix_array.test.cpp"

char S[500001];

int main() {
  scanf("%s", S);
  int n = strlen(S);
  auto sa = sort_cyclic_shifts(S, S+n+1);
  sa.erase(sa.begin());
  rep(i, n) printf("%d%c", sa[i], " \n"[i==n-1]);
}

Test cases

Env	Name	Status	Elapsed	Memory
g++-12	all_same_00	AC	389 ms	19 MB
g++-12	all_same_01	AC	390 ms	19 MB
g++-12	all_same_02	AC	392 ms	19 MB
g++-12	all_same_03	AC	397 ms	19 MB
g++-12	all_same_04	AC	393 ms	19 MB
g++-12	almost_single_00	AC	407 ms	19 MB
g++-12	almost_single_01	AC	401 ms	19 MB
g++-12	almost_single_02	AC	397 ms	19 MB
g++-12	almost_single_03	AC	396 ms	19 MB
g++-12	almost_single_04	AC	400 ms	19 MB
g++-12	almost_single_05	AC	401 ms	19 MB
g++-12	binary_carry_00	AC	462 ms	19 MB
g++-12	binary_carry_01	AC	471 ms	19 MB
g++-12	example_00	AC	12 ms	8 MB
g++-12	example_01	AC	12 ms	8 MB
g++-12	example_02	AC	12 ms	8 MB
g++-12	example_03	AC	11 ms	8 MB
g++-12	fib_str_00	AC	489 ms	19 MB
g++-12	fib_str_01	AC	364 ms	16 MB
g++-12	fib_str_02	AC	348 ms	16 MB
g++-12	fib_str_03	AC	319 ms	15 MB
g++-12	fib_str_04	AC	482 ms	19 MB
g++-12	hack_00	AC	12 ms	8 MB
g++-12	hack_01	AC	12 ms	8 MB
g++-12	hack_02	AC	11 ms	8 MB
g++-12	max_random_00	AC	619 ms	19 MB
g++-12	max_random_01	AC	619 ms	19 MB
g++-12	max_random_02	AC	616 ms	19 MB
g++-12	max_random_03	AC	608 ms	19 MB
g++-12	max_random_04	AC	608 ms	19 MB
g++-12	near_power_of_2_max_random_00	AC	318 ms	14 MB
g++-12	near_power_of_2_max_random_01	AC	308 ms	14 MB
g++-12	near_power_of_2_max_same_00	AC	218 ms	14 MB
g++-12	near_power_of_2_max_same_01	AC	205 ms	14 MB
g++-12	one_00	AC	12 ms	8 MB
g++-12	random_00	AC	478 ms	17 MB
g++-12	random_01	AC	586 ms	18 MB
g++-12	random_02	AC	56 ms	9 MB
g++-12	random_03	AC	538 ms	18 MB
g++-12	random_04	AC	347 ms	14 MB
g++-12	small_random_00	AC	12 ms	8 MB
g++-12	small_random_01	AC	12 ms	8 MB
g++-12	small_random_02	AC	11 ms	8 MB
g++-12	small_random_03	AC	12 ms	8 MB
g++-12	small_random_04	AC	12 ms	8 MB
g++-12	small_random_05	AC	11 ms	8 MB
g++-12	small_random_06	AC	11 ms	8 MB
g++-12	small_random_07	AC	12 ms	8 MB
g++-12	small_random_08	AC	12 ms	8 MB
g++-12	small_random_09	AC	12 ms	8 MB

Back to top page