POJ-3461-Oulipo

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的模板题，但是时间卡的极为严格，我就因为在判断匹配完成时多加了一句让遍历主串的指针往前移动一下就TLE到意识模糊。。。找了一个多小时BUG。。。
代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char t[1000010],p[10010];//子串与主串
int nex[10010];//最长公共前后缀长度
void perfix(int lenp)
{
  int cur=0;
  for(int i=1;i<lenp;i++)
  {
    while(cur>0&&p[i]!=p[cur])cur=nex[cur-1];//递归得到匹配点
    if(p[i]==p[cur]) cur++;
    nex[i]=cur;
  }
}
int kmp(int lent,int lenp)
{
  int cur=0,ans=0;
  for(int i=0;i<lent;i++)
  {
    while(cur>0&&p[cur]!=t[i])cur=nex[cur-1];//递归寻找匹配点
    if(t[i]==p[cur])cur++;//匹配到，指针移动
    if(cur==lenp)
    {
      cur=nex[cur-1];
    //  i--;//一开始加了这一行TLE到意识模糊，后来发现这一行可以不加，去掉后就AC了
      ans++;
    }
  }
  return ans;
}
int main()
{
  int T;
  scanf("%d",&T);
  while(T--)
  {
    scanf("%s %s",p,t);
    int lenp=strlen(p),lent=strlen(t);
    perfix(lenp);
    printf("%d\n",kmp(lent,lenp));
  }
}