字符串練習題：【CF235C】 Cyclical Quest(SAM )

來源：http://codeforces.com/contest/235/problem/C

題目：給出一個串S，一個串T。S中有多少個串可以通過“處理”得到串T。

           處理是指，將串分成兩部分，調換順序

CLJ出的題，這是CLJ的官方題解

This problem can be solved by many suffix structures.

I think suffix automaton is the best way to solve it because it is simple and clear.

So let us build a suffix automaton of the input string S.

And consider the query string x.

let us build a string t to be x concatenate x and drop the last char.

so every consecutive sub-string of t with length |x| is a rotation of x.

let us read string t with suffix automaton we've build, and every time take the first char out and add a new char,add the answer by the number of string equal to this current sus-btring of t(which is a rotation of x).

And one more thing,we should consider the repetend of x as well,

C. Cyclical Quest

time limit per test

3 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Some days ago, WJMZBMR learned how to answer the query "how many times does a string x occur in a string s" quickly by preprocessing the string s. But now he wants to make it harder.

So he wants to ask "how many consecutive substrings of s are cyclical isomorphic to a given string x". You are given string s and nstrings xi, for each string xi find, how many consecutive substrings of s are cyclical isomorphic to xi.

Two strings are called cyclical isomorphic if one can rotate one string to get the other one. 'Rotate' here means 'to take some consecutive chars (maybe none) from the beginning of a string and put them back at the end of the string in the same order'. For example, string "abcde" can be rotated to string "deabc". We can take characters "abc" from the beginning and put them at the end of "de".

Input

The first line contains a non-empty string s. The length of string s is not greater than 106 characters.

The second line contains an integer n (1 ≤ n ≤ 105) — the number of queries. Then n lines follow: the i-th line contains the string xi — the string for the i-th query. The total length of xi is less than or equal to 106 characters.

In this problem, strings only consist of lowercase English letters.

Output

For each query xi print a single integer that shows how many consecutive substrings of s are cyclical isomorphic to xi. Print the answers to the queries in the order they are given in the input.

Sample test(s)

input

baabaabaaa
5
a
ba
baa
aabaa
aaba

output

7
5
7
3
5

input

aabbaa
3
aa
aabb
abba

output

2
3
3