我的ac自动机第一题 hdu2222

最新推荐文章于 2020-02-25 16:26:17 发布

x920405451x

最新推荐文章于 2020-02-25 16:26:17 发布

阅读量740

点赞数

分类专栏： ac自动机数据结构文章标签： algorithm 计算机科学

本文链接：https://blog.csdn.net/x920405451x/article/details/25427591

版权

数据结构同时被 2 个专栏收录

1 篇文章 0 订阅

订阅专栏

ac自动机

0 篇文章 0 订阅

订阅专栏

//计算一篇文章中出现几个模板单词
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <ctime>
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
#define INF 1e9
#define maxn 500010
#define maxm 100086+10
#define mod 1000000009
#define eps 1e-7
#define PI acos(-1.0)
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define scan(n) scanf("%d",&n)
#define scanll(n) scanf("%I64d",&n)
#define scan2(n,m) scanf("%d%d",&n,&m)
#define scanll2(n,m) scanf("%I64d%I64d",&n,&m)
#define scans(s) scanf("%s",s);
#define ini(a) memset(a,0,sizeof(a))
#define out(n) printf("%d\n",n)
#define outll(n) printf("%I64d\n",n)
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1

struct AC
{	
	int last[maxn],f[maxn];
	int ch[maxn][26];
	int val[maxn];
	int sz;
	AC(){ init(); }
	void init()
	{
		sz = 1; memset(ch[0],0,sizeof(ch[0]));
	}
	int idx(char c) { return c - 'a'; }
	void insert(char *s,int v)
	{
		int u = 0, n = strlen(s);
		rep(i,n)
		{
			int c = idx(s[i]);
			if(!ch[u][c])
			{
				memset(ch[sz],0,sizeof(ch[sz]));
				val[sz] = 0;
				ch[u][c] = sz++;
			}
			u = ch[u][c];
		}
		val[u] ++;
	}

	void getFail()
	{
		queue<int> q;
		f[0] = 0;
		rep(c,26)
		{
			int u = ch[0][c];
			if(u) { f[u] = 0; q.push(u); last[u] = 0; }
		}

		while(!q.empty())
		{
			int r = q.front(); q.pop();
			rep(c,26)
			{
				int u = ch[r][c];
				if(u)
				{
					q.push(u);
					int v = f[r];
					while(v && !ch[v][c]) v = f[v];
					f[u] = ch[v][c];
					last[u] = val[f[u]] ? f[u] : last[f[u]];
				}
				else ch[r][c] = ch[f[r]][c];
			}
		}
	}

	int find(char *s)
	{
		int n = strlen(s);
		int ans = 0;
		int j = 0;
		rep(i,n)
		{
			int c = idx(s[i]);
			while(j && !ch[j][c]) j = f[j];
			j = ch[j][c];
			if(val[j]) ans += print(j);
			else ans += print(last[j]);
		}
		return ans;
	}

	int print(int j)
	{
		int ans = 0;
		if(j)
		{
			if(val[j]){ ans += val[j]; val[j] = 0; }
			ans += print(last[j]);
		}
		return ans;
	}
}ac;
char s[1000010];
char tmp[55];
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
#endif 
	int T;
	cin>>T;
	int n;
	while(T--)
	{
		ac.init();
		cin>>n;
		rep1(i,n)
		{
			scans(tmp);
			ac.insert(tmp,i);
		}
		ac.getFail();
		scans(s);
		int ans = ac.find(s);
		out(ans);
	}
	return 0;
}