HDU 1686 KMP

Oulipo

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

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

题意很简单，求T串在W串中出现的次数

解法

• 在T串后加一个无关字符，’\0’也可以，求长度为T+1的next
• 在匹配串的时候，如果匹配完成，那么++i，这样第i个必定无法匹配，因为是添加的无关字符，那么j=next[T],继续匹配

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cassert>
using namespace std ;

const int N = 1e4 + 11 ;
const int M = 1e6 + 11 ;

char str[M] , pattern[N] ;
int jump[N] ;
int n , m ;

void getjump() {
    int i = 0 , j = -1 ;
    jump[0] = -1 ;
    pattern[m] = '*' ;//无关字符
    while(i < m) {
        if(j == -1 || pattern[i] == pattern[j]) {
            ++i , ++j ;
            if(pattern[i] != pattern[j]) jump[i] = j ;
            else jump[i] = jump[j] ;
        }else j = jump[j] ;
    }
}

void stdfun() {
    int i = 0 , j = 0 ;
    int cnt = 0 ;
    while(i < n) {
        if(j == -1 || str[i] == pattern[j]) {
            ++i , ++j ;
            if(j == m) {//找到一个串
                j = jump[m] ;
                ++cnt ;
            }
        }else j = jump[j] ;
    }
    printf("%d\n" , cnt) ;
}

int main() {
    //freopen("data.in" , "r" , stdin) ;
    int t ;
    scanf("%d" ,&t) ;
    while(t--) {
        scanf("%s%s" , pattern , str) ;
        n = strlen(str) ;
        m = strlen(pattern) ;
        getjump() ;
        stdfun() ;
    }
}