mmrz's library

This documentation is automatically generated by online-judge-tools/verification-helper

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

:heavy_check_mark: verify/yosupo/suffixarray.test.cpp

Depends on

Code

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

#include "./../../template/template.hpp"
#include "./../../string/suffix_array.hpp"

void mmrz::solve(){
	string s;
	cin >> s;
	suffix_array sa(s, false);
	reps(i, len(s)){
		cout << sa.sa[i] << " \n"[i == len(s)];
	}
}
#line 1 "verify/yosupo/suffixarray.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/suffixarray"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "string/suffix_array.hpp"

#line 5 "string/suffix_array.hpp"

template <typename T> struct suffix_array {
	T s;
	std::vector<int> sa;
	std::vector<int> rank;
	std::vector<int> lcp;

	suffix_array(const T &str, bool gen_lcp = true) : s(str) {
		int n = (int)s.size();
		sa.resize(n+1);
		std::iota(sa.begin(), sa.end(), 0);
		rank.assign(n+1, -1);
		for(int i = 0;i < n;i++){
			rank[i] = s[i];
		}
		std::vector<int> tmp(n+1);
		int k;
		auto comp_sa = [&](int i, int j) -> bool {
			if(rank[i] != rank[j])return rank[i] < rank[j];
			int ri = i + k <= n ? rank[i+k] : -1;
			int rj = j + k <= n ? rank[j+k] : -1;
			return ri < rj;
		};
		for(k = 1;k <= n;k *= 2){
			sort(sa.begin(), sa.end(), comp_sa);
			tmp[sa[0]] = 0;
			for(int i = 1;i <= n;i++){
				tmp[sa[i]] = tmp[sa[i-1]] + (comp_sa(sa[i-1], sa[i]) ? 1 : 0);
			}
			rank = tmp;
		}

		if(not gen_lcp)return;

		lcp.assign(n, 0);
		int h = 0;
		for(int i = 0;i < n;i++){
			int j = sa[rank[i]-1];
			if(h)h--;
			for(;j+h < n and i+h < n;h++){
				if(s[j+h] != s[i+h])break;
			}
			lcp[rank[i]-1] = h;
		}
	}
};
#line 5 "verify/yosupo/suffixarray.test.cpp"

void mmrz::solve(){
	string s;
	cin >> s;
	suffix_array sa(s, false);
	reps(i, len(s)){
		cout << sa.sa[i] << " \n"[i == len(s)];
	}
}
Back to top page