Description
有一天,明明正在读小说,发现每一篇小说都是由许多单词构成的,但是明明发现一个单词会在一篇小说中出现多次。现在明明想知道每个单词分别在小说中出现多少次。
Input
第一个一个整数N,表示有多少个单词,接下来N行每行一个单词。每个单词由小写字母组成,N ≤ 200,单词长度不超过10^6
Output
输出N个整数,第i行的数字表示第i个单词在小说中出现了多少次。
Sample
Input
3 b bb bbb
Output
6 3 1
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1000005;
int q[maxn];
int trie[maxn][26];
int fail[maxn];
string str[205];
int cnt[205];
int sum[maxn];
int tot = 1;
void insert(int j)
{
int l = str[j].length();
int tmp = 0;
for (int i = 0; i < l; i++)
{
int tmpp = str[j][i] - 'a';
if (!trie[tmp][tmpp])
{
trie[tmp][tmpp] = tot++;
}
tmp = trie[tmp][tmpp];
sum[tmp]++;
}
cnt[j] = tmp;
}
void getfail()
{
int head,tail;
head = tail = 0;
for (int i = 0; i < 26; i++)
{
if (trie[0][i])
{
q[tail++] = trie[0][i];
fail[trie[0][i]] = 0;
}
}
while (head != tail)
{
int p = q[head];
head++;
for (int i = 0; i < 26; i++)
{
if (trie[p][i])
{
fail[ trie[p][i] ] = trie[ fail[p] ][i];
q[tail++] = trie[p][i];
}
else
{
trie[p][i] = trie[ fail[p] ][i];
}
}
}
for (int i = tail; i >= 1; i--)
{
sum[ fail[q[i]] ] += sum[ q[i] ];
}
}
int main()
{
// freopen("in.txt", "r", stdin);
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
cin >> str[i];
insert(i);
}
getfail();
for (int i = 0; i < n; i++)
{
printf("%d\n", sum[ cnt[i] ]);
}
return 0;
}
#include<cstdio>
#define MAXN 1000010
#define MAXC 210
int a[MAXN][MAXC], pre[MAXN], sz = 1, q[MAXN], cnt[MAXN], ed[MAXN], n;
char s[MAXN];
inline int Insert(char *s)
{
int c, p = 1;
for(int i = 0; s[i]; ++ i)
{
c = s[i] - 'a';
if(!a[p][c])
{
a[p][c] = ++ sz;
}
p = a[p][c];
++ cnt[p];
}
return p;
}
void Build()
{
int l = 1, r = 0;
for(int i = 0; i < MAXC; ++ i)
{
if(!a[1][i])
{
a[1][i] = 1;
}
else
{
pre[a[1][i]] = 1;
q[++ r] = a[1][i];
}
}
while(l <= r)
{
int u = q[l ++];
for(int i = 0; i < MAXC; ++ i)
{
if(!a[u][i])
{
a[u][i] = a[pre[u]][i];
}
else
{
pre[a[u][i]] = a[pre[u]][i];
q[++ r] = a[u][i];
}
}
}
for(int i = r; i; -- i)
{
cnt[pre[q[i]]] += cnt[q[i]];
}
}
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; ++ i)
{
scanf("%s", s);
ed[i] = Insert(s);
}
Build();
for(int i = 1; i <= n; ++ i)
{
printf("%d\n", cnt[ed[i]]);
}
return 0;
}