zoj3430Detect the Virus(ac自动机）

链接

解码之后是跟普通的自动机求解一下的，只不过解码比较恶心，512=》N》=0 ，所以不能用字符串来存，需要转换成整数来做。

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stdlib.h>
#include<vector>
#include<cmath>
#include<queue>
#include<set>
using namespace std;
#define N 53769
#define NN 15010
#define LL long long
#define INF 0xfffffff
const double eps = 1e-8;
const double pi = acos(-1.0);
const double inf = ~0u>>2;
const int child_num = 258;
char s[NN],vir[NN];
int di[NN*8],od[NN],vv[NN];
bool f[N];
class ACAutomation
{
    private:
    int ch[N][child_num];
    int val[N];
    int fail[N];
    int Q[N];
    int id[258];
    int sz;
   // int dp[2][N][1<<10];
    public:
    void init()
    {
        fail[0] = 0;
        for(int i = 0 ; i < child_num;  i++)
        id[i] = i;
    }
    void reset()//初始化
    {
        memset(ch[0],0,sizeof(ch[0]));
        memset(val,0,sizeof(val));
        sz = 1;
    }
    void insert(int *a,int key,int k)//建立trie树
    {
        int p = 0;
        for( int i = 0; i < k ; i++)
        {
            int c = id[a[i]];
            if(ch[p][c]==0)
            {
                memset(ch[sz],0,sizeof(ch[sz]));
                ch[p][c] = sz++;
            }
            p = ch[p][c];
        }
        val[p] += key;
    }
    void construct()//构建fail指针
    {
        int head = 0,tail = 0,i;
        for(i = 0 ;i < child_num ; i++)
        {
            if(ch[0][i])
            {
                fail[ch[0][i]] = 0;
                Q[tail++] = ch[0][i];
            }
        }
        while(head!=tail)
        {
            int u = Q[head++];
            for(i = 0 ;i < child_num ;i ++)
            {
                if(ch[u][i]!=0)
                {
                    Q[tail++] = ch[u][i];
                    fail[ch[u][i]] = ch[fail[u]][i];
                }
                else
                ch[u][i] = ch[fail[u]][i];
            }
        }
    }
    int work(int *s,int k)
    {
        int p = 0,ans = 0;
        memset(f,0,sizeof(f));
        for(int i = 0; i < k ; i++)
        {
            int d = id[s[i]];
            p = ch[p][d];
            int tmp = p;
            while(tmp!=0&&!f[tmp])
            {
                ans+=val[tmp];
                f[tmp] = 1;
                tmp = fail[tmp];
            }
        }
        return ans;
    }
}ac;
int change(char *a)
{
    int i,k = strlen(a),j;
    int g = 0,gg,num =0 ;
    for(i = 0;i < k ; i++)
    {
        if(a[i]=='=')
        {
            num++;
            continue;
        }
        int x = od[a[i]];gg=0;
        for(j=5;j>=0;j--)
        {
            di[g++]=((x&(1<<j))>0);
        }
    }
    if(num==1)
    g-=2;
    else if(num==2)
    g-=4;
    gg = 0;
    int y = 0;
    for(j = 0 ;j < g ; j++)
    {
        y+=di[j]*(1<<(7-j%8));
        if((j+1)%8==0)
        {
            vv[gg++] = y;
            y = 0;
        }
    }
    return g/8;
}
int main()
{
    int n,i,m;
    for(i = 'A' ; i <= 'Z' ; i++)
    od[i] = i-'A';
    for(i = 'a' ; i <= 'z' ; i++)
    od[i] = 26+i-'a';
    for(i = '0'; i <= '9' ; i++)
    od[i] = 52+i-'0';
    od['+'] = 62,od['/'] = 63;
    ac.init();
    while(scanf("%d",&n)!=EOF)
    {
        ac.reset();
        for(i = 1; i <= n; i++)
        {
            scanf("%s",vir);
            int len = change(vir);
            ac.insert(vv,1,len);
        }
        ac.construct();
        scanf("%d",&m);
        for(i = 1; i <= m ;i++)
        {
            scanf("%s",s);
            int len = change(s);
            printf("%d
",ac.work(vv,len));
        }
        puts("");
    }
    return 0;
}