Keywords Search HDU - 2222 ac自动机模板 (母串中取子串)

In the modern time, Search engine came into the life of everybody like Google, Baidu, etc.
Wiskey also wants to bring this feature to his image retrieval system.
Every image have a long description, when users type some keywords to find the image, the system will match the keywords with description of image and show the image which the most keywords be matched.
To simplify the problem, giving you a description of image, and some keywords, you should tell me how many keywords will be match.
Input
First line will contain one integer means how many cases will follow by.
Each case will contain two integers N means the number of keywords and N keywords follow. (N <= 10000)
Each keyword will only contains characters ‘a’-‘z’, and the length will be not longer than 50.
The last line is the description, and the length will be not longer than 1000000.
Output
Print how many keywords are contained in the description.
Sample Input
1
5
she
he
say
shr
her
yasherhs
Sample Output
3
给你几个短字符串,一个长字符串,看有几个短字符串是能在长字符串里找到的。
将短字符建字典树,用ac自动机跑长字符。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<map>
#include<stack>
#include<set>
#include<queue>
#include<vector>
#include<stdlib.h>
 
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<cstdlib>
 
#define inf 0x3f3f3f3f
#define cha 1e-6
#define ll long long    
using namespace std;
const int maxn=1e6+6;
int trie[maxn][26];
int cntword[maxn];
int fail[maxn];//失配指针
int cnt=0;
void insert(string s){
    int root=0;
    for(int i=0;i<s.size();i++){
        int x=s[i]-'a';

        if(trie[root][x]==0){
            trie[root][x]=++cnt;
        }
        root=trie[root][x];
    }
    cntword[root]++;
}

void getfail(){
    queue<int>qu;
    for(int i=0;i<26;i++){
        if(trie[0][i]){
            fail[trie[0][i]]=0;
            qu.push(trie[0][i]);
        }
    }
    while(!qu.empty()){
        int now=qu.front();
        qu.pop();
        for(int i=0;i<26;i++){
            if(trie[now][i]){
                fail[trie[now][i]]=trie[fail[now]][i];
                qu.push(trie[now][i]);
            }
            else{
                trie[now][i]=trie[fail[now]][i];
            }
        }
    }
}

int query(string s){
    int now=0,ans=0;
    for(int i=0;i<s.size();i++){
        now=trie[now][s[i]-'a'];
        for(int j=now;j&&cntword[j]!=-1;j=fail[j]){//已经访问过
            ans+=cntword[j];
            cntword[j]=-1;
        }
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    int n;
    int t;
    cin>>t;
    while(t--){
        memset(trie,0,sizeof(trie));
        memset(cntword,0,sizeof(cntword));
        cin>>n;
        string s;
        for(int i=0;i<n;i++){
            cin>>s;
            insert(s);
        }
        fail[0]=0;
        getfail();
        cin>>s;
        cout<<query(s)<<endl;
    }
    return 0;

}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值