KMP算次数

Oulipo

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15905    Accepted Submission(s): 6318

Problem 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
  
  

#include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<string.h>
#include<map> 
#include<math.h>
#include<set>
#include<queue>
#include<vector>
#include<stack>
using namespace std;
int* buildNext(string P)
{
	unsigned j = 0, m =P.size();
	int *nex = new int[m+1];
	int t = nex[0] = -1;
	while (j < m)
	{
		if (t < 0 || P[j] == P[t])
			nex[++j] = ++t;
		else
			t = nex[t];
	}
	return nex;
	//printf("8");
}
// 在 T 中寻找 P
int Match(string P, string T)
{/是否是子串
	int *next = buildNext(P);
	int i = 0, n = T.size();
	int j = 0, m = P.size();
	while (i < n && j < m)
	{
		if (j < 0 || T[i] == P[j])
			++i, ++j;
		else
			j = next[j];
		if (j >= m)
			return 1;
	}
	return 0;
}
int kmpCount(string P, string T)//出现次数 
{
	int i, n = T.size();
	int j, m = P.size();
	int *next = buildNext(P);
	int _count = 0;
	i = j = 0;
	while (i < n && j < m)
	{
		if (0 > j || T[i] == P[j])
			i++, j++;
		else
			j = next[j];
		if (j == m)
		{
			_count++;
			j = next[j];
		}
	}
	delete[] next;
	return _count;
}
int main()
{
    int n,i,k,j,biao;
    string s1,s2,S,T;
    scanf("%d",&n);
    while(n--)
    {
    	cin>>s1>>s2;
		 printf("%d\n",kmpCount(s1,s2));
    }
}