zoukankan      html  css  js  c++  java
  • Hdu2222——Keywords Search(AC自动机模板题)

    传送门

    Keywords Search

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
    Total Submission(s): 76055    Accepted Submission(s): 26231


    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自动机裸题。 ## 代码 ``` #include #include #include #include #include #include #include using namespace std; queue q; const int N=1e6+5; int bo[N],ch[N][30],p[N],tot,ans; char st[N]; void init() { memset(bo,0,sizeof(bo)); tot=1; ans=0; for (int i=0; i<26; i++) ch[0][i]=1,ch[1][i]=0; } void insert(char *st) { int n=strlen(st),u=1; for (int i=0; i1){ ans+=bo[k]; bo[k]=0; k=p[k]; } u=ch[u][c]; } } int main() { int T; scanf("%d",&T); while (T--){ init(); int n; scanf("%d",&n); for (int i=1; i<=n; i++) scanf("%s",st),insert(st); scanf("%s",st); pre(); find(st); printf("%d ",ans); } return 0; } ``` miao~~~
  • 相关阅读:
    魔术方法之__call与__callStatic方法
    thinkphp5 实现搜索分页能下一页保留搜索条件
    koa2
    mongodb
    nodejs
    小程序
    Vue学习
    js4
    扎心!来自互联网er的2019年度总结,看完笑着流泪……
    谈谈“奋斗逼!”
  • 原文地址:https://www.cnblogs.com/wangyh1008/p/9428290.html
Copyright © 2011-2022 走看看