| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 9 | Proof_by_QED | 130 |
| 9 | AmShZ | 130 |
make your own hashing method, but it can't be less than O(len of string) for each key as you would need to iterate through each letter. I don't think this is what you wanted to know that is to avoid O(length) but I don't think it is possible
I was asking for some type of optimisation we can do by some sort of precomputation or some optimised way of using hashing to check the match between two strings.I know we can't do better than O(n or nlogn) but i get TLE too many times using it even its complexity is not that much, But because of its high constant factor as computation needed for calculating hash is very much costly leading to high constant factor of time complexity.
You can (but only if you get TLE) forget about the modulo. By storing all the values on
unsigned long long, all the operations will be done modulo $$$2^{64}$$$. This will be a lot faster since%is generally very slow. On the other side you will have a bad modulo...OK>>