CSU-ACM2017暑期训练12-KMP H

H - 结合dp

 As is known to all, in many cases, a word has two meanings. Such as “hehe”, which not only means “hehe”, but also means “excuse me”.Today, ?? is chating with MeiZi online, MeiZi sends a sentence A to ??. ?? is so smart that he knows the word B in the sentence has two meanings. He wants to know how many kinds of meanings MeiZi can express. 

Input

    The first line of the input gives the number of test cases T; T test cases follow.Each test case contains two strings A and B, A means the sentence MeiZi sends to ??, B means the word B which has two menaings. string only contains lowercase letters.LimitsT <= 30|A| <= 100000|B| <= |A|

Output

    For each test case, output one line containing “Case #x: y” (without quotes) , where x is the test case number (starting from 1) and y is the number of the different meaning of this sentence may be. Since this number may be quite large, you should output the answer modulo 1000000007.

Sample Input

4hehehehehewoquxizaolehehewoquxizaoleheheheheheheowoadiuhzgneninouguriehiehieh

Sample Output

Case #1: 3Case #2: 2Case #3: 5Case #4: 1

Hint

In the first case, “ hehehe” can have 3 meaings: “*he”, “he*”, “hehehe”.In the third case, “hehehehe” can have 5 meaings: “*hehe”, “he*he”, “hehe*”, “**”, “hehehehe”.

#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#include <cstring>#include <queue>using namespace std;const int maxn = 1e5+10, mod = 1000000007;char s[maxn], ss[maxn];int dp[maxn], Next[maxn], len1, len2;bool vis[maxn];void getNext(){    int len = len2;    Next[0] = Next[1] = 0;    int j;    for(int i = 1; i < len; i++){        j = Next[i];        while(j && s[j] != s[i])            j = Next[j];        if(s[j] == s[i])            Next[i + 1] = j + 1;        else            Next[i + 1] = 0;    }}void KMPSearch(){    getNext();    int len = len1, m = len2;    int j = 0;    for(int i = 0; i < len; i++){        while(j && ss[i] != s[j])            j = Next[j];        if(ss[i] == s[j])            j++;        if(j == m)            vis[i+1] = true;    }}int main(){#ifdef TESTfreopen("test.txt", "r", stdin);#endif // TEST    int T, Case = 1;    cin >> T;    while(T--){        memset(dp, 0, sizeof(dp));        memset(vis, false, sizeof(vis));        scanf("%s%s", ss, s);        len1 = strlen(ss); len2 = strlen(s);        KMPSearch();        dp[0] = 1;        for(int i = 1; i <= len1; i++){            dp[i] = dp[i - 1];            if(vis[i])                dp[i] = (dp[i] + dp[i - len2]) % mod;        }        printf("Case #%d: %d\n", Case++, dp[len1]);//        cout << dp[len1] << endl;    }    return 0;}