How can i solve following problem using string hashing? SUB_PROB
How can i solve following problem using string hashing? SUB_PROB
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Name |
---|
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.