ADAPHOTO - Ada and Terramorphing
Ada the Ladybug was already on two trips this year. She visited two countries: Republic of Bugongo and Democratic Republic of Bugongo. Even though those countries are completely different and far far away from each other, Ada found some similarities. Now she is looking at photos from each of those countries and examines similarities. Sadly, both of the sequences of photos are very long so she can't handle it herself.
The sequence of photos is sequence of following terrestrial formations: A hill (^), a valley (v), a plain (-), a lake ~
Find the longest common contiguous subsequence between the two sequences of photos.
Important note: Terramorphism is very difficult process. One can't easily influence it so each of the terrestrial formation is generated with more or less 25%.
The first two and the only lines of input contiguous first and second sequence of photos 1 ≤ |s1|, |s2| ≤ 106
For each test-cases, print the longest common sequence.
Example Input 2
Example Output 2
Example Input 3
Example Output 3
Example Input 4
Example Output 4
Example Input 5
Example Output 5
My submission is with rolling hash with complexity O((log m) * (n)). Gives me WA,
My Suffix Automaton barely passed.
I can't solve suffix array by O(nlogn) with only static arrays... @Morass help please, or say that this task for hashesLast edit: 2019-10-29 22:28:08
i somehow solve it by suffix array O(nlogn^2), and my O(nlogn) just tle, the constrain 2*1e6 is too big for using vector
Maybe suffix array
@Morass The problem statement says to print the longest common contiguous subsequence.But the output shows length of longest common subsequence.Hashing gives WA,Double Hashing gives TLE.Plz Check my solution.