杭电 hdu 2896 病毒侵袭

/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
	Copyright (c) 2011 panyanyany All rights reserved.

	URL   : http://acm.hdu.edu.cn/showproblem.php?pid=2896
	Name  : 2896 病毒侵袭

	Date  : Friday, August 19, 2011
	Time Stage : one hour and half

	Result:
4451523	2011-08-19 16:43:57	Accepted	2896
171MS	32348K	3620 B
C++	pyy


	Test Data:


	Review:
第一次做，AC自动机的题，其实完全可以套模版了，只是有些细节要注意……
出了很多粗心的错误，相当低级的错误，搞到我都不好意思了……
//----------------------------------------------------------------------------*/

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))

#define infinity    0x7f7f7f7f
#define minus_inf    0x80808080

#define MAXSIZE 10009
#define LESSMAX	206
#define N		505
#define M		1009

typedef struct tagNODE {
	int cnt, num ;
	struct tagNODE * child[129], * fail ;
} NODE ;

NODE * tmp, * tmpFail, * newNode, * childNode, * parntNode ;
NODE * queue[LESSMAX * N], * stack[LESSMAX * N] ;

#define root stack[0]

char pattn[LESSMAX], model[MAXSIZE] ;

int n, m ;
int stkPtr ;	// for stack
int head, tial ;		// for queue
int infect[M][N] ;	//, used[N] ; // 一开始使用了used来标记是否已经找到过，不过貌似不用也行
					// 就算主串中连续出现几个相同的病毒串，也没有关系

void makeTrie (int num)
{
	int i, j ;
	int len = strlen (pattn) ;

	tmp = root ;
	for (i = 0 ; i < len ; ++i)
	{
		j = pattn[i] ;
		if (!tmp->child[j])
		{
			newNode			= (NODE *) calloc (1, sizeof (NODE)) ;
			stack[stkPtr++]	= newNode ;
			tmp->child[j]	= newNode ;
		}
		tmp = tmp->child[j] ;
	}
	++ tmp->cnt ;		// 这里的cnt嘛，用处不是很大，貌似光用num就足以解决问题了
	tmp->num = num ;	// 每个字符串结尾都作上标记，表示它来自第几个字符串
//	printf ("tmp: 0x%x, cnt: %d, num: %d\n", tmp, tmp->cnt, tmp->num) ;
}

void makeFail ()
{
	int i ;

	head = tial = 0 ;

	for (i = 0 ; i < 128 ; ++i)
	{
		if (root->child[i])
		{
			root->child[i]->fail = root ;
			queue[tial++] = root->child[i] ;	// 一开始这里写成了queue[tial++] = 0 ; 结果一直错……
		}
	}

	tmp = root ;
	while (head < tial)
	{
		parntNode = queue[head++] ;
		for (i = 0 ; i < 128 ; ++i)
		{
			if (childNode = parntNode->child[i])
			{
				tmpFail = parntNode->fail ;

				// 下面这三句话与void ACAutomation (int num) 中的相同格式三句话，
				// 有异曲同工之妙～～～
				while (tmpFail != root && !tmpFail->child[i])
					tmpFail = tmpFail->fail ;
				childNode->fail = (tmpFail->child[i]) ? tmpFail->child[i] : root ;

//				printf ("tmp: 0x%x, child: 0x%x, cnt: %d, num: %d\n", tmpFail, tmpFail->child[i], tmpFail->cnt, tmpFail->num) ;
/*
				if (tmpFail->child[i])
					childNode->fail = tmpFail->child[i] ;
				else 
					childNode->fail = root ;
*/
				queue[tial++] = childNode ;	// 最后别忘了要入队列，为了防止忘记，特别是当上面的代码
				// 长度相当可观的时候，可以把它先写出来……
			}
		}
	}
}

void ACAutomation (int num) 
{
	int i, j ; 
	int id ;
	int len = strlen (model) ;

	id	= 0 ;
	tmp = root ;
	for (i = 0 ; i < len ; ++i)
	{
		j = model[i] ;
		while (tmp != root && !tmp->child[j])
			tmp = tmp->fail ;
		tmp = (tmp->child[j]) ? tmp->child[j] : root ;

		tmpFail = tmp ;	// 别忘了是给tmp找个分身去做事……tmp不能亲自去做的……
//		printf ("tmpFail: 0x%x, cnt: %d, num: %d\n", tmpFail, tmpFail->cnt, tmpFail->num) ;
		while (tmpFail->cnt /*&& !used[tmpFail->num]*/)
		{
			infect[num][0] = 1 ;
			++ infect[num][tmpFail->num] ;
			tmpFail = tmpFail->fail ;
//			used[tmpFail->num] = 1 ;
		}
	}
}

int main ()
{
	int i, j, cnt ;
	while (scanf ("%d", &n) != EOF)
	{
		getchar () ;

		// initialization
		stkPtr = 1 ;
		stack[0] = (NODE *) calloc (1, sizeof (NODE)) ;
		memset (infect, 0, sizeof (infect)) ;

		for (i = 1 ; i <= n ; ++i)
		{
			scanf ("%s", pattn) ;
			getchar () ;
			makeTrie (i) ;
		}
		makeFail () ;

		scanf ("%d", &m) ;
		getchar () ;
		for (i = 1 ; i <= m ; ++i)
		{
			scanf ("%s", model) ;
			getchar () ;

//			memset (used, 0, sizeof (used)) ;
			ACAutomation (i) ;
		}

		cnt = 0 ;
		for (i = 1 ; i < m ; ++i)
		{
			if (infect[i][0])
			{
				++cnt ;
				printf ("web %d:", i) ;
				for (j = 1 ; j < n ; ++j)
				{
					if (infect[i][j])
					printf (" %d", j) ;
				}
				printf ("\n") ;
			}
		}
		printf ("total: %d\n",cnt) ;
	}
	return 0 ;
}