How can i solve following problem using string hashing? SUB_PROB
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
How can i solve following problem using string hashing? SUB_PROB
Название |
---|
Use Rabin-Karp Algorithm. It uses string hashing.
Ok thanks!
Isn't the time limit too strict for Rabin-Karp?
Rabin-karp complexity is O(n*m) and this problem time limit is 0.100s. So what will be the better approach?
I couldn't come up with anything using string hashing, but the problem might be solved using suffix array with complexity O(MlogM + N*logM). (still not sure if it's gonna pass since time limit is too tight) You can check it out here.