Keywords Search (HDU_2222) AC自动机
来源:互联网 发布:济宁预算软件 编辑:程序博客网 时间:2024/05/16 10:33
Keywords Search
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 49346 Accepted Submission(s): 15795
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
Author
Wiskey
题目大意:给出一些单词及一片个长串,求问单词在长串出现的次数;
解题思路:AC自动机,注意单词可能重复出现。
代码如下:
#include"iostream" #include"cstdio" #include"cstring" #include"queue" using namespace std; const int maxn = 1000005; const int maxk = 26; char str[maxn]; struct Trie{ int next[10005*50][maxk], fail[10005*50], end[10005*50]; int root, L; int newnode(){ for(int i = 0;i < maxk;i ++) next[L][i] = -1;end[L ++] = 0;return L - 1; } void init(){ memset(end,0,sizeof(end)); L = 0; root = newnode(); } void Insert(char *s){ int len = strlen(s); int now = root; for(int i = 0, k = 0;i < len;i ++){ k = s[i] - 'a'; if(next[now][k] == -1) next[now][k] = newnode(); now = next[now][k]; } end[now] ++; } void Getfail(){ queue<int> Q; fail[root] = root; for(int i = 0;i < maxk;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 < maxk;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(){ int cnt; int len = strlen(str); int now = root; cnt = 0; for(int i = 0, k = 0;i < len;i ++){ k = str[i] - 'a'; now = next[now][k]; int temp = now; while(temp != root){ cnt += end[temp]; end[temp] = 0; temp = fail[temp]; }}return cnt; } }; Trie ac;int main(){int n, T;char s[55];scanf("%d",&T);while(T --){ac.init();scanf("%d",&n);for(int i = 1;i <= n;i ++){scanf("%s",s);ac.Insert(s);}ac.Getfail();scanf("%s",str);printf("%d\n",ac.Query());}return 0;}
0 0
- Keywords Search (HDU_2222) AC自动机
- hdu_2222 Keywords Search(AC自动机)
- hdu_2222: Keywords Search(AC自动机模板题)
- HDU_2222 Keywords Search 【AC自动机模板题】【动态链表】
- Keywords Search(AC自动机)
- Keywords Search(AC自动机)
- [AC自动机]hdu2222 Keywords Search
- HDU2222 Keywords Search AC自动机
- 【hdu2222】【AC自动机】Keywords Search
- HDU2222 Keywords Search AC自动机
- Keywords Search (ac 自动机)
- HDU2222 Keywords Search AC自动机
- [HDU2222] Keywords Search && AC自动机
- HDU2222 Keywords Search AC自动机
- 【AC自动机】Keywords Search _HDU2222
- HDU2222 Keywords Search【AC自动机】
- 【AC自动机】【HDOJ2222】 Keywords Search
- AC自动机 - hdu2222 Keywords Search
- C#第一篇之性能优化
- Java的引用传递和值传递
- 浏览器的渲染原理简介
- hadoop学习资料园地
- Markdown的语法&在SublimeText中的使用
- Keywords Search (HDU_2222) AC自动机
- Spring 3中各JAR包的用途说明
- iso 下载
- 进程
- 请努力!!!
- 面试难点总结[java篇]
- ASP.NET的三层架构(DAL,BLL,UI)
- 注解配置AOP
- 你真的了解分层架构吗?——写给被PetShop"毒害"的朋友们