POJ——T 3461 Oulipo

http://poj.org/problem?id=3461

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 42698		Accepted: 17154

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

BAPC 2006 Qualification

 

 

①：hash 搞   对于y的任意子串x   hash(x,y)=hash[y]-hash[x]*p^(y-x+1)

 #include <algorithm>
 #include <iostream>
 #include <cstring>
 #include <cstdio>

 using namespace std;

 #define p 147
 #define ull unsigned long long
 char s1[],s2[];
 ull n,ss1,ss2,P;
 ull lens,hs[],ans;

 inline void Get_hash()
 {
     lens=;
     for(ull i=;i<=ss1;i++)
         lens=lens*p+s1[i]-'A';
 }
 inline void Get_hs()
 {
     for(ull i=;i<=ss2;i++)
         hs[i]=hs[i-]*p+s2[i]-'A';
 }
 inline ull Q_pow(ull a,ull b)
 {
     ull ret=,base=a;
     for(;b;b>>=,base*=base)
         if(b&) ret*=base;
     return ret;
 }
 inline ull Check(ull x,ull y)
 {
     return hs[y]-hs[x-]*P;
 }

 int main()
 {
     for(cin>>n;n--;ans=)
     {
         scanf("%s%s",s1+,s2+);
         ss1=strlen(s1+),ss2=strlen(s2+);
         Get_hash(); Get_hs(); P=Q_pow(p,ss1);
         for(ull i=ss1;i<=ss2;i++)
             if(lens==Check(i-ss1+,i)) ans++;
         cout<<ans<<endl;
     }
     return ;
 }

② kmp

 #include <algorithm>
 #include <iostream>
 #include <cstring>
 #include <cstdio>

 using namespace std;

 int n,ss1,ss2;
 char s1[],s2[];
 int lens,next[],ans;

 inline void Get_next()
 {
     int j=;next[]=;
     for(int i=;i<=ss1;i++)
     {
         for(;j>&&s1[i]!=s1[j+];) j=next[j];
         if(s1[i]==s1[j+]) j++;
         next[i]=j;
     }
 }

 inline void kmp()
 {
     int j=;
     for(int i=;i<=ss2;i++)
     {
         for(;j>&&s2[i]!=s1[j+];) j=next[j];
         if(s1[j+]==s2[i]) j++;
         if(j==ss1) ans++,j=next[j];
     }
 }

 int main()
 {
     for(cin>>n;n--;ans=)
     {
         scanf("%s%s",s1+,s2+);
         ss1=strlen(s1+),ss2=strlen(s2+);
         Get_next(); kmp();
         printf("%d\n",ans);
     }
     return ;
 }