Submission #1794770

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------------------------------------------------------------------------
#define CMAX 26
#define OFFSET 'a'
struct Node {int nxt[CMAX + 1]; int exist; vector<int> accept;
    Node() : exist(0) { memset(nxt, -1, sizeof(nxt)); }};
struct Trie {
    vector<Node> nodes; int root;Trie() : root(0) { nodes.push_back(Node()); }
    void upd_d(int node, int id) { nodes[node].accept.push_back(id); }
    void upd_c(int node, int child, int id) { ++nodes[node].exist; }
    void add(const string &str, int sindex, int nindex, int id){
        if (sindex == str.size()) upd_d(nindex, id); else {const int c = str[sindex] - OFFSET;
        if(nodes[nindex].nxt[c]==-1){nodes[nindex].nxt[c]=(int)nodes.size();nodes.push_back(Node());}
        add(str, sindex + 1, nodes[nindex].nxt[c], id);upd_c(nindex, nodes[nindex].nxt[c], id);}}
    void add(const string &str, int id) { add(str, 0, 0, id); }
    void add(const string &str) { add(str, nodes[0].exist); }
    int size() { return (nodes[0].exist); }int nodesize() { return ((int)nodes.size()); }};
struct AhoCorasick : Trie {
    static const int FAIL = CMAX; vector<int> correct; AhoCorasick() : Trie() {}
    void build() {correct.resize(nodes.size());
        rep(i, 0, nodes.size()) correct[i] = (int)nodes[i].accept.size();
        queue<int> que; rep(i, 0, CMAX + 1) { if (~nodes[0].nxt[i]) {
        nodes[nodes[0].nxt[i]].nxt[FAIL] = 0;que.emplace(nodes[0].nxt[i]);}else nodes[0].nxt[i] = 0;}
        while(!que.empty()){Node &now=nodes[que.front()];correct[que.front()]+=correct[now.nxt[FAIL]];
        que.pop();for (int i = 0; i < CMAX; i++) {if (now.nxt[i] == -1) continue;
        int fail = now.nxt[FAIL];while (nodes[fail].nxt[i] == -1) fail = nodes[fail].nxt[FAIL];
        nodes[now.nxt[i]].nxt[FAIL] = nodes[fail].nxt[i];auto &u = nodes[now.nxt[i]].accept;
        auto &v = nodes[nodes[fail].nxt[i]].accept;vector<int> accept;
        set_union(begin(u), end(u), begin(v), end(v), back_inserter(accept));u = accept;
        que.emplace(now.nxt[i]);}}}
    int match(const string &str, vector< int > &result, int now = 0) {
        result.assign(size(), 0);int count = 0;for (auto &c : str) {
        while (nodes[now].nxt[c - OFFSET] == -1) now = nodes[now].nxt[FAIL];
        now = nodes[now].nxt[c - OFFSET];count += correct[now];
        for (auto &v : nodes[now].accept) ++result[v];}return count;}
    int next(int now, char c) {while (nodes[now].nxt[c - OFFSET] == -1) now = nodes[now].nxt[FAIL];
        return nodes[now].nxt[c - OFFSET];}
};
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧  
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     
　　　　／　　　＼　 　  |　|     
　　　 /　　 /￣￣￣￣/　　|  
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿  
　 　　　＼/＿＿＿＿/　（u　⊃  
---------------------------------------------------------------------------------------------------*/



int N, M;
string S[101010], T;
mint dp[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;
    AhoCorasick ac;

    rep(i, 0, N) {
        cin >> S[i];
        ac.add(S[i]);
    }
    ac.build();

    cin >> T;
    M = T.size();
    dp[0] = 1;
    int s = ac.root;
    rep(i, 0, M) {
        s = ac.next(s, T[i]);
        fore(j, ac.nodes[s].accept) dp[i + 1] += dp[i - S[j].size() + 1];
    }
    cout << dp[M].get() << endl;
}

Submission Info

Judge Result