hdu 1686 Oulipo（求文本串中有多少个模式串）

最新推荐文章于 2023-09-03 18:08:29 发布

vocaloid01

最新推荐文章于 2023-09-03 18:08:29 发布

阅读量249

点赞数

分类专栏： Kmp

本文链接：https://blog.csdn.net/vocaloid01/article/details/88022854

版权

Kmp 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

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 <cstdio>
#include <cstring>

using namespace std;

int next[10005],N,M;
char board[10005];
char str[1000005];

void getNext(){

    int k = -1;
    int j = 0;
    next[0] = -1; 
    while(j<M){
        if(k == -1 || board[j] == board[k]){
            if(board[j+1] == board[k+1]){ 
                next[++j] = next[++k];
            }
            else next[++j] = ++k;
        }
        else {
            k = next[k];
        }
    }
}

int Find(){ 
    getNext();
    int temp1 = 0,temp2 = 0,sum = 0;
    while(temp1<N){
        if(temp2 == -1 || str[temp1] == board[temp2]){
            temp1++;temp2++;
        }
        else{
            temp2 = next[temp2];
        }
        if(temp2 == M){
        	++sum;
        	temp2 = next[temp2];
        }
    } 
    return sum;
}

int main(){
	
	int T;
	while(scanf("%d",&T) != EOF){
		scanf("%s %s",board,str);
		N = strlen(str);
		M = strlen(board);
		printf("%d\n",Find());
	}
	
	return 0;
}