【hdu 2222】Keywords Search
来源:互联网 发布:微信 for ubuntu 编辑:程序博客网 时间:2024/06/08 08:12
Keywords Search
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 48720 Accepted Submission(s): 15551
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.
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-auto
#include<iostream>#include<stdio.h>#include<string.h>#include<queue>#define maxn 1000005using namespace std;int T,n;char aa[55],s[maxn];int ans;struct node{ int ch[27],nex,cnt; void init() { nex=0; cnt=0; for(int i=0;i<=27;i++) ch[i]=0; }}t[10005*51];int tot;queue<int> q;inline void insert(char s[]){ int l=strlen(s); int now=0; for(int i=0;i<l;i++) { int tmp=s[i]-'a'; if(!t[now].ch[tmp]) { t[now].ch[tmp]=++tot; t[tot].init(); } now=t[now].ch[tmp]; } t[now].cnt++;}inline void get_nex(){ for(int i=0;i<27;i++) if(t[0].ch[i]) q.push(t[0].ch[i]); while(!q.empty()) { int now=q.front(); q.pop(); for(int i=0;i<26;i++) if(t[now].ch[i]) { int tmp=t[now].nex; t[t[now].ch[i]].nex=t[tmp].ch[i]; q.push(t[now].ch[i]); } else t[now].ch[i]=t[t[now].nex].ch[i]; }} inline void solve(){ int i=0; int j=0; while(s[i]) { int tt=s[i]-'a'; while(j&&t[j].ch[tt]==0) j=t[j].nex; j=t[j].ch[tt]; if(!j) {i++;continue;} int now=j; while(t[now].cnt!=-1&&now) { ans+=t[now].cnt; t[now].cnt=-1; now=t[now].nex; } i++; } }int main(){ scanf("%d",&T); while(T--) { t[0].init(); tot=0; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%s",aa); insert(aa); } scanf("%s",s); get_nex(); ans=0; solve(); printf("%d\n",ans); }}
- hdu 2222 Keywords Search
- hdu 2222 Keywords Search
- HDU-2222 Keywords Search
- hdu 2222 Keywords Search
- Hdu 2222 Keywords Search
- hdu 2222-Keywords Search
- hdu 2222 Keywords Search
- HDU 2222 Keywords Search
- HDU 2222 Keywords Search
- Hdu 2222 Keywords Search
- HDU 2222 Keywords Search
- HDU 2222 Keywords Search
- HDU 2222 Keywords Search
- hdu 2222 Keywords Search
- HDU 2222 Keywords Search
- hdu 2222 Keywords Search
- HDU 2222 Keywords Search
- HDU - 2222 Keywords Search
- jquery layer弹窗弹层插件 小巧强大
- 设置网格UICollectionView的单元格间距
- 面向对象题
- learn python the hard way(笨办法学python) 练习46
- leetcode--Happy Number
- 【hdu 2222】Keywords Search
- JRockit检测Tomcat内存溢出JAVA内存泄漏问题
- Android学习之异步任务AsyncTask
- 日常开发常用的svn命令
- ViewPager 详解(二)---详解四大函数
- 数据结构之四叉树的实现
- ScrollView与ListView的相关问题
- FlexPaper控件实现文档的上传和预览
- git从gitHub下载代码