HDU 2243 考研路茫茫――单词情结

AC自动机+矩阵，各种恶心的细节。。。dp的矩阵求出后求l + 1阶的右上角第一列和为不符合要求的数目，用总和减去即为答案。int接收l会TLE。

#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;
#define N 20005
#define INF 1000000009
typedef long long LL;
struct Trie {
    Trie *fail;
    Trie *next[27];
    int isword;
    int kind;
};
Trie s[N];
Trie *que[N];
int ptr = 0;
int id(char xxx){
    return xxx - 'a';
}
Trie *NewNode(){
    Trie *p = &s[ptr];
    for(int i = 0; i < 26; i++)p->next[i] = NULL;
    p->fail = NULL;
    p->isword = 0;
    p->kind = ptr++;
    return p;
}
void Insert(char *c, Trie *root){
    int len = strlen(c);
    Trie *p = root;
    for(int i = 0; i < len; i++){
        if(p->next[id(c[i])] == NULL)p->next[id(c[i])] = NewNode();
        p = p->next[id(c[i])];
    }
    p->isword = 1;
}
void Build_fail(Trie *root){
    Trie *tmp = root;
    root->fail = NULL;
    int head = 0, tail = 0;
    que[tail++] = tmp;
    while(head < tail){
        tmp = que[head++];
        for(int i = 0; i < 26; i++){
            if(tmp->next[i] != NULL){
                Trie *p = tmp->fail;
                if(tmp == root)tmp->next[i]->fail = root;
                else {
                    tmp->next[i]->fail = p->next[i];
                    if(p->next[i]->isword)tmp->next[i]->isword = 1;
                }
                que[tail++] = tmp->next[i];
            }
            else {
                if(tmp == root)tmp->next[i] = root;
                else tmp->next[i] = tmp->fail->next[i];
            }
        }
    }
}
char sub[1005];
int n;
struct Mat{
    unsigned long long m[77][77];
}x;
Mat mut(Mat xx, Mat yy){
    Mat ans;
    for(int i = 0; i < ptr * 2; i++){
        for(int j = 0; j < ptr * 2; j++){
            ans.m[i][j] = 0;
            for(int k = 0; k < ptr * 2; k++){
                ans.m[i][j] += xx.m[i][k] * yy.m[k][j];
            }
        }
    }
    return ans;
}
Mat Mpow(Mat a, long long b){
    Mat ret;
    for(int i = 0; i < ptr * 2; i++){
        for(int j = 0; j < ptr * 2; j++){
            ret.m[i][j] = 0;
            if(i == j)ret.m[i][j] = 1;
        }
    }
    while(b){
        if(b & 1)ret = mut (ret, a);
        a = mut (a , a);
        b >>= 1;
    }
    return ret;
}
int main(){
    unsigned long long l;
    while(scanf("%d%I64u", &n, &l) != EOF){
        ptr = 0;
        Trie *root = NewNode();
        for(int i = 0; i < n; i++){
            scanf("%s", sub);
            Insert(sub, root);
        }
        Build_fail(root);
        for(int i = 0; i < ptr * 2; i++){
            for(int j = 0; j < ptr * 2; j++){
                x.m[i][j] = 0;
            }
        }
        for(int i = 0; i< ptr; i++){
            for(int j = 0; j < 26; j++){
                if(!s[i].isword && !s[i].next[j]->isword)
                    x.m[i][s[i].next[j]->kind]++;
            }
        }
        for(int i = 0; i < ptr; i++){
            for(int j = 0; j < ptr; j++){
                x.m[i + ptr][j] = 0;
                x.m[i][j + ptr] = i == j;
                x.m[i + ptr][j + ptr] = i == j;
            }
        }
        x = Mpow(x, l + 1);
        unsigned long long ans = 0;
        Mat mid;
        for(int i = 0; i < ptr; i++){
            for(int j = 0; j < ptr; j++){
                mid.m[i][j] = 0;
                if(i == 0 && j == 0)mid.m[0][0] = 26;
                mid.m[i + ptr][j] = 0;
                mid.m[i][j + ptr] = i == j;
                mid.m[i + ptr][j + ptr] = i == j;
            }
        }
        mid = Mpow(mid, l + 1);
        for(int i = 0; i < ptr; i++)
            ans += mid.m[0][i + ptr];
        for(int i = 0; i < ptr; i++)
            ans -= x.m[0][i + ptr];
        printf("%I64u\n", ans);
    }
    return 0;
}