HDU - 5763 Another Meaning(KMP+DP)

最新推荐文章于 2019-03-24 19:40:30 发布

原创最新推荐文章于 2019-03-24 19:40:30 发布 · 285 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#kmp #dp #字符串

ACM_字符串处理专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种利用KMP算法解决含有双义词的字符串匹配问题的方法。通过计算字符串A中单词B的不同含义数量，展示了如何使用动态规划和KMP算法找到所有可能的解释。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

HDU - 5763

Problem Description
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.

Limits
T <= 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
4
hehehe
hehe
woquxizaolehehe
woquxizaole
hehehehe
hehe
owoadiuhzgneninougur
iehiehieh

Sample Output
Case #1: 3
Case #2: 2
Case #3: 5
Case #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”.

题意：字符串B有两种含义，给出一个字符串A，问它有几种含义。

思路：用KMP算法找出B在A中出现的位置。dp[i]表示A的前i位有几种可能语义，初始值dp[0]=1。对于第i位，很明显至少它有dp[i-1]种可能，如果它是B的最后一位，那么还可以取它的特殊语义，可能数目再加上dp[i-len(B)]。

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

using namespace std;

typedef long long LL;
const int MAXN = 100000 + 5;
const int MAXM = 1000000 + 5;
const int mod = 1000000007;
char A[MAXN], B[MAXM];
int T, nexts[MAXN];
bool vis[MAXN];
LL dp[MAXN];

void Get_Next(int M) {//KMP中的next数组
    int i = 0,j = -1;
    nexts[0] = -1;
    while(i < M) {
        if(j == -1 || B[i] == B[j]) {
            i++;
            j++;
            if(B[i] == B[j]) {
                nexts[i] = nexts[j];
            } else {
                nexts[i] = j;
            }
        } else {
            j = nexts[j];
        }
    }
}

void Get_KMP(int N,int M) {
    int i = 0,j = 0;
    while(i < N && j < M) {
        if(j == -1 || B[j] == A[i]) {
            i ++;
            j ++;
        } else {
            j = nexts[j];
        }
        if(j == M) {
            vis[i - 1] = true;//标记A中出现B(最后一位)
            j = nexts[j];
        }
    }
}
int main() {
    scanf("%d", &T);
    int cas = 1;
    while(T --) {
        scanf("%s%s", A, B);
        memset(vis, false, sizeof(vis));
        int t1 = strlen(A), t2 = strlen(B);
        Get_Next(t2);
        Get_KMP(t1, t2);
        memset(dp, 0, sizeof(dp));
        dp[0] = 1;
        for(int i = 1; i <= t1; i ++) {
            if(vis[i - 1]) dp[i] = dp[i - t2];
            dp[i] = (dp[i] + dp[i - 1]) % mod;
        }
        printf("Case #%d: %lld\n",cas ++,  dp[t1]);
    }
    return 0;
}