A9472 | Three strings
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given three strings $(s_{1},s_{2},s_{3})$ . For each integer $l$ $(1<=l<=min(|s_{1}|,|s_{2}|,|s_{3}|)$ you need to find how many triples ( $i_{1},i_{2},i_{3}$ ) exist such that three strings $s_{k}[i_{k}...\ i_{k}+l-1]$ $(k=1,2,3)$ are pairwise equal. Print all found numbers modulo $1000000007 (10^{9}+7)$ .
See notes if you are not sure about some of the denotions used in the statement.
See notes if you are not sure about some of the denotions used in the statement.
输入格式
First three lines contain three non-empty input strings. The sum of lengths of all strings is no more than $3·10^{5}$ . All strings consist only of lowercase English letters.
输出格式
You need to output $min(|s_{1}|,|s_{2}|,|s_{3}|)$ numbers separated by spaces — answers for the problem modulo $1000000007 (10^{9}+7)$ .
输入输出样例
输入 #1
abc bc cbc
输出 #1
3 1
输入 #2
abacaba abac abcd
输出 #2
11 2 0 0
Consider a string $t=t_{1}t_{2}...\ t_{|t|}$ , where $t_{i}$ denotes the $i$ -th character of the string, and $|t|$ denotes the length of the string.
Then $t[i...\ j]$ $(1<=i<=j<=|t|)$ represents the string $t_{i}t_{i+1}...\ t_{j}$ (substring of $t$ from position $i$ to position $j$ inclusive).
Then $t[i...\ j]$ $(1<=i<=j<=|t|)$ represents the string $t_{i}t_{i+1}...\ t_{j}$ (substring of $t$ from position $i$ to position $j$ inclusive).
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted