HDU - 2222 Keywords Search
(AC自动机) O ( n ) O(n) O(n)
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
const int N = 10010, S = 50, M = 1000010;
int n;
int tr[N*S][26],cnt[N*S],idx;
char str[M];
int q[N*S],ne[N*S];
void insert()
{
int p=0;
for(int i=0;str[i];i++)
{
int t=str[i]-'a';
if(!tr[p][t]) tr[p][t]=++idx;
p=tr[p][t];
}
cnt[p]++;
}
void build()
{
queue<int>q;
for(int i=0;i<26;i++)
if(tr[0][i]) q.push(tr[0][i]);
while(!q.empty())
{
int t=q.front();q.pop();
for(int i=0;i<26;i++)
{
int &p=tr[t][i];
if(!p) p=tr[ne[t]][i];
else
{
ne[p]=tr[ne[t]][i];
q.push(p);
}
}
}
}
int main()
{
int T;scanf("%d",&T);
while(T--)
{
memset(tr,0,sizeof tr);
memset(cnt,0,sizeof cnt);
memset(ne,0,sizeof ne);
idx=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s",str);
insert();
}
build();
scanf("%s",str);
int res=0;
for(int i=0,j=0;str[i];i++)
{
int t=str[i]-'a';
j=tr[j][t];
int p=j;
while(p)
{
res+=cnt[p];
cnt[p]=0;
p=ne[p];
}
}
printf("%d\n",res);
}
return 0;
}
使用拓扑排序可以优化节省时间常数,可惜我不会,把代码粘贴一下,各位大佬自己观看
(AC自动机+拓扑排序) O ( n ) O(n) O(n)
#include<iostream>
#include<cstring>
#include<queue>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 1e4 + 5,M = 1e6 + 5;
int n,m,k,S,T;
int tr[N * 51][26],cnt[N * 51],ne[N * 51],idx;
int din[N * 51];
bool vis[N * 51];
char s[M];
void insert(){
int p = 0;
for(int i = 0 ; s[i] ; ++i){
int t = s[i] - 'a';
if(!tr[p][t]) tr[p][t] = ++idx;
p = tr[p][t];
}
cnt[p]++;
}
void build(){
queue<int> q;
for(int i = 0 ; i < 26 ; ++i){
if(tr[0][i]) q.push(tr[0][i]);
}
while(!q.empty()){
int t = q.front();q.pop();
for(int i = 0 ; i < 26 ; ++i){
int &p = tr[t][i];
if(!p) p = tr[ne[t]][i];
else{
ne[p] = tr[ne[t]][i];
din[ne[p]]++;
q.push(p);
}
}
}
}
void topsort(){
queue<int> q;
for(int i = 1 ; i <= idx ; ++i){
if(!din[i]) q.push(i);
}
while(!q.empty()){
int u = q.front();q.pop();
int v = ne[u];
vis[v] |= vis[u];
--din[v];
if(din[v] == 0) q.push(v);
}
}
void solve(){
memset(tr,0,sizeof(tr));
memset(cnt,0,sizeof(cnt));
memset(ne,0,sizeof(ne));
memset(vis,false,sizeof(vis));
memset(din,0,sizeof(din));
idx = 0;
cin >> n;
while(n--){
cin >> s;
insert();
}
build();
cin >> s;
for(int i = 0,j = 0; s[i] ; ++i){
int t = s[i] - 'a';
j = tr[j][t];
vis[j] = true;
}
topsort();
int ans = 0;
for(int i = 1 ; i <= idx ; ++i) if(vis[i]) ans += cnt[i];
cout << ans << endl;
}
int main()
{
IOS;
int tt;
cin >> tt;
while(tt--)
solve();
return 0;
}