| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
For a practice problem of bitmask in Topic Stream Mashup: Bitwise Operations
( If not opening , click HERE )
I wrote 2 solutions ( Solution1 , Solution2 )
Solution1 is accepted
But Solution2 is showing Memory Limit Exceeded even for testcase1
Can Anyone explain why this happening?
The only change between the two codes is shown here ->
Even if mask is not in the map, the operator[] will insert it and default initialize the value with 0.
yes, but for the first test case n is 3, which is very small, even if I consider 26 unique cases for each of the 3 masked values it should not be too much for a map to handle right? I am not getting that point.
The problem is that you are iterating over cnt while also adding additional entries to it. This could lead to RTE but in your case it seems to end up in a cascade of inserts...
But you change the outer loop's mask value to any constant value instead of x.ff , the overall thing works fine without any problem, how is this happening?
suppose initially cnt only contains the entry for 1. then in the first iteration, you will insert 0,2,4,8,... in the next iteration, you may take the entry 2 and will insert the values 3,0,6,10,... in the end, you could end up with 2^26 entries in the map. (Note that this is just an example. We don't really know in which order you will iterate over the entries in the map)