POJ 4052 金华邀请赛I题

写了个数组版的ac自动机，感觉还不错

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif

#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a)        for( int i = (a)-1 ; i >= 0 ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 1e-10;
const double pi = acos(-1.0);

const int maxn = 5100011;
const int maxc = 26;
const int head = 0;

struct zz
{
    int to[maxc];
    int fail;
    int you;
}zx[maxn];

bool ok[maxn];
string s[2511];
vector<int>g[2511];
int use,n;
bool over[2511];
bool vis[2511];
queue<int>q;

int get()
{
    use++;
    zx[use].you = 0;
    zx[use].fail = 0;
    MM(zx[use].to,-1);
    return use;
}

string ex(int id)
{
    string re="";
    char c;
    int temp;
    for(int i=0;i<s[id].length();i++)
    {
        c = s[id][i];
        if(c == '[')
        {
            temp = 0;
            while(true)
            {
                i++;
                c = s[id][i];
                if(c<='9' && c>='0')
                {
                    temp*=10;
                    temp += c-'0';
                }
                else if(c<='Z' && c>='A')
                {
                    for(int u=1;u<=temp;u++)
                    {
                        re += c;
                    }
                    break;
                }
            }
            i++;
        }
        else
        {
            re += c;
        }
    }
    return re;
}

void insert(int id,string p)
{
    int now = head;
    int c;
    for(int i=0;i<p.length();i++)
    {
        c = p[i] - 'A';
        if(zx[now].to[c]==-1)
        {
            zx[now].to[c] = get();
            now = zx[now].to[c];
        }
        else
        {
            now = zx[now].to[c];
        }
    }
    if(zx[now].you)
    {
        over[id] = true;
    }
    else
    {
        zx[now].you = id;
    }
    return ;
}

void ac()
{
    CL(q);
    q.push(head);
    int now,to,tmp;
    while(!q.empty())
    {
        now = q.front();
        q.pop();
        for(int i=0;i<maxc;i++)
        {
            if(zx[now].to[i]!=-1)
            {
                to = zx[now].to[i];
                q.push(to);
                tmp = now;
                while(tmp)
                {
                    tmp = zx[tmp].fail;
                    if(zx[tmp].to[i]!=-1)
                    {
                        zx[to].fail = zx[tmp].to[i];
                        break;
                    }
                }
            }
        }
    }
    return ;
}

void find0(int now)
{
    while(now && !ok[now])
    {
        ok[now] = true;
        if(zx[now].you)
        {
            vis[zx[now].you] = true;
        }
        now = zx[now].fail;
    }
    return ;
}

void find(int id,int now)
{
    while(now && !ok[now])
    {
        if(zx[now].you!=id)
        {
            ok[now] = true;
        }
        if(zx[now].you)
        {
            if(zx[now].you!=id)
            {
                vis[zx[now].you] = false;
            }
        }
        now = zx[now].fail;
    }
    return ;
}

void ak(int id,string p)
{
    int now = head;
    int c;
    for(int i=0;i<p.length();i++)
    {
        c = p[i]-'A';
        if(zx[now].to[c]!=-1)
        {
            now = zx[now].to[c];
        }
        else
        {
            while(now)
            {
                now = zx[now].fail;
                if(zx[now].to[c]!=-1)
                {
                    now = zx[now].to[c];
                    break;
                }
            }
        }
        if(id)
        {
            find(id,now);
        }
        else
        {
            find0(now);
        }
    }
    return ;
}

int start()
{
    use = -1;
    get();
    MM(over,false);
    MM(vis,false);
    for(int i=1;i<=n;i++)
    {
        insert(i,ex(i));
    }

    ac();

    for(int i=0;i<=use;i++)
    {
        ok[i] = false;
    }
    ak(0,ex(0));
    for(int i=0;i<=use;i++)
    {
        ok[i] = false;
    }
    for(int i=1;i<=n;i++)
    {
        if(!over[i] && vis[i] )
        {
            ak(i,ex(i));
        }
    }

    int ans = 0;
    for(int i=1;i<=n;i++)
    {
        if(vis[i])
        {
            ans++;
        }
    }
    return ans;
}


int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        cin>>n;

        for(int i=1;i<=n;i++)
        {
            cin>>s[i];
        }
        cin>>s[0];

        cout<<start()<<endl;
    }
    return 0;
}