I want to use hash table of key : vector and value : int How can i use that ? Map<vector< int >,int> uses extra logn factor which many a times doesn't suite me and gives TLE. I just want to store frequency of a kind of vector.
Any help is appreciated. Thanks.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
You are taking vector as a key value. There is whole extra factor of n where n is the size of the vector everytime you do operations with map.
That would be okay to me. Just need to make unordered_map instead of map
Can you give link to the problem?
This is my Submission 77023902 , its easy to understand. Problem : 1225D - Power Products
Hey, I solved this problem recently. Hashing the vector won't make a big difference. Try to come with another approach :)
But if you still want to try, polynomial hashing in Robin Karp might be useful here but it will don't give correct answer in every case.
https://codeforces.me/blog/entry/62393?#comment-606294
You can do it by hashing the vector, but if you do that then the complexity will be $$$O(n^2/log$$$ $$$n)$$$, which is still too slow.