hdoj 1686 Oulipo

Oulipo

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 7297 Accepted Submission(s): 2922



[align=left]Problem Description[/align]
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.

[align=left]Input[/align]
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.

[align=left]Output[/align]
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.

[align=left]Sample Input[/align]

3
BAPC
BAPC
AZA
AZAZAZA
VERDI
AVERDXIVYERDIAN

[align=left]Sample Output[/align]

1
3
0嗯，题目大意就是说，求第一个字符串在第二个字符串中出现的次数。最基础的KMP next数组应用，这里nextval数组和next数组一样，看个人习惯吧[code]#include<cstdio>
#include<cstring>
#define len 1000010
char str[len],buf[len];
int p[len];
int lens,lenb,cnt;
void getp()
{
int i=0,j=-1;
p[i]=j;
while(i<lens)
{
if(j==-1||str[i]==str[j])
{
i++;
j++;
//			if(str[i]!=str[j])
p[i]=j;
//			else
//				p[i]=p[j];
}
else
j=p[j];
}
}
void kmp()
{
int i=0,j=0;
getp();
while(i<lenb)
{
if(j==-1||buf[i]==str[j])
{
i++;
j++;
}
else
j=p[j];
if(j==lens)
{
cnt++;
}
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%s%s",str,buf);
cnt=0;
lens=strlen(str);
lenb=strlen(buf);
kmp();
printf("%d\n",cnt);
}
return 0;
}

[/code]