hdu2222 AC自动机-给定串中出现了几个模式串
来源:互联网 发布:怎样注册两个淘宝账号 编辑:程序博客网 时间:2024/06/05 18:43
http://acm.hdu.edu.cn/showproblem.php?pid=2222
Problem Description
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.
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.
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
15shehesayshrheryasherhs
Sample Output
3
/**hdu2222 AC自动机-给定串中出现了几个模式串解题思路:AC自动机模板题*/#include <stdio.h>#include <string.h>#include <iostream>#include <string.h>#include <queue>using namespace std;struct Trie{ int next[500010][26],fail[500010],end[500010]; int root,L; int newnode() { for(int i=0; i<26; i++) { next[L][i]=-1; } end[L++]=0; return L-1; } void init() { L=0; root=newnode(); } void insert(char *buf) { int len=strlen(buf); int now=root; for(int i=0; i<len; i++) { if(next[now][buf[i]-'a']==-1) next[now][buf[i]-'a']=newnode(); now=next[now][buf[i]-'a']; } end[now]++; } void build() { queue<int>Q; fail[root]=root; for(int i=0; i<26; i++) { if(next[root][i]==-1) next[root][i]=root; else { fail[next[root][i]]=root; Q.push(next[root][i]); } } while(!Q.empty()) { int now=Q.front(); Q.pop(); for(int i=0; i<26; i++) { if(next[now][i]==-1) next[now][i]=next[fail[now]][i]; else { fail[next[now][i]]=next[fail[now]][i]; Q.push(next[now][i]); } } } } int query(char *buf) { int len=strlen(buf); int now=root; int res=0; for(int i=0; i<len; i++) { now=next[now][buf[i]-'a']; int temp=now; while(temp!=root) { res+=end[temp]; end[temp]=0; temp=fail[temp]; } } return res; }} ac;char buf[1000010];int main(){ int T; int n; scanf("%d",&T); while( T-- ) { scanf("%d",&n); ac.init(); for(int i = 0;i < n;i++) { scanf("%s",buf); ac.insert(buf); } ac.build(); scanf("%s",buf); printf("%d\n",ac.query(buf)); } return 0;}
0 0
- hdu2222 AC自动机-给定串中出现了几个模式串
- hdu5384 AC自动机模板题,统计模式串在给定串中出现的个数
- hdoj 2222 Keywords Search 【AC自动机 入门题】 【求目标串中出现了几个模式串】
- HDU2222 多串匹配 (AC自动机)
- hdu 3065 ac自动机 目标串中各个模式串出现了几次
- hdu2222 ac自动机模版
- hdu2222 AC自动机
- hdu2222,(ac自动机)
- HDU2222-tire,AC自动机
- AC自动机模板 hdu2222
- hdu2222-AC自动机
- HDU2222 AC自动机
- hdu2222 AC自动机
- 【AC自动机】HDU2222
- hdu2222 AC自动机
- hdu2222 ac自动机。。。。
- HDU2222 AC自动机入门
- hdu2222 ac自动机模板
- UITextField 关闭虚拟键盘--swift
- 奇偶校验码、海明校验码 和 循环冗余校验码(CRC)
- 解析户外旅游包的材质与选择
- Umbraco Dynamic
- android之Intent基本使用
- hdu2222 AC自动机-给定串中出现了几个模式串
- java面试题(86-115)
- Linux下socket编程与实例
- pycharm写python程序时"line 1"报错
- 08-外连接(左连接、右连接)、内连接、交叉连接
- 第一次配置windows服务器
- Junit的使用入门,判断控制台输出是否与预期相同
- spark:仿写案例--31
- 使用git上传代码到github<一>