[Codeforces Round #635 (div2)]1337E - Kaavi and Magic Spell[dp]

1337E - Kaavi and Magic Spell[$dp$]

time limit per test	memory limit per test	input	output
2 seconds	256 megabytes	standard input	standard output

Description:

Kaavi, the mysterious fortune teller, deeply believes that one’s fate is inevitable and unavoidable. Of course, she makes her living by predicting others’ future. While doing divination, Kaavi believes that magic spells can provide great power for her to see the future.

Kaavi has a string $T$ of length m and all the strings with the prefix $T$ are magic spells. Kaavi also has a string $S$ of length $n$ and an empty string $A$.

During the divination, Kaavi needs to perform a sequence of operations. There are two different operations:

  Delete the first character of $S$ and add it at the front of $A$.
  Delete the first character of $S$ and add it at the back of $A$.

Kaavi can perform no more than $n$ operations. To finish the divination, she wants to know the number of different operation sequences to make $A$ a magic spell (i.e. with the prefix $T$). As her assistant, can you help her? The answer might be huge, so Kaavi only needs to know the answer modulo $998244353$.

Two operation sequences are considered different if they are different in length or there exists an $i$ that their $i$-th operation is different.

$A$ substring is a contiguous sequence of characters within a string. $A$ prefix of a string $S$ is a substring of $S$ that occurs at the beginning of $S$.

Input

TThe first line contains a string $S$ of length $n(1\le n\le 3000)$.

The second line contains a string $T$ of length $m(1\le m\le n)$.

Both strings contain only lowercase Latin letters.

Output

The output contains only one integer — the answer modulo $998244353$.

---

One Example input

abab
ba

One Example output

12

Two Example input

defineintlonglong
signedmain

Two Example output

0

Three Example input

rotator
rotator

Three Example output

4

Four Example input

cacdcdbbbb
bdcaccdbbb

Four Example output

24

Hit

The first test:

The red ones are the magic spells. In the first operation, Kaavi can either add the first character “a” at the front or the back of $A$, although the results are the same, they are considered as different operations. So the answer is $6\times 2=12$.

---

分析：
题意：
$A$ 串一开始为空串
每次可以取 $S$ 串的第一个字母，放在 $A$ 串的首位置或者末位置
问在放字母的过程中，总共会有多少个串的前缀有 $T$ 串

做法：
万物皆可$dp$只是我不会系列
参考博客 CodeForces - 1337E Kaavi and Magic Spell(dp)

$dp[l][r]$ 表示串 $t$ 在 $[l,r]$ 区间内的可以匹配的种类数
对于 $s[i]$

1. $s[i]==t[l]$，那么 $s[i]$ 可以放在 $t[l]$ 的位置，种类数则为 $dp[l][r]=dp[l][r]+dp[l+1][r]$
   $dp[l+1][r]$ 就是表示 $s[i]$ 放在原本可以匹配好的 $t[l+1\to r]$ 的左边一个位置
2. $s[i]==t[r]$ 同理，表示 $s[i]$ 可以放在 $t[r]$ 的位置
   则种类数为 $dp[l][r]=dp[l][r]+dp[l][r-1]$

至于初始化有两种写法

for(int i = 1; i <= n; ++i)	dp[i][i-1] = 1;

当 $s[i]==t[r]$ 的时候，$dp[r][r]=dp[r][r]+dp[r][r-1]$
就相当于表示这个位置可以选择填进去匹配

或者 如果这个位置可以匹配，我有两种方式，放前面或者放后面（我也不晓得，我自己理解是这样的）

for(int i = 1; i <= m; ++i)
    if(s[1] == t[i])    dp[i][i] = 2;
for(int i = m + 1; i <= n; ++i)
    dp[i][i] = 2;

Code:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e3 + 5;
const int mod = 998244353;

char s[maxn], t[maxn];
ll dp[maxn][maxn]; // t l->r 匹配方案数

int main() {
    scanf("%s%s", s + 1, t + 1);
    memset(dp, 0, sizeof(dp));
    int n = strlen(s + 1), m = strlen(t + 1);
    for(int i = 1; i <= m; ++i)
        if(s[1] == t[i])    dp[i][i] = 2;
    for(int i = m + 1; i <= n; ++i)
        dp[i][i] = 2;
    // for(int i = 1; i <= n + 1; ++i)  dp[i][i-1] = 1;
    for(int i = 1; i <= n; ++i) {
        for(int l = 1, r = l + i - 1; r <= n; ++l, ++r) {
            if(l > m || s[i] == t[l]) // 前插
                dp[l][r] = (dp[l][r] + dp[l + 1][r]) % mod;
            if(r > m || s[i] == t[r]) // 后插
                dp[l][r] = (dp[l][r] + dp[l][r - 1]) % mod;
        }
    }
    ll ans = 0;
    for(int i = m; i <= n; ++i)
        ans = (ans + dp[1][i]) % mod;
    printf("%lld\n", ans);
    return 0;
}

---