POJ 3461

Description

The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:

Tout avait Pair normal, mais tout s’affirmait faux. Tout avait Fair normal, d’abord, puis surgissait l’inhumain, l’affolant. Il aurait voulu savoir où s’articulait l’association qui l’unissait au roman : stir son tapis, assaillant à tout instant son imagination, l’intuition d’un tabou, la vision d’un mal obscur, d’un quoi vacant, d’un non-dit : la vision, l’avision d’un oubli commandant tout, où s’abolissait la raison : tout avait l’air normal mais…

Perec would probably have scored high (or rather, low) in the following contest. People are asked to write a perhaps even meaningful text on some subject with as few occurrences of a given “word” as possible. Our task is to provide the jury with a program that counts these occurrences, in order to obtain a ranking of the competitors. These competitors often write very long texts with nonsense meaning; a sequence of 500,000 consecutive'T's is not unusual. And they never use spaces.

So we want to quickly find out how often a word, i.e., a given string, occurs in a text. More formally: given the alphabet {'A', 'B', 'C', …, 'Z'} and two finite strings over that alphabet, a word W and a text T, count the number of occurrences of W in T. All the consecutive characters of W must exactly match consecutive characters of T. Occurrences may overlap.

Input

The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:

• One line with the word W, a string over {'A', 'B', 'C', …, 'Z'}, with 1 ≤ |W| ≤ 10,000 (here |W| denotes the length of the string W).
• One line with the text T, a string over {'A', 'B', 'C', …, 'Z'}, with |W| ≤ |T| ≤ 1,000,000.

Output

For every test case in the input file, the output should contain a single number, on a single line: the number of occurrences of the word W in the text T.

Sample Input

3

BAPC
BAPC
AZA
AZAZAZA
VERDI
AVERDXIVYERDIAN

Sample Output

1
3
0

分析：

扩展KMP裸题。

code:

#include<cstdio>
#include<cstring>
#define MAXN 10000
#define MAXM 1000000
using namespace std;
inline int max(int a,int b){return a>b?a:b;}
int t;
int next[MAXN+5],ex[MAXM+5];
char a[MAXN+5],b[MAXM+5];
void getdata(char *s1,char *s2,int *data)
{
	int i,j,k;
	int len1=strlen(s1),len2=strlen(s2);
	for(i=0,j=0;i<len1&&j<len2&&s1[i]==s2[j];i++,j++);
	data[0]=j;
	for(i=1,j=0;i<len1&&j<len2&&s1[i]==s2[j];i++,j++);
	data[1]=j;
	int maxp=0,maxi=1;
	for(i=2;i<len1;i++)
	{
		if(i+next[i-maxi]<maxp)
			data[i]=next[i-maxi];
		else
		{
			for(k=max(i,maxp);k<len1&&k-i<len2&&s1[k]==s2[k-i];k++);
			maxp=k,maxi=i;
			data[i]=(k-i)>0?k-i:0;
		}
	}
}
int main()
{
	scanf("%d",&t);
	while(t--)
	{
		int ans=0;
		scanf("%s%s",a,b);
		int len=strlen(b),cmp=strlen(a);
		memset(next,0,sizeof next);
		memset(ex,0,sizeof ex);
		getdata(a,a,next);
		getdata(b,a,ex);
		for(int i=0;i<len;i++)
			if(ex[i]==cmp)
				++ans;
		printf("%d\n",ans);
	}
}