[kuangbin带你飞]专题十七 AC自动机 B 病毒侵袭

最新推荐文章于 2020-09-11 12:43:05 发布

xmudl

最新推荐文章于 2020-09-11 12:43:05 发布

阅读量201

点赞数

本文链接：https://blog.csdn.net/q3818908/article/details/78081263

版权

http://acm.hdu.edu.cn/showproblem.php?pid=2896

#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int maxn=100010;
struct Trie
{
    int node[maxn][128],fail[maxn],num[maxn],root,L;
     int newnode()
    {
        for(int i = 0;i < 128;i++)
            node[L][i] = -1;
        num[L] = -1;
        return L++;
    }
    void init()
    {
        L = 0;
        root = newnode();
    }
    void insert(char s[],int id)
    {
        int len = strlen(s);
        int now = root;
        for(int i = 0;i < len;i++)
        {
            if(node[now][s[i]] == -1)
                node[now][s[i]] = newnode();
            now=node[now][s[i]];
        }
        num[now]=id;
    }
    void build()
    {
        queue<int>Q;
        fail[root] = root;
        for(int i = 0;i < 128;i++)
            if(node[root][i] == -1)
                node[root][i] = root;
            else
            {
                fail[node[root][i]] = root;
                Q.push(node[root][i]);
            }
        while(!Q.empty())
        {
            int now = Q.front();
            Q.pop();
            for(int i = 0;i < 128;i++)
                if(node[now][i] == -1)
                    node[now][i] = node[fail[now]][i];
                else
                {
                    fail[node[now][i]] = node[fail[now]][i];
                    Q.push(node[now][i]);
                }
        }
    }
    bool used[510];
    bool query(char buf[],int N,int id)
    {
        int len=strlen(buf);
        int now=root;
        memset(used,false,sizeof(used));
        bool flag=false;
        for(int i=0;i<len;i++)
        {
            now=node[now][buf[i]];
            int temp=now;
            while(temp!=root)
            {
               if(num[temp]!=-1) used[num[temp]]=true,flag=true;
                temp=fail[temp];
            }
        }
        if(!flag)return false;
        printf("web %d:",id);
        for(int i=1;i<=N;i++)
            if(used[i])
            printf(" %d",i);
        printf("\n");
        return true;
    }
};
Trie ac;
char buf[maxn];
int main()
{
    int n,m;
    while(scanf("%d",&n) != EOF)
    {
        ac.init();
        for(int i = 1;i <= n;i++)
        {
            scanf("%s",buf);
            ac.insert(buf,i);
        }
        ac.build();
        int ans = 0;
        scanf("%d",&m);
        for(int i = 1;i <= m;i++)
        {
            scanf("%s",buf);
            if(ac.query(buf,n,i))
            ans++;
        }
        printf("total: %d\n",ans);
    }
    return 0;
}
/*
3
aaa
bbb
ccc
2
aaabbbccc
bbaacc
*/