Bzoj 1030: [JSOI2007] Text generator (DP on the AC's own active machine)

1030: [JSOI2007] Text generator time limit: 1 Sec Memory Limit: 162 MB
Submit: 2635 Solved: 1090
[Submit] [Status] [Discuss] Description

Jsoi gave the team ZYX a task. Compile a computer software called a "text generator": The software is used by a few young people who are now using the GW Text Generator version V6. The software can generate some random articles----always generate a fixed length and completely random article--that is, every byte in the generated article is completely random. Suppose an article contains at least one word that the user understands, then we say this article is readable (we call article a including the word B, when and only if the word b is a substring of article a). However, even in accordance with this standard, the V6 version of the GW text generator used by users today is almost completely unreadable. ZYX need to point out the number of readable text in all the text generated by the GW text Generator V6 so that the V7 update can be successfully obtained. Can you help him?

Input

The first line of the input file includes two positive integers. Each user knows the total number of words n (<= 60). The GW Text Generator v6 The resulting text fixed length m; The following n lines, each line includes a word that the user understands.

The length of all words and text in this place will not exceed 100, and may include only capital letters a. Z.

Output

An integer that represents the total number of possible articles. Only need to know the value of the result modulus 10007.

Sample Input2 2
A
BSample Output -

AC DP on the active machine
DP[0][I][J] Indicates the number of strings that do not meet the conditions in the J state to the first I bit
DP[1][I][J] Indicates the number of strings that meet the condition at the end of the first position

#include <iostream> #include <cstdio> #include <cstring> #include <algorithm>using namespace std;const int N = 6005;const int MOD = 10007;int Que[n], FR, ta;struct ACM {int cnt;int nxt[n][26], sum[n], fail[n];void i NIT () {for (int i = 1; I <= cnt; ++i) {sum[i] = fail[i] = 0;for (int j = 0; J <; ++j) nxt[i][j] = 0;} CNT = 1;for (int i = 0; i <; ++i) nxt[0][i] = 1;} void Insert (String str) {int now = 1;int len = str.length (), for (int i = 0; i < len; ++i) {if (Nxt[now][str[i]-' A '] = = 0) Nxt[now][str[i]-' a '] = ++cnt;now = nxt[now][str[i]-' a '];} Sum[now] = 1;} void Build_fail () {fr = Ta = 0;que[ta++] = 1;fail[1] = 0;while (fr! = TA) {int now = que[fr++];for (int i = 0; i < 26; + +) i) {int x = nxt[now][i];if (x = = 0) continue;int tmp = Fail[now];while (nxt[tmp][i] = = 0) tmp = fail[tmp];fail[x] = nxt[tmp] [i];que[ta++] = x;}}} void Debug () {for (int i = 1; I <= cnt, ++i) {cout<<i<< ":" << "fail =" <<fail[i]<< "["; for (int j = 0; J &LT 26; ++J) {if (Nxt[i][j]) Cout<<char (j + ' A ') << ', ' <<nxt[i][j]<< ';} Puts ("]");}} void Gao (int, int);} Acm;int dp[2][105][n];void Acm::gao (int N, int m) {build_fail ();//debug () memset (DP, 0, sizeof (DP));DP [0][0][1] = 1;for ( int i = 1; I <= m; ++i) {for (int j = 1; j <= cnt; ++j) {int u = j;for (int k = 0; k <; ++k) {int v = u;while (nxt[v][k] = = 0) v = fail [V];V = Nxt[v][k];if (Sum[v]) {Dp[1][i][v] = (Dp[1][i][v] + dp[1][i-1][u] + dp[0][i-1][u])% mod;dp[0][i][v] + = 0;} els e {Dp[1][i][v] = (Dp[1][i][v] + dp[1][i-1][u])% mod;dp[0][i][v] = (Dp[0][i][v] + dp[0][i-1][u])% MOD;}}} int ans = 0;for (int i = 1; I <= cnt; ++i) ans = (ans + dp[1][m][i])% Mod;cout<<ans<<endl;}  String Str[65];bool ok (int x, int n) {int len = str[x].length (); for (int i = 0; i < n; ++i) {if (i = = x) continue;int pos = Str[x].find (Str[i]); if (pos >= 0 && Pos < len) return false;} return true;} int main () {int n, m;cin>>n>>m;acm.init ();t i = 0; I < n; ++i) {cin>>str[i];} Sort (str, str + n), n = unique (str, str + N)-str;for (int i = 0; i < n; ++i) {if (ok (i, n)) Acm.insert (Str[i]);} Acm.gao (n, m); return 0;}

Bzoj 1030: [JSOI2007] Text generator (DP on the AC's own active machine)