Oulipo(KMP)

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/chimchim04/article/details/81476929

 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

题目大意:给出子串和母串,求子串在母串中出现的次数。

代码:
 

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define N 1000005
char S[N],T[N];
int nex[N],slen,tlen;
void getnext()
{
    int i=-1,j=0;
    nex[0]=-1;
    while(j<tlen)
    {
        if(i==-1||T[i]==T[j]) nex[++j]=++i;
        else i=nex[i];
    }
}
int KMP_index()
{
    int i=0,j=0;
    while(i<slen&&j<tlen)
    {
        if(j==-1||S[i]==T[j]) i++,j++;
        else j=nex[j];
    }
    if(j==tlen) return i-tlen;
    return -1;
}
int KMP_count()
{
    if(slen==1&&tlen==1)
    {
        if(S[0]==T[0]) return 1;
        else return 0;
    }
    int i,j=0,ans=0;
    for(i=0;i<slen;i++)
    {
        while(j>0&&S[i]!=T[j]) j=nex[j];
        if(S[i]==T[j]) j++;
        if(j==tlen)
        {
            ans++;
            j=nex[j];
        }
    }
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        cin>>T>>S;
        slen=strlen(S);
        tlen=strlen(T);
        getnext();
        printf("%d\n",KMP_count());
    }
    return 0;
}

 

阅读更多

Oulipo

11-14

DescriptionnnThe 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:nnTout 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…nnPerec 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.nnSo 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.nnInputnnThe first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:nnOne 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).nOne line with the text T, a string over 'A', 'B', 'C', …, 'Z', with |W| ≤ |T| ≤ 1,000,000.nOutputnnFor 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.nnSample Inputnn3nBAPCnBAPCnAZAnAZAZAZAnVERDInAVERDXIVYERDIANnSample Outputnn1n3n0

没有更多推荐了,返回首页