CF1466G.Song of the Sirens
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Whoso in ignorance draws near to them and hears the Sirens' voice, he nevermore returns.Homer, Odyssey
In the times of Jason and the Argonauts, it was well known that sirens use the sound of their songs to lure sailors into their demise. Yet only a few knew that every time sirens call a sailor by his name, his will weakens, making him more vulnerable.
For the purpose of this problem, both siren songs and names of the sailors will be represented as strings of lowercase English letters. The more times the sailor's name occurs as a contiguous substring of the song, the greater danger he is in.
Jason found out that sirens can sing one of the n+1 songs, which have the following structure: let si ( 0≤i≤n ) be the i -th song and t be a string of length n , then for every i<n : si+1=sitisi . In other words i+1 -st song is the concatenation of i -th song, i -th letter ( 0 -indexed) of t and the i -th song.
Fortunately, he also knows s0 and t . Jason wonders how many times a sailor's name is mentioned in a particular song. Answer q queries: given the sailor's name ( w ) and the index of a song ( i ) output the number of occurrences of w in si as a substring. As this number can be quite large, output its remainder modulo 109+7 .
输入格式
In the first line of input there are two integers n , q ( $ 1 \leq n, q \leq 10^5$ ) meaning that there are n+1 songs and q queries. In the next two lines strings s0 and t follow ( 1≤∣s0∣≤100,∣t∣=n ).
Next q lines describe the queries; each one contains an integer k ( $ 0 \leq k \leq n$ ), the index of the song sung by the sirens, and a non-empty string w , which is the name of a sailor. All strings in this problem consist only of lowercase English letters, and the sum of lengths of sailors' names does not exceed 106 .
输出格式
Output q lines, i -th of them should contain the remainder modulo 109+7 of the number of occurrences of w in sk .
输入输出样例
输入#1
3 3 aa bcd 2 aba 3 ca 3 aa
输出#1
2 2 8
输入#2
4 5 aba bbac 1 a 3 baca 3 ab 2 bab 4 aba
输出#2
4 0 14 6 28
说明/提示
In the first example songs of the sirens are as follows:
- Song 0 : aa
- Song 1 : aabaa
- Song 2 : aabaacaabaa
- Song 3 : aabaacaabaadaabaacaabaa