bzoj 3172

收获：AC自动机定数组大小时，如果不确定，就定10^6（极限了）

 /**************************************************************
     Problem: 3172
     User: idy002
     Language: C++
     Result: Accepted
     Time:688 ms
     Memory:321164 kb
 ****************************************************************/

 #include <cstdio>
 #include <cstring>
 #include <queue>
 #include <vector>
 #define maxn 1000010
 #define fprintf(...)
 using namespace std;

 struct AC {
     int son[maxn][], ntot;
     int fail[maxn], last[maxn];
     vector<int> vc[maxn];
     int ans[];

     void insert( int id, const char *P ) {
         int u=;
         fprintf( stderr, "insert '%s'\npath:\n", P );
         while() {
             fprintf( stderr, "%d ", u );
             if( *P ) {
                 int c=(*P++)-'a';
                 if( !son[u][c] ) son[u][c]=++ntot;
                 u=son[u][c];
             } else {
                 vc[u].push_back(id);
                 fprintf( stderr, "\n" );
                 return;
             }
         }
     }
     void build() {
         fprintf( stderr, "\n\nbuild\n" );
         queue<int> qu;
         for( int c=; c<; c++ ) {
             int v=son[][c];
             if( !v ) continue;
             qu.push( v );
             fail[v] = last[v] = ;
         }
         while( !qu.empty() ) {
             int u=qu.front();
             qu.pop();
             for( int c=; c<; c++ ) {
                 int v=son[u][c];
                 int w=fail[u];
                 if( !v ) continue;
                 while( w && !son[w][c] ) w=fail[w];
                 fail[v] = son[w][c];
                 last[v] = vc[son[w][c]].size() ? son[w][c] : last[son[w][c]];
                 fprintf( stderr, "fail[%d]=%d  last[%d]=%d\n", v, fail[v], v, last[v] );
                 qu.push(v);
             }
         }
         fprintf( stderr, "\n" );
     }
     void add( int u ) {
         if( !u ) return;
         add(last[u]);
         for( int t=; t<vc[u].size(); t++ )
             ans[vc[u][t]]++;
     }
     void search( const char *T ) {
         int n=strlen(T);
         int u=;
         for( int i=; i<n; i++ ) {
             int c=T[i]-'a';
             while( u && !son[u][c] ) u=fail[u];
             u=son[u][c];
             if( vc[u].size() ) add(u);
             else if( last[u] ) add(last[u]);
         }
     }
 }ac;

 int n;
 char str[];

 int main() {
     scanf( "%d", &n );
     int len=;
     for( int i=; i<=n; i++ ) {
         scanf( "%s", str+len );
         ac.insert( i, str+len );
         len += strlen(str+len);
         str[len++] = 'z'+;
     }
     ac.build();
     ac.search( str );
     for( int i=; i<=n; i++ )
         printf( "%d\n", ac.ans[i] );
 }