HDU 6096 String（AC自动机）

传送门：http://acm.hdu.edu.cn/showproblem.php?pid=6096
Problem Description
Bob has a dictionary with N words in it.
Now there is a list of words in which the middle part of the word has continuous letters disappeared. The middle part does not include the first and last character.
We only know the prefix and suffix of each word, and the number of characters missing is uncertain, it could be 0. But the prefix and suffix of each word can not overlap.
For each word in the list, Bob wants to determine which word is in the dictionary by prefix and suffix.
There are probably many answers. You just have to figure out how many words may be the answer.

Input
The first line of the input gives the number of test cases T; T test cases follow.
Each test case contains two integer N and Q, The number of words in the dictionary, and the number of words in the list.
Next N line, each line has a string Wi, represents the ith word in the dictionary (0<|Wi|≤100000)
Next Q line, each line has two string Pi , Si, represents the prefix and suffix of the ith word in the list (0<|Pi|,|Si|≤100000,0<|Pi|+|Si|≤100000)
All of the above characters are lowercase letters.
The dictionary does not contain the same words.

Limits
T≤5
0

#include<stdio.h>
#include<iostream>
#include<malloc.h>
#include<string.h>
using namespace std;
char str[10000009],s1[10000009],s2[10000009];///str表示的是一共的输入的字符串，s1表示前缀，s2表示后缀
int id[10000009];///用来表示一个前后缀最开始在第几个单词中出现的
int len[10000009];    ///len[i]代表第i个字符串的长度。
int ans[10000009];    ///ans[i]是第i个最后输出的满足第i个询问的字符串数量

typedef struct TrieNode//字典树的节点
{
    int num;//该节点的查询编号
    struct  TrieNode *son[27];//26个字母外加上一个通配符，通配符用来分割前后缀
} Trie;
Trie * createNode()//每一个节点都要进行初始化工作
{
    Trie *node;
    node=(Trie*)malloc(sizeof(Trie));
    for(int i=0; i<27; i++)//每一个的孩子节点都是没有值的
        node->son[i]=NULL;
    node->num=0;//所代表的是第几个前后缀
    return node;
}
void insertWord(Trie *root,int index)//建立字典树
{
    Trie *p;
    p=root;
    int i=0;
    while(s1[i]!='\0')//当字符串没有王文到末尾的时候
    {
        int lowerCase=s1[i]-'a';//小写字母对应的数字
        if(p->son[lowerCase]==NULL)//这个节点当前没有被建立
        {
            p->son[lowerCase]=createNode();//那就建立一个新的节点
        }
        p=p->son[lowerCase];//不管节点是新建立的还是之前就已经存在的，指针都应该指向当前的这个节点
        i++;
    }
    if(p->num==0)//还没有询问到这里
        p->num=index;
    else
        id[index]=p->num;遇到相同的数据只存最初出现的一个。
}

void query(Trie *root, int strBegin,int strEnd)//现在字典树当中寻找
{
    Trie *p,*temp;
    p=root;
    int i=strBegin;
    while(p!=NULL&&i<=strEnd)//p！=NULL表示有可能可以找到当前结点，i查找字符串还没有结束
    {
        int lowerCase=str[i]-'a';//单词转数字
        if(p->son[lowerCase]==NULL) return ;//匹配失败
        p=p->son[lowerCase];
        if(p->son[26]!=NULL)//这里是说找到了通配符，也就意味着前缀是符合情况的了，我们应该去查找有没有满足情况的后缀
        {
            temp=p->son[26];//temp表示的是通配符，则继续找后缀
            for(int j=strEnd; j>i; j--)//既然是查找后缀，当前的字符串肯定就得反着来找
            {
                lowerCase=str[j]-'a';
                if(temp->son[lowerCase]==NULL)//后缀失配
                    break;//失配
                temp=temp->son[lowerCase];
                if(temp->num)//找到合适的后缀了
                    ans[temp->num]++;//这个前后追对应的数量+
            }
        }
        i++;
    }
}
void free_Trie(Trie *root)//清空字典树
{
    if(root != NULL)
    {
        for(int i = 0; i < 27; i++)
            if(root->son[i]!=NULL)
                free_Trie(root->son[i]);
    }
    free(root);
}
int main()
{
    int T,n,q;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&q);
        Trie *root;
        root=createNode();
        int prelen=0;//当前的串的长度
        for(int i=0; i<n; i++)
        {
            scanf("%s",str+prelen);//从str+prelen这个长度开始给str赋值
            len[i] = strlen(str+prelen);//存储每个字符串的长度，方便下面操作
            prelen += len[i];
        }
        //printf("%s\n",str);
        for(int i=1; i<=q; i++)
        {
            id[i]=i;
            ans[i]=0;
        }
        for(int i=1; i<=q; i++)
        {
            scanf("%s",s1);
            int len1=strlen(s1);
            s1[len1++]='a'+26;//充当通配符
            scanf("%s",s2);
            int len2=strlen(s2);
            for(int j=len2-1; j>=0; j--)
            {
                s1[len1++]=s2[j];
            }
            s1[len1]='\0';//字符串结束标志
            //printf("%s\n",s1);
            insertWord(root,i);//建立字典树
        }
        prelen=0;
        for(int i=0; i<n; i++)
        {
            query(root,prelen,prelen+len[i]-1);
            prelen+=len[i];
        }
        for(int i=1; i<=q; i++)
        {
            printf("%d\n",ans[id[i]]);
        }
        free_Trie(root);
    }
    return 0;
}