hdu 3065

 

 

很裸的ac自动机 之前有一个和它差不多的

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <algorithm>

using namespace std;
#define FF(i,a)  for( int i = 0 ; i < a ; i ++ )
#define CC(m,what) memset(m,what,sizeof(m))

const int NODE = 50*1010;
const int CH = 129;
int chd[NODE][CH] , cnt;//结点个数
int word[NODE];//关键数组，记录每个单词尾结点的信息，每道题目都不一样
int fail[NODE];//传说中的失败指针
int Que[NODE];//辅助队列
int sw[150];//string swap每个字符对应的Index，方便模板化

void Ins(char *a, int val) {
 int p = 0;
 for(; *a ; a ++) {
  int c = sw[*a];
  if(!chd[p][c]) {
   //CC(chd[cnt] , 0);
   memset( chd[cnt], 0, sizeof( chd[cnt] ));
   word[cnt] = 0;
   chd[p][c] = cnt ++;
  }
  p = chd[p][c];
 }
 word[p] = val;
}

void AC() {
 int *s = Que , *e = Que;
 for ( int i = 0; i < CH; i++ )
    if(chd[0][i]) {
  fail[chd[0][i]] = 0;
  *e++ = chd[0][i];
 }
 while(s != e) {
  int p = *s++;
  for ( int i = 0 ; i < CH; i ++ ) {
   if( chd[p][i] ) {
    int v = chd[p][i];
    *e++ = v;
    fail[v] = chd[fail[p]][i];
    //word[v] += word[fail[v]];
    //对word[v]按word[fail[v]]里的内容进行处理
   } else {
    chd[p][i] = chd[fail[p]][i];

   }
  }
 }
}

void init ()
{
    fail[0] = 0;
 for( int i = 0; i < CH; i++ ) sw[i] = i;
//下面两句每次都必须初始化
 //CC(chd[0],0);
 memset( chd[0], 0,sizeof( chd[0] ));
 cnt = 1;
}

//AC()函数处理后 chd[p][i] 就是在p结点进行i转移到达的结点

//char c[1000050];

int main()
{
    int n , m;
    char c;
    char s[1005][55];
    char f[10050];
    //cout << "here" << endl;
    while ( scanf("%d", &n ) != EOF )
    {
        //printf("here\n" );
        init();
        int total = 0;
        getchar();
        for( int i = 1; i <= n; ++i)
        {
            int j = 0;
            while ( (c = getchar() )!= '\n')
            {
                s[i][j] = c;
                j++;
            }
            s[i][j] = '\0';
            Ins( s[i] , i );
            //printf("%s\n" , s );
        }
        //scanf("%d", &m );
        //getchar();
        AC();
        //cout << m << endl;
        int j = 0;
        int ans[1004];
        memset( ans, 0, sizeof( ans ));
        int now = 0;
        while ( (c = getchar()) != '\n')
        {
            now = chd[now][sw[c]];
            //cout << now << endl;
            if ( word[now] )
                ans[word[now]]++;
            //cout << ans[c] << endl;
        }
        for ( int i = 1; i <= n ;i++ )
        {
            if ( ans[i] )
                printf("%s: %d\n" , s[i], ans[i] );
        }
    }
    return 0;
}

/*
aaaaaabbbbbbbcccccccccc
*/