zoukankan      html  css  js  c++  java
  • HDU 2222 Keywords Search

    Keywords Search



    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
    #include<cstdio>
    #include<queue>
    #include<string>
    #include<map>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    typedef long long LL;
    const int N=1e6+5;
    const int sigma_size=26;
    const int max_node=500050;
    char text[N],p[10005][55];
    bool vis[max_node];
    int ans;
    struct AhoCorasickAutomata
    {
        int ch[max_node][sigma_size];
        int val[max_node],last[max_node],f[max_node],cnt[max_node];
        int sz;
        inline void init()
        {
            sz=1;
            memset(ch[0],0,sizeof(ch[0]));
            memset(cnt,0,sizeof(cnt));
        }
        inline void Count(int j){if(j&&!vis[j])vis[j]=1,ans+=cnt[j],Count(last[j]);}
        inline int idx(char c){return c-'a';}
        void Insert(char *s,int v)
        {
            int u=0,len=strlen(s);
            for(int i=0;i<len;i++)
            {
                int c=idx(s[i]);
                if(!ch[u][c])
                {
                    memset(ch[sz],0,sizeof(ch[sz]));
                    val[sz]=0;
                    ch[u][c]=sz++;
                }
                u=ch[u][c];
            }
            val[u]=v;
            cnt[u]++;
        }
        void Getfail()
        {
            queue<int>q;
            f[0]=0;
            for(int i=0;i<sigma_size;i++)
            {
                int u=ch[0][i];
                if(u){f[u]=0;q.push(u);last[u]=0;}
            }
            while(!q.empty())
            {
                int r=q.front();q.pop();
                for(int i=0;i<sigma_size;i++)
                {
                    int u=ch[r][i];
                    if(!u){ch[r][i]=ch[f[r]][i];continue;}
                    q.push(u);
                    int v=f[r];
                    while(v&&!ch[v][i])v=f[v];
                    f[u]=ch[v][i];
                    last[u]=(val[f[u]]?f[u]:last[f[u]]);
                }
            }
        }
        void Find(char* s)
        {
            for(int i=0,j=0,len=strlen(s);i<len;i++)
            {
                int c=idx(s[i]);
                j=ch[j][c];
                if(val[j])Count(j);
                else if(last[j])Count(last[j]);
            }
        }
    }ac;
    int main()
    {
        int T;
        scanf("%d",&T);
        while(T--)
        {
            ans=0;
            memset(vis,0,sizeof(vis));
            ac.init();
            int n;
            scanf("%d",&n);
            for(int i=1;i<=n;i++)
                scanf("%s",p[i]),ac.Insert(p[i],i);
            ac.Getfail();
            scanf("%s",text);
            ac.Find(text);
            printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    查询快递单号-宅急送快递接口
    对路由转发的浅显理解
    对SpringCloud Zuul 的基本使用总结
    对SpringCloud Hystrix的使用个人总结
    对SpringBoot开箱即用使用方法的浅显理解
    对SpringCloud Hystrix服务降级的浅显理解
    金玉良言
    2种运行时织入的动态代理模式原理和调用流程比较
    记录手动启动Oracle数据库的方式
    基于SpringBoot搭建一个带数据库访问的WEB项目(记录所需的依赖,配置,驱动安装等注意事项)
  • 原文地址:https://www.cnblogs.com/homura/p/5758940.html
Copyright © 2011-2022 走看看