POJ1625 Censored!

我只想说一句WCNMLGB 专业WA自动机！

改了3天。。最后。。我把标程大改。。改到和我的几乎一模一样的时候。。AC了。。但是我的程序依然WA。。RNMB

Censored!

Time Limit: 5000MS		Memory Limit: 10000K
Total Submissions: 8184		Accepted: 2211

Description

The alphabet of Freeland consists of exactly N letters. Each sentence of Freeland language (also known as Freish) consists of exactly M letters without word breaks. So, there exist exactly N^M different Freish sentences.

But after recent election of Mr. Grass Jr. as Freeland president some words offending him were declared unprintable and all sentences containing at least one of them were forbidden. The sentence S contains a word W if W is a substring of S i.e. exists such k >= 1 that S[k] = W[1], S[k+1] = W[2], ...,S[k+len(W)-1] = W[len(W)], where k+len(W)-1 <= M and len(W) denotes length of W. Everyone who uses a forbidden sentence is to be put to jail for 10 years.

Find out how many different sentences can be used now by freelanders without risk to be put to jail for using it.

Input

The first line of the input file contains three integer numbers: N -- the number of letters in Freish alphabet, M -- the length of all Freish sentences and P -- the number of forbidden words (1 <= N <= 50, 1 <= M <= 50, 0 <= P <= 10).

The second line contains exactly N different characters -- the letters of the Freish alphabet (all with ASCII code greater than 32).

The following P lines contain forbidden words, each not longer than min(M, 10) characters, all containing only letters of Freish alphabet.

Output

Output the only integer number -- the number of different sentences freelanders can safely use.

Sample Input

2 3 1
ab
bb

Sample Output

5

Source

Northeastern Europe 2001, Northern Subregion

 

#include <cstdio>
#include <map>
#include <cstdlib>
#include <cstring>
#include <queue>
using namespace std;
#define NODE 110
#define For(i,n) for(int i=1;i<=n;i++)
#define For0(i,n) for(int i=0;i<n;i++)
int n,L,m;
map<char,int> hash;
char ch[51];
struct bign{
    int A[300],len;
    bign(){memset(A,0,sizeof(A));len=1;}
    void Print(){
        for(int i=len;i>=1;i--)   printf("%d",A[i]);
        puts("");
    }
}dp[51][NODE];
struct trie{
    int sz,ch[NODE][50];
    int next[NODE],Q[NODE*3];
    bool fn[NODE];
    void init(){sz=0;}
    void insert(char st[]){
        int len=strlen(st),cur=0;
        For0(i,len){
            int id=hash[st[i]];
            if(!ch[cur][id]) {
                ch[cur][id]=++sz;
            }
            cur=ch[cur][id];
        }
        fn[cur]=1;
    }
    void BuildNext(){
        int l=0,r=0;
        For0(i,n) if(ch[0][i]) Q[++r]=ch[0][i];
        while(l<r){
            int cur=Q[++l];
            For0(i,n)
              if(ch[cur][i]){
                  Q[++r]=ch[cur][i];
                  next[ch[cur][i]]=ch[next[cur]][i];
                  if(fn[next[ch[cur][i]]]) fn[ch[cur][i]]=1;
              }
              else ch[cur][i]=ch[next[cur]][i];
        }
    }
}ac;    

bign operator + (bign A,bign B){
    bign C;C.len=max(A.len,B.len);
    for(int i=1;i<=C.len;i++){ 
        C.A[i]+=A.A[i]+B.A[i];
        C.A[i+1]=C.A[i]/10;
        C.A[i]%=10;
    }
    if(C.A[C.len+1]) C.len++;
    return C;
}

void DP(){
    dp[0][0].A[1]=1;
    For(i,L)
        For0(j,ac.sz+1){
            if(ac.fn[j])   continue;
            For0(k,n){
                int cur=ac.ch[j][k];
                if(ac.fn[cur])   continue;
                dp[i][cur]=dp[i-1][j]+dp[i][cur];
            }
        }
    bign ans;
    For0(i,ac.sz+1) if(!ac.fn[i])  ans=ans+dp[L][i];
    ans.Print();
}

int main(){
    char s[51];
    hash.clear();
    scanf("%d%d%d",&n,&L,&m);getchar();gets(ch);
    For0(i,n) hash[ch[i]]=i;
    ac.init();
    For0(i,m){
        gets(s);
        ac.insert(s);
    }
    ac.BuildNext();
    DP();
    return 0;
}

#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 60;
#define clr(a,b) memset(a,b,sizeof(a));
#define For(i,n) for(int i=1;i<=n;i++)
#define For0(i,n) for(int i=0;i<n;i++)
#define Rep(i,l,r) for(int i=l;i<=r;i++)
#define Down(i,r,l) for(int i=r;i>=l;i--)
#define debug printf("TTTTTTTTTT_______TTTTTTTTTT
");
map<char,int> hash;
char T[N],st[N];
int n,m,p;

struct bign{
    int A[300],len;
    bign(){clr(A,0);len=1;}
    void Print(){
        Down(i,len,1)   printf("%d",A[i]);
        puts("");
    }
}dp[N][N],ans;

struct trie{
    int sz,ch[N*10][N],next[N*10],Q[N*10],fn[N*10];
    void init(){sz=0;}
    void insert(char st[]){
        int len=strlen(st),cur=0;
        For0(i,len){
            int id=hash[st[i]];
            if(!ch[cur][id]) {
                ch[cur][id]=++sz;
            }
            cur=ch[cur][id];
        }
        fn[cur]=1;
    }
    void BuildNext(){
        int l=0,r=0;
        For0(i,n) if(ch[0][i]) Q[++r]=ch[0][i];
        while(l<r){
            int cur=Q[++l];
            For0(i,n)
              if(ch[cur][i]){
                  Q[++r]=ch[cur][i];
                  next[ch[cur][i]]=ch[next[cur]][i];
                  if(fn[next[ch[cur][i]]]) fn[ch[cur][i]]=1;
              }
              else ch[cur][i]=ch[next[cur]][i];
        }
   }
}ac;

bign operator + (bign A,bign B){
    bign C;C.len=max(A.len,B.len);
    for(int i=1;i<=C.len;i++){ 
        C.A[i]+=A.A[i]+B.A[i];
        C.A[i+1]=C.A[i]/10;
        C.A[i]%=10;
    }
    if(C.A[C.len+1]) C.len++;
    return C;
}

void DP(){
    dp[0][0].A[1]=1;
    For(i,m)
        For0(j,ac.sz+1){
            if(ac.fn[j])   continue;
            For0(k,n){
                int cur=ac.ch[j][k];
                if(ac.fn[cur])   continue;
                dp[i][cur]=dp[i-1][j]+dp[i][cur];
            }
        }
    For0(i,ac.sz+1) if(!ac.fn[i])  ans=ans+dp[m][i];
    ans.Print();
}

int main(){
    char s[51];
    hash.clear();
    scanf("%d%d%d",&n,&m,&p);getchar();gets(T);
    For0(i,n) hash[T[i]]=i;
    ac.init();
    For0(i,p){
        gets(s);
        ac.insert(s);
    }
    ac.BuildNext();
    DP();
    return 0;
}