HDU 2825(Wireless Password-AC自动机+状压dp)

给m<=10个字符串(len<=10),问长度为n<=25的字符串中至少覆盖这m个串中k个的数的个数

裸AC自动机，然而tle 的不行
后来卡常过了C++,G++ TLE,
把自动机的class改成namespace过的G++,C++TLE了
选编译器是一门玄学。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
#include<iomanip> 
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<sstream>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (20090717)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
typedef int ll;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXNode (100+10)
#define Sigma_size (26)
queue<int> q;
namespace T
{
    int ch[MAXNode][Sigma_size];
    int v[MAXNode],siz;
    // AC自动机 
    int f[MAXNode],last[MAXNode];
    void mem(int _siz=0){siz=_siz;MEM(ch[0]) v[0]=f[0]=last[0]=0;   }
    int idx(char c){return c-'a';}
    void insert(char *s,int val) //val不为0 表示str末尾 
    {
        int u=0,n=strlen(s);
        Rep(i,n)
        {
            int c=idx(s[i]);
            if (!ch[u][c])
            {
                ++siz;
                MEM(ch[siz]);
                v[siz]=last[siz]=f[siz]=0;
                ch[u][c]=siz;
            }
            u=ch[u][c];
        }
        v[u]|=val;
    }
    void getFail()
    {
        Rep(c,Sigma_size)
        {
            int u=ch[0][c];
            if (u) q.push(u),last[u]=0;
        }
        while (!q.empty())
        {
            int r=q.front();q.pop();  //r--c-->u
            Rep(c,Sigma_size)
            {
                int u=ch[r][c];
                if (!u) {ch[r][c]=ch[f[r]][c]; continue;} 
                q.push(u);
                f[u]=ch[f[r]][c];
                last[u]=v[f[u]]?f[u]:last[f[u]];
                v[u]|=v[last[u]]; 
            }
        }
    }
}
int n,m,k;
ll f[30][MAXNode][1<<10];
ll bit1[1<<10]={0};
void prework() {
    Rep(i,1<<10) bit1[i]=bit1[i/2]+(i&1);   
}
char s[11];
int main()
{
    prework();
    while(scanf("%d%d%d",&n,&m,&k)!=EOF&&(n+m+k)) {
        T::mem();
        Rep(i,m) {
            scanf("%s",s);
            T::insert(s,1<<i);  
        }   
        T::getFail();
        ll S=1<<m;
        Rep(i,n+1) Rep(j,S) Rep(k,T::siz+1) f[i][k][j]=0;
        f[0][0][0]=1;
        Rep(i,n) Rep(j,T::siz+1) Rep(D,S) if (f[i][j][D]){
            Rep(t,26) {
                int ne=T::ch[j][t],st=D|T::v[ne];
                upd(f[i+1][ne][st],f[i][j][D]);
            }
        }
        ll ans=0;
        Rep(j,T::siz+1) Rep(D,S) if (bit1[D]>=k) 
            upd(ans,f[n][j][D]);
        printf("%d\n",ans);

    }   
    return 0;
}