/
suffix-array.hpp
189 lines (175 loc) · 5.36 KB
/
suffix-array.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
#pragma once
#include "../data-structure/sparse-table.hpp"
// remind: SA including empty string
// verify https://judge.yosupo.jp/submission/240
struct SuffixArray {
int _size;
vector<int> sa;
string &s;
SuffixArray(string &str) : _size(str.size()), s(str) {
s.push_back(0);
sa.resize(s.size());
iota(begin(sa), end(sa), 0);
sort(begin(sa), end(sa),
[&](int a, int b) { return s[a] == s[b] ? a > b : s[a] < s[b]; });
vector<int> classes(s.size()), c(s.begin(), s.end()), cnt(s.size());
for (int len = 1; len < (int)s.size(); len <<= 1) {
for (int i = 0; i < (int)s.size(); i++) {
if (i > 0 && c[sa[i - 1]] == c[sa[i]] &&
sa[i - 1] + len < (int)s.size() &&
c[sa[i - 1] + len / 2] == c[sa[i] + len / 2]) {
classes[sa[i]] = classes[sa[i - 1]];
} else {
classes[sa[i]] = i;
}
}
iota(begin(cnt), end(cnt), 0);
copy(begin(sa), end(sa), begin(c));
for (int i = 0; i < (int)s.size(); i++) {
int s1 = c[i] - len;
if (s1 >= 0) sa[cnt[classes[s1]]++] = s1;
}
classes.swap(c);
}
s.pop_back();
}
void output() {
cout << "SA\tidx\tstr" << endl;
for (int i = 0; i < size(); i++) {
cout << i << ": \t" << sa[i] << " \t";
if (sa[i] != _size)
cout << s.substr(sa[i], _size - sa[i]) << endl;
else
cout << "$" << endl;
}
cout << endl;
}
int size() const { return _size + 1; }
int operator[](int k) const { return sa[k]; }
};
struct LCPArray {
const SuffixArray &SA;
vector<int> LCP, rank;
LCPArray(const SuffixArray &sa) : SA(sa) {
LCP.resize(SA.size());
rank.resize(SA.size());
for (int i = 0; i < SA.size(); i++) {
rank[SA[i]] = i;
}
LCP[0] = 0;
for (int i = 0, h = 0; i < SA.size() - 1; i++) {
int j = SA[rank[i] - 1];
h ? h-- : h;
while ((i > j ? i : j) + h < SA.size() - 1 &&
SA.s[i + h] == SA.s[j + h] && ++h)
;
LCP[rank[i] - 1] = h;
}
}
void output() {
cout << "SA\tidx\tLCP\tstr" << endl;
for (int i = 0; i < SA.size(); i++) {
cout << i << "\t" << SA[i] << " \t" << LCP[i] << "\t";
if (SA[i] == SA.size() - 1)
cout << "$";
else
cout << SA.s.substr(SA[i], SA.size() - 1 - SA[i]);
cout << endl;
}
}
};
// verify
// https://onlinejudge.u-aizu.ac.jp/status/users/NyaanNyaan/submissions/1/ALDS1_14_D/judge/3874273/C++14
// https://atcoder.jp/contests/abc135/submissions/7574225
// https://judge.yosupo.jp/submission/241
// https://atcoder.jp/contests/abc141/submissions/7577295
struct StringSearch {
string &s;
const SuffixArray &sa;
const LCPArray &lcp;
SparseTable<int> sparse;
StringSearch(LCPArray &lcp)
: s(lcp.SA.s), sa(lcp.SA), lcp(lcp), sparse(lcp.LCP) {}
pair<int, int> comp(const string &t, int len, int si, int ti = 0) {
int sn = (int)s.size(), tn = (int)t.size();
si += len, ti += len;
while (si < sn && ti < tn) {
if (s[si] != t[ti]) return make_pair(s[si] < t[ti], ti);
si++, ti++;
}
return make_pair((si >= sn && ti < tn), ti);
}
pair<int, int> find_range(int left, int med, int right, int len) {
{
int ng = left - 1, ok = med;
while (ng + 1 < ok) {
int cur = (ng + ok) / 2;
if (sparse.query(cur, med) >= len)
ok = cur;
else
ng = cur;
}
left = ok;
}
{
int ok = med, ng = right + 1;
while (ok + 1 < ng) {
int cur = (ng + ok) / 2;
if (sparse.query(med, cur) >= len)
ok = cur;
else
ng = cur;
}
right = ok;
}
return make_pair(left, right);
}
public:
// Longest Common Prefix between S[i , N) and S[j , N)
int ArbitaryLCP(int i, int j) {
if (i == j) return (int)(s.size()) - i;
return sparse.query(min(lcp.rank[i], lcp.rank[j]),
max(lcp.rank[i], lcp.rank[j]));
}
// String Search O(|T| + log |S|)
// return : [l, r], l and r are indices of Suffix Array
// if T doesn't exist, return (-1, -1)
pair<int, int> find(string &t) {
int left = 1, right = sa.size() - 1, med = left;
int leftlen = 0, rightlen = 0, tlen = t.size();
pair<int, int> ret;
while (left + 1 < right) {
med = (left + right) / 2;
int corres_len = max(min(leftlen, sparse.query(left, med)),
min(rightlen, sparse.query(med, right)));
if (corres_len < max(leftlen, rightlen)) {
if (leftlen < rightlen)
left = med, leftlen = corres_len;
else
right = med, rightlen = corres_len;
continue;
}
ret = comp(t, corres_len, sa[med]);
if (ret.second == tlen) return find_range(left, med, right, tlen);
if (ret.first == 0)
right = med, rightlen = ret.second;
else
left = med, leftlen = ret.second;
}
if (sa.size() <= 3) {
if (comp(t, 0, sa[left]).second == tlen)
return find_range(left, left, right, tlen);
if (comp(t, 0, sa[right]).second == tlen)
return find_range(left, right, right, tlen);
return make_pair(-1, -1);
}
med = left + right - med;
ret = comp(t, min(leftlen, rightlen), sa[med]);
if (ret.second == tlen) return find_range(left, med, right, tlen);
return make_pair(-1, -1);
}
};
// Usage:
// SuffixArray sa(S);
// LCPArray lcp(sa);
// StringSearch search(lcp);