平庸的字符串问题 - Problem

#8983. 平庸的字符串问题

Statistics

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

给定两个字符串 $s$ 和 $t$，计算满足以下条件的元组 $(i, j, k)$ 的数量：

$1 \le i \le j \le |s|$
$1 \le k \le |t|$
$j - i + 1 > k$
$s$ 的第 $i$ 个字符到第 $j$ 个字符，与 $t$ 的第 $1$ 个字符到第 $k$ 个字符拼接而成的字符串是一个回文串。

回文串是指正读和反读都相同的字符串，例如 “abcba” 或 “xyzzyx”。

输入格式

第一行包含字符串 $s$ ($2 \le |s| \le 10^6$)。第二行包含字符串 $t$ ($1 \le |t| < |s|$)。$s$ 和 $t$ 均仅包含小写拉丁字母。

输出格式

满足条件的元组数量。

样例

输入 1

ababa
aba

输出 1

输入 2

aabbaa
aabb

输出 2

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0