What is the most efficient algorithm when the problem gives you a string of N length and asks you to answer in Q queries if the ith word of length M (where M is much lesser than N -> M << N) is contained into 'N length word' ?
Thanks in advance !
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
What is the most efficient algorithm when the problem gives you a string of N length and asks you to answer in Q queries if the ith word of length M (where M is much lesser than N -> M << N) is contained into 'N length word' ?
Thanks in advance !
Name |
---|
Well, if M is really small, you can compute hash for all possible words of size <= M inside the string N. Then, just compute the hash for the ith word and check if the same hash was found inside the string N.
Edit: this would be O(n*m + q*m)
Could anyone tell me if that will work?
You can compute the suffix array for the string of length N and then answer each query in O(M * logN), making the algorithm O(Q * M * logN). If M is small, it should run in time.
I just know a MlogN algorithm. How I will get that in O(M) ?
Yes, you're right. I fixed the typo. I'd need to know the actual constraints, but I guess this solution should be fast enough.
I think you can get O(M) per query using suffix automaton.
Yep. Just build a suffix automaton on the string of length N and after that for each query run a dfs from the start node of the automaton. If you can do all M transitions between the automaton states then the small string is contained in the big one. The time complexity is O(M)*O(Q)=O(M*Q).
I think the most efficient algorithm for this kind of problems is Aho–Corasick