SCU2016-03 A题 trie树 + dp

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <stack>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
#define pr(x) cout << #x << ": " << x << "  "
#define pl(x) cout << #x << ": " << x << endl;
#define pri(a) printf("%d\n",(a))
#define xx first
#define yy second
#define sa(n) scanf("%d", &(n))
#define sal(n) scanf("%lld", &(n))
#define sai(n) scanf("%I64d", &(n))
#define vep(c) for(decltype((c).begin() ) it = (c).begin(); it != (c).end(); it++)
const int mod = 835672545, INF = 0x3f3f3f3f;
const int maxn = 1e5 + 13;
char str[maxn];
ll dp[maxn];
struct node{
    node *son[26];
    bool ok;
    node() {
        memset(son, NULL, sizeof(son));
        ok = false;
    }
};

void add(node *cur)
{
    for (int i = 0; str[i]; i++) {
        if (cur -> son[str[i] - 'a'] == NULL) {
            cur -> son[str[i] - 'a'] = new node;
        }
        cur = cur -> son[str[i] - 'a'];
    }
    cur -> ok = true;
}
bool find(char * str, node *cur)
{
    for (int i = 0; str[i]; i++) {
        if (cur -> son[str[i] - 'a'] == NULL) {
            return false;
        }
        cur = cur -> son[str[i] - 'a'];
    }
    return cur -> ok ;
}


int main(void)
{
    int T; sa(T);
    while (T--) {
        int n; sa(n);
        node *root = new node;
        while (n--) {
            scanf("%s", str);
            add(root);
        }
        dp[0] = 1;
        scanf("%s", str + 1);
        int len = strlen(str) - 1;
        for (int i = 1; i <= len; i++) {
            dp[i] = 0;
            char c = '\0';
            swap(str[i + 1], c);
            for (int j = 1; j <= i; j++) {
                if (find(str + j, root)) (dp[i] += dp[j - 1]) %= mod;
            }
            swap(str[i + 1], c);
        }
        pri(dp[len]);
    }
    return 0;
}