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
| #include <cstdio>
#include <string>
#include <iostream>
using namespace std;
template <class Type>
void read(Type &x)
{
char c;
bool flag = false;
while ((c = getchar()) < '0' || c > '9')
c == '-' && (flag = true);
x = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
x = (x << 3) + (x << 1) + c - '0';
if (flag) x = ~x + 1;
}
template <class Type, class ...rest>
void read(Type &x, rest &...y) { read(x), read(y...); }
template <class Type>
void write(Type x)
{
if (x < 0) putchar('-'), x = ~x + 1;
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
typedef long long LL;
const int N = 2e6 + 10;
string str;
int hd = 1, tl = 0, q[N];
int cntTrie = 1, nxt[N][26], cntSAM = 1, id[N];
struct Node { int p, len, nxt[26]; } tr[N];
void insert (string &str)
{
int p = 1;
for (char c : str)
{
int &t = nxt[p][c - 'a'];
if (!t) t = ++cntTrie;
p = t;
}
}
void extend (int c, int x, int p)
{
int np = ++cntSAM;
id[x] = np;
tr[np].len = tr[p].len + 1;
for (; p && !tr[p].nxt[c]; p = tr[p].p) tr[p].nxt[c] = np;
if (!p) return void(tr[np].p = 1);
int q = tr[p].nxt[c];
if (tr[q].len == tr[p].len + 1) return void(tr[np].p = q);
int nq = ++cntSAM;
tr[nq] = tr[q], tr[nq].len = tr[p].len + 1;
tr[q].p = tr[np].p = nq;
for (; p && tr[p].nxt[c] == q; p = tr[p].p) tr[p].nxt[c] = nq;
}
void init ()
{
id[q[++tl] = 1] = 1;
while (hd <= tl)
{
int t = q[hd++];
for (int i = 0; i < 26; ++i)
if (nxt[t][i])
{
extend(i, nxt[t][i], id[t]);
q[++tl] = nxt[t][i];
}
}
}
int main ()
{
int n;
read(n);
for (int i = 1; i <= n; ++i)
cin >> str, insert(str);
init();
LL res = 0;
for (int i = 1; i <= cntSAM; ++i)
res += tr[i].len - tr[tr[i].p].len;
write(res);
return 0;
}
|