Is it good to use unordered map for every dp problem as it could be more memory efficient in comparison to vector in c++
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3741 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3489 |
7 | Radewoosh | 3483 |
8 | Kevin114514 | 3442 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | atcoder_official | 163 |
3 | Um_nik | 162 |
3 | maomao90 | 162 |
5 | adamant | 157 |
5 | -is-this-fft- | 157 |
5 | djm03178 | 157 |
8 | awoo | 155 |
9 | TheScrasse | 154 |
10 | Dominater069 | 153 |
Is it good to use unordered map for every dp problem as it could be more memory efficient in comparison to vector in c++
https://mirror.codeforces.com/blog/entry/129992 in this editorial , the editorial of c, what if the no bad exist, like n = 2, m=2; a == (3 3 5 5 1) b == (5 5 3 3 2) i will not consider the 1,2 as it is at the m+n+1 index so before that no bad exist, am i wrong ?
Name |
---|