well, can be solved in O(1) time after O(m2) space and time preprocessing.Using a suffix trie, it can be solved in O(m) time after preprocessing of O(m2) time and space.
However, we want to solve the problem in O(1) for each question.
So our next idea is to construct a two-dimensional look-up table
For a string of length m , since the number of the factor is O(ｍ2), the size of such table becomes O(ｍ4).
Therefore we need O(ｍ4) time and space preprocessing.
we gave a new solution, which solves the factor concatenation problem in O(1) time after O(ｍ2) time and space preprocessing.

Answered by R.P. Singh , an ibibo Master, at 6:40 PM on July 22, 2008

well, can be solved in O(1) time after O(m2) space and time preprocessing.Using a suffix trie, it can be solved in O(m) time after preprocessing of O(m2) time and space.
However, we want to solve the problem in O(1) for each question.
So our next idea is to construct a two-dimensional look-up table
For a string of length m , since the number of the factor is O(ｍ2), the size of such table becomes O(ｍ4).
Therefore we need O(ｍ4) time and space preprocessing.
we gave a new solution, which solves the factor concatenation problem in O(1) time after O(ｍ2) time and space preprocessing.

Answered by Raksha , an ibibo Master, at 10:53 PM on July 20, 2008

well, can be solved in O(1) time after O(m2) space and time preprocessing.Using a suffix trie, it can be solved in O(m) time after preprocessing of O(m2) time and space.
However, we want to solve the problem in O(1) for each question.
So our next idea is to construct a two-dimensional look-up table
For a string of length m , since the number of the factor is O(ｍ2), the size of such table becomes O(ｍ4).
Therefore we need O(ｍ4) time and space preprocessing.
we gave a new solution, which solves the factor concatenation problem in O(1) time after O(ｍ2) time and space preprocessing.

Answered by Rocky , an ibibo Master, at 8:34 PM on July 19, 2008

well, can be solved in O(1) time after O(m2) space and time preprocessing.Using a suffix trie, it can be solved in O(m) time after preprocessing of O(m2) time and space.
However, we want to solve the problem in O(1) for each question.
So our next idea is to construct a two-dimensional look-up table
For a string of length m , since the number of the factor is O(ｍ2), the size of such table becomes O(ｍ4).
Therefore we need O(ｍ4) time and space preprocessing.
we gave a new solution, which solves the factor concatenation problem in O(1) time after O(ｍ2) time and space preprocessing.

Answered by Ashish Yadav , an ibibo Wizard, at 2:07 PM on July 16, 2008

well, can be solved in O(1) time after O(m2) space and time preprocessing.Using a suffix trie, it can be solved in O(m) time after preprocessing of O(m2) time and space.
However, we want to solve the problem in O(1) for each question.
So our next idea is to construct a two-dimensional look-up table
For a string of length m , since the number of the factor is O(ｍ2), the size of such table becomes O(ｍ4).
Therefore we need O(ｍ4) time and space preprocessing.
we gave a new solution, which solves the factor concatenation problem in O(1) time after O(ｍ2) time and space preprocessing.

Answered by Ni .. , an ibibo Master, at 7:27 PM on July 15, 2008

well, can be solved in O(1) time after O(m2) space and time preprocessing.Using a suffix trie, it can be solved in O(m) time after preprocessing of O(m2) time and space.
However, we want to solve the problem in O(1) for each question.
So our next idea is to construct a two-dimensional look-up table
For a string of length m , since the number of the factor is O(ｍ2), the size of such table becomes O(ｍ4).
Therefore we need O(ｍ4) time and space preprocessing.
we gave a new solution, which solves the factor concatenation problem in O(1) time after O(ｍ2) time and space preprocessing.

Answered by .... ..... , an ibibo Master, at 8:15 PM on July 14, 2008

well, can be solved in O(1) time after O(m2) space and time preprocessing.Using a suffix trie, it can be solved in O(m) time after preprocessing of O(m2) time and space.
However, we want to solve the problem in O(1) for each question.
So our next idea is to construct a two-dimensional look-up table
For a string of length m , since the number of the factor is O(ｍ2), the size of such table becomes O(ｍ4).
Therefore we need O(ｍ4) time and space preprocessing.
we gave a new solution, which solves the factor concatenation problem in O(1) time after O(ｍ2) time and space preprocessing.

Answered by Romi , an ibibo Master, at 10:17 AM on July 09, 2008

It can be solved in O(1) time after O(m2) space and time preprocessing.Using a suffix trie, it can be solved in O(m) time after preprocessing of O(m2) time and space.
However, we want to solve the problem in O(1) for each question.
So our next idea is to construct a two-dimensional look-up table
For a string of length m , since the number of the factor is O(ｍ2), the size of such table becomes O(ｍ4).
Therefore we need O(ｍ4) time and space preprocessing.
we gave a new solution, which solves the factor concatenation problem in O(1) time after O(ｍ2) time and space preprocessing.

Answered by Om Prakash , an ibibo Master, at 5:30 PM on June 28, 2008

can be solved in O(1) time after O(m2) space and time preprocessing.Using a suffix trie, it can be solved in O(m) time after preprocessing of O(m2) time and space.
However, we want to solve the problem in O(1) for each question.
So our next idea is to construct a two-dimensional look-up table
For a string of length m , since the number of the factor is O(ｍ2), the size of such table becomes O(ｍ4).
Therefore we need O(ｍ4) time and space preprocessing.
we gave a new solution, which solves the factor concatenation problem in O(1) time after O(ｍ2) time and space preprocessing.

Answered by Shobhit , an ibibo Master, at 6:26 PM on June 27, 2008

well, can be solved in O(1) time after O(m2) space and time preprocessing.Using a suffix trie, it can be solved in O(m) time after preprocessing of O(m2) time and space.
However, we want to solve the problem in O(1) for each question.
So our next idea is to construct a two-dimensional look-up table
For a string of length m , since the number of the factor is O(ｍ2), the size of such table becomes O(ｍ4).
Therefore we need O(ｍ4) time and space preprocessing.
we gave a new solution, which solves the factor concatenation problem in O(1) time after O(ｍ2) time and space preprocessing.

Answered by Saurabh , an ibibo Master, at 7:54 AM on June 27, 2008