求目标串中出现了几个模式。模板题
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<vector>
#include<iostream>
#include<string>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
#define nn 1000010
#define ll long long
#define ULL unsiged long long
#define mod 0x7fffffff
#define inf oxfffffffffff
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
((`'-"` `""-'`))
) - - (
/ (o _ o) \
\ ( 0 ) /
_'-.._ '=' _..-'_
/`;#'#'#. -. #'#'#;`\
\_)) '#' ((_/
#. ☆ ☆ ☆ .#
'#. 求 A C! .#'
/'#. .#'\
_\\'#. .#'//_
(((___)'#'(___)))
//-----------------------------SB-----------------------------------//
struct Trie
{
int next[500010][26],fail[500010],last[500010];
int root,L;
int newnode()
{
for(int i = 0;i < 26;i++)
next[L][i] = -1;
last[L++] = 0;
return L-1;
}
void init()
{
L = 0;
root = newnode();
}
void Insert(char buf[])
{
int len = strlen(buf);
int now = root;
for(int i = 0;i < len;i++)
{
if(next[now][buf[i]-'a'] == -1)
next[now][buf[i]-'a'] = newnode();
now = next[now][buf[i]-'a'];
}
last[now]++;
}
void build()
{
queue<int>Q;
fail[root] = root;
for(int i = 0;i < 26;i++)
if(next[root][i] == -1)
next[root][i] = root;
else
{
fail[next[root][i]] = root;
Q.push(next[root][i]);
}
while( !Q.empty() )
{
int now = Q.front();
Q.pop();
for(int i = 0;i < 26;i++)
if(next[now][i] == -1)
next[now][i] = next[fail[now]][i];
else
{
fail[next[now][i]]=next[fail[now]][i];
Q.push(next[now][i]);
}
}
}
int query(char buf[])
{
int len = strlen(buf);
int now = root;
int res = 0;
for(int i = 0;i < len;i++)
{
now = next[now][buf[i]-'a'];
int temp = now;
while( temp != root )
{
res += last[temp];
//last[temp] = 0;
temp = fail[temp];
}
}
return res;
}
void debug()
{
for(int i = 0;i < L;i++)
{
printf("id = %3d,fail = %3d,last = %3d,chi = [",i,fail[i],last[i]);
for(int j = 0;j < 26;j++)
printf("%2d",next[i][j]);
printf("]\n");
}
}
};
char buf[1000010];
Trie ac;
char mp[100004][10005];
int main()
{
int T;
int n,m;
scanf("%d",&T);
while( T-- )
{
scanf("%d%d",&n,&m);
ac.init();
for(int i = 0;i < n;i++)
scanf("%s",mp[i]);
for(int i=0;i<m;i++)
{
scanf("%s",buf);
ac.Insert(buf);
}
ac.build();
//scanf("%s",buf);
for(int i=0;i<n;i++)
printf("%d\n",ac.query(mp[i]));
}
return 0;
}