用于在一个长串里一次性查找多个单词的出现次数
/****************AC自动机*********************
// - 字符串下标从0开始
*/
struct AC_auto
{
int tot;
int vis[N]; // topu后表示每个结点表示的字符串出现的次数
int in[N];
int tr[N][27];
int mp[N]; // 第i个字符串表示第几个点
int fail[N]; // 失配指针
int flag[N]; // 第i个点表示第几个字符串
int cnt[N];
queue<int> q;
void init()
{
tot = 1;
for (int i = 0; i < N; i ++ )
{
vis[i] = in[i] = mp[i] = fail[i] = flag[i] = 0, cnt[i] = 0;
for (int j = 0; j < 27; j ++ ) tr[i][j] = 0;
}
}
// s是第num个添加进来的单词
void insert(string s, int num)
{
int u = 1, len = s.size();
for (int i = 0; i < len; i++)
{
int v = s[i] - 'a';
if (!tr[u][v])
tr[u][v] = ++tot;
u = tr[u][v];
}
if (!flag[u]) flag[u] = num;
mp[num] = flag[u];
}
void getFail()
{
for (int i = 0; i < 26; i++) tr[0][i] = 1;
q.push(1);
while (!q.empty())
{
int u = q.front();
q.pop();
int Fail = fail[u];
for (int i = 0; i < 26; i++)
{
int v = tr[u][i];
if (!v)
{
tr[u][i] = tr[Fail][i];
continue;
}
fail[v] = tr[Fail][i];
in[fail[v]]++;
q.push(v);
}
}
}
void topu()
{
for (int i = 1; i <= tot; i++) if (in[i] == 0) q.push(i);
while (!q.empty())
{
int u = q.front();
q.pop();
vis[flag[u]] = cnt[u];
int v = fail[u];
in[v]--;
cnt[v] += cnt[u];
if (in[v] == 0) q.push(v);
}
}
void query(string s)
{
int u = 1, len = s.size();
for (int i = 0; i < len; i++)
u = tr[u][s[i] - 'a'], cnt[u]++;
}
void solve()
{
// 在这里输入解题逻辑
init();
// 输入短串
insert(s, i);
getFail();
// 输入长串
string s; cin >> s;
query(s);
topu();
// 输出答案
}
} ac;