题目链接 : POJ3461
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 15876 | Accepted: 6377 |
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
Source
KMP模板题
然后也用hash写了一发
KMP ver
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
using namespace std;
char ori[10005],str[1000005];
int nex[10005];
int main()
{
int t;
scanf("%d",&t);
nex[0]=-1;
while(t--)
{
scanf("%s%s",ori,str);
int i=0,j=-1;
while(ori[i])
{
while(j!=-1 && ori[i]!=ori[j]) j=nex[j];
i++;j++;
if(ori[j]==ori[i]) nex[i]=nex[j];
else nex[i]=j;
}
int ans=0;
i=0,j=0;
while(str[i])
{
while(j!=-1 && str[i]!=ori[j] )
j=nex[j];
++i,++j;
if(ori[j]==0) ans++;
}
printf("%d\n",ans);
}
return 0;
}
Hash ver
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
using namespace std;
char ori[10005],str[1000005];
int main()
{
int t,k=13131;
scanf("%d",&t);
while(t--)
{
scanf("%s%s",ori,str);
int i,len=0;
long long hash=0,temp=1,ha=0;
for(i=0;ori[i];i++)
{
hash=k*hash+ori[i];
ha=k*ha+str[i];
temp*=k;
}
len=i;
int ans=0;
if(hash==ha) ans++;
for(;str[i];i++)
{
ha=k*ha-temp*str[i-len]+str[i];
if(hash==ha) ans++;
}
printf("%d\n",ans);
}
return 0;
}