| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
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.
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.net/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.