poj-Oulipo -3461

最新推荐文章于 2023-06-25 08:42:03 发布

灰色头像XXOO

最新推荐文章于 2023-06-25 08:42:03 发布

阅读量420

点赞数

分类专栏： KMP

本文链接：https://blog.csdn.net/u011497404/article/details/9618729

版权

KMP 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

给两个字符串，上面是附属串，下面是主串，输出附属串在主串中出现多少次，在KMP匹配函数中加一个回溯，当j==n时，j=next[i]。

Oulipo

Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 20 Accepted Submission(s) : 8

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

#include<iostream>
#include <cstring>
using namespace std;
char w[10005],t[1000005];
int n,m,nextval[10005],num;
void next()
{
int i=0,j=-1;
nextval[0]=-1;
while(i<m)
{
  if(j==-1||w[i]==w[j])
  {
   i++;
   j++;
   if(w[i]!=w[j])
    nextval[i]=j;
   else
    nextval[i]=nextval[j];
  }
  else
   j=nextval[j];
}
}
int KMP()
{
int i,j;
  num=i=j=0;
while(i<n)
{
  if(j==-1||t[i]==w[j])
  {
   i++;
   j++;
  }
  else
   j=nextval[j];
  if(j==m)
  {
            num++;
   j=nextval[j];
  }

}
return num;
}
int main()
{
int k;
cin>>k;
while(k--)
{
  memset(t,0,sizeof(t));
  memset(w,0,sizeof(w));
  memset(nextval,0,sizeof(nextval));
  cin>>w>>t;
  n=strlen(t);
  m=strlen(w);
        next();
  KMP();
  cout<<num<<endl;
}
return 0;
}