Oulipo(KMP)

Oulipo
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 18994 Accepted Submission(s): 7436

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

思路：kmp模板即可，但是刚开始使用没有加速io，超时。改正后AC。

//1686
#include <iostream>
using namespace std;
#define MAXN 1000005
#define MAXM 10005
int Next[MAXN];
string s1,s2;
int cnt=0;

void makeNext(string s1,int Next[]){
    int q,k;
    int m=s1.length();
    Next[0]=0;
    for(int q=1,k=0;q<m;q++){   
        while(k>0 && s1[q]!=s1[k])
            k=Next[k-1];
        if(s1[q]==s1[k]){
            k++;
        }
        Next[q]=k;
    }
}
void kmp(string s1,string s2,int Next[]){
    int n,m,i,q;
    n=s2.length();
    m=s1.length();
    makeNext(s1,Next);
    for(i=0,q=0;i<n;i++){
        while(q>0 && s1[q]!=s2[i])
            q=Next[q-1];
        if(s1[q]==s2[i])
            q++;
        if(q==m){
            cnt++;

        }
    }

}
int main(){
    std::ios::sync_with_stdio(false);  
    int t;
    cin>>t;
    while(t--){
        cnt=0;
        cin>>s1>>s2;
        kmp(s1,s2,Next);
        cout<<cnt<<endl;
    }
    return 0;

}