HDU2222 Keywords Search (字符串处理-ac自动机)

原创 2015年07月10日 10:27:18

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自动机的详解文章,请参考:www.cppblog.com/mythit/archive/2009/04/21/80633.html

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;

struct Trie {
    int next[500010][26], fail[500010], word[500010];
    int root, L;

    int Newnode() {
        for(int i = 0; i < 26; ++i) {
            next[L][i] = -1;
        }
        word[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'];
        }
        word[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 += word[temp];
                word[temp] = 0;
                temp = fail[temp];
            }
        }
        return res;
    }

};

char buf[1000010];
Trie ac;
int main()
{
    //freopen("out.txt", "w", stdout);
    //freopen("in.txt", "r", stdin);
    int cases;
    int n;
    scanf("%d", &cases);
    while(cases--) {
        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;
}




版权声明:本文为博主原创文章,未经博主允许不得转载。

hdu 2222 Keywords Search(字符串匹配-AC自动机)

Keywords Search Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...

CUGB专题训练之数据结构:E - Keywords Search(HDU 2222 AC自动机经典入门模板题)

E - Keywords Search Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u ...

【HDU2222】【AC自动机模板 测烂为止】Keywords Search

传送门:HDU222 描述: Keywords Search Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/1310...

【AC自动机】HDU2222Keywords Search

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2222 这个题目刚开始还不会,但是轮到了我给我同学讲课,之前就有看过,一直都没懂。就唯一的知道要会AC自...
  • wlxsq
  • wlxsq
  • 2015年11月10日 21:55
  • 303

HDU 2222 Keywords Search(AC自动机)

请不要随便指点别人该怎么做、每个人的人生都应该自己掌握、你给不了别人一切、你也不懂别人的忧伤、                                                  ...

HDU2222-Keywords Search AC自动机

HDU2222-Keywords Search AC自动机算法

AC自动机模板——HDU2222 Keywords Search

Keywords Search Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Oth...

HDU 2222 Keywords Search (AC自动机入门题)

题意: 题解: //先调用PreProcess()初始化 //Insert()添加串 Find()查找串 //get(char s) 返回字符s所对应的编号(考虑字符集合可能是’A’-’Z’或者...
  • Tsaid
  • Tsaid
  • 2012年10月10日 23:13
  • 512

HDU - 2222 Keywords Search AC自动机

题意:给出n个字符串为这些字符串在主串s中出现的个数。 AC自动机 裸的AC自动机,注意下给定模式串可能有一些相同的串,然后按照主串在自动机上遍历即可。 复杂度 O(n)...

hdu 2222 Keywords Search (ac自动机)

题目:http://acm.hdu.edu.cn/showproblem.php?pid=2222 题意:求有多少个模式串出现在文本串里面。 分析:ac自动机模版题。说一下自己对ac自动机的理解,①f...
  • w20810
  • w20810
  • 2015年09月03日 21:20
  • 365
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU2222 Keywords Search (字符串处理-ac自动机)
举报原因:
原因补充:

(最多只允许输入30个字)