【HDU 6153】A Secret （KMP）

Problem Description

---

Today is the birthday of SF,so VS gives two strings S1,S2 to SF as a present,which have a big secret.SF is interested in this secret and ask VS how to get it.There are the things that VS tell:

Suffix(S2,i) = S2[i...len].Ni is the times that Suffix(S2,i) occurs in S1 and Li is the length of Suffix(S2,i).Then the secret is the sum of the product of Ni and Li.

Now SF wants you to help him find the secret.The answer may be very large, so the answer should mod 1000000007.

Input

---

Input contains multiple cases.

The first line contains an integer T,the number of cases.Then following T cases.

Each test case contains two lines.The first line contains a string S1.The second line contains a string S2.

1<=T<=10.1<=|S1|,|S2|<=1e6.S1 and S2 only consist of lowercase ,uppercase letter.

Output

---

For each test case,output a single line containing a integer,the answer of test case.

The answer may be very large, so the answer should mod 1e9+7.

Sample Input

2
aaaaa
aa
abababab
aba

Sample Output

13
19

题解

---

将两个串反转，再进行普通的kmp匹配。

记录模式串的每个前缀(即反转前的后缀)出现的次数，考虑kmp的next数组，f[i]代表1_i包含1f[i]，那么ans[f[i]]+=ans[i];

参考代码

#include <map>
#include <queue>
#include <cmath>
#include <cstdio>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define ll long long
#define inf 1000000000
#define PI acos(-1)
#define REP(i,x,n) for(int i=x;i<=n;i++)
#define DEP(i,n,x) for(int i=n;i>=x;i--)
#define mem(a,x) memset(a,x,sizeof(a))
using namespace std;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void Out(ll a){
    if(a<0) putchar('-'),a=-a;
    if(a>=10) Out(a/10);
    putchar(a%10+'0');
}
const int N=1e6+10;
const int MOD=1e9+7;
char a[N],b[N];
int f[N];
ll ans[N];
void get_next(){
    int m=strlen(b);
    f[0]=f[1]=0;
    for(int i=1;i<m;i++){
        int j=f[i];
        while(j&&b[i]!=b[j]) j=f[j];
        f[i+1]=b[i]==b[j]?j+1:0;
    }
}
void kmp_count(){
    int n=strlen(a),m=strlen(b);
    int j=0;
    for(int i=0;i<n;i++){
        while(j&&b[j]!=a[i]) j=f[j];
        if(b[j]==a[i]) j++;
        ans[j]++;
        if(j==m){
            j=f[j];
            if(j>m) j=0;
        }
    }
}
int main(){
    int n=read();
    while(n--) {
        scanf("%s%s",a,b);
        reverse(b,b+strlen(b));
        reverse(a,a+strlen(a));
        memset(ans,0,sizeof(ans));
        get_next();kmp_count();
        int m=strlen(b);
        for(int i=m;i>=1;i--) ans[f[i]]+=ans[i];
        ll sum=0;
        for(ll i=1;i<=m;i++){
           sum=(sum+i*ans[i])%MOD;
        }
        printf("%lld\n",sum);
    }
    return 0;
}