AC自动机zoj3228

ZOJ Problem Set - 3228

Searching the String

---

Time Limit: 7 Seconds        Memory Limit: 129872 KB

---

Little jay really hates to deal with string. But moondy likes it very much, and she's so mischievous that she often gives jay some dull problems related to string. And one day, moondy gave jay another problem, poor jay finally broke out and cried, " Who can help me? I'll bg him! "

So what is the problem this time?

First, moondy gave jay a very long string A. Then she gave him a sequence of very short substrings, and asked him to find how many times each substring appeared in string A. What's more, she would denote whether or not founded appearances of this substring are allowed to overlap.

At first, jay just read string A from begin to end to search all appearances of each given substring. But he soon felt exhausted and couldn't go on any more, so he gave up and broke out this time.

I know you're a good guy and will help with jay even without bg, won't you?

Input

Input consists of multiple cases( <= 20 ) and terminates with end of file.

For each case, the first line contains string A ( length <= 10^5 ). The second line contains an integer N ( N <= 10^5 ), which denotes the number of queries. The next N lines, each with an integer type and a string a ( length <= 6 ), type = 0 denotes substring a is allowed to overlap and type = 1 denotes not. Note that all input characters are lowercase.

There is a blank line between two consecutive cases.

Output

For each case, output the case number first ( based on 1 , see Samples ).

Then for each query, output an integer in a single line denoting the maximum times you can find the substring under certain rules.

Output an empty line after each case.

Sample Input

ab
2
0 ab
1 ab

abababac
2
0 aba
1 aba

abcdefghijklmnopqrstuvwxyz
3
0 abc
1 def
1 jmn

Sample Output

Case 1
1
1

Case 2
3
2

Case 3
1
1
0

题意：找出可以重叠的和不可以重叠的字符串出现了多少次
思路：AC自动机，pos数组保存上一次出现的位置，pre保存单词节点在trie树中的位置，ans表示每个trie树中的节点出现的次数

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
const int maxn=100010;
const int maxm=maxn*7;
const int SIGMA_SIZE=26;
char s[maxn],word[10];
int N,pos[maxm],ans[maxm][2],len[maxm],type[maxn],pre[maxn];

struct AC
{
    int ch[maxm][26],val[maxm];
    int fail[maxm],last[maxm];
    int sz;
    void clear(){memset(ch[0],0,sizeof(ch[0]));sz=1;}
    int idx(char x){return x-'a';}
    void insert(char * s,int id)
    {
        int n=strlen(s);
        int u=0;
        for(int i=0;i<n;i++)
        {
            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]=1;
        pre[id]=u;
        len[u]=n;
    }
    void getfail()
    {
        queue<int> q;
        fail[0]=0;
        int u=0;
        for(int i=0;i<SIGMA_SIZE;i++)
        {
            u=ch[0][i];
            if(u){fail[u]=last[u]=0;q.push(u);}
        }
        while(!q.empty())
        {
            int r=q.front();q.pop();
            for(int c=0;c<SIGMA_SIZE;c++)
            {
                u=ch[r][c];
                if(!u){ch[r][c]=ch[fail[r]][c];continue;}
                q.push(u);
                int v=fail[r];
                while(v&&!ch[v][c])v=fail[v];
                fail[u]=ch[v][c];
                last[u]=val[fail[u]]?fail[u]:last[fail[u]];
            }
        }
    }
    void solve()
    {
        int n=strlen(s);
        int u=0;
        memset(pos,-1,sizeof(pos));
        memset(ans,0,sizeof(ans));
        for(int i=0;i<n;i++)
        {
            int c=idx(s[i]);
            u=ch[u][c];
            int tmp=0;
            if(val[u])tmp=u;
            else if(last[u])tmp=last[u];
            while(tmp)
            {
                ans[tmp][0]++;
                if(i-pos[tmp]>=len[tmp]){ans[tmp][1]++;pos[tmp]=i;}
                tmp=last[tmp];
            }
        }
        for(int i=1;i<=N;i++)printf("%d\n",ans[pre[i]][type[i]]);
        printf("\n");
    }
}ac;
int main()
{
    int cas=1;
    while(scanf("%s",s)!=EOF)
    {
        scanf("%d",&N);
        ac.clear();
        for(int i=1;i<=N;i++)
        {
            scanf("%d%s",&type[i],word);
            ac.insert(word,i);
        }
        ac.getfail();
        printf("Case %d\n",cas++);
        ac.solve();
    }
    return 0;
}