# | User | Rating |
---|---|---|
1 | tourist | 3771 |
2 | jiangly | 3688 |
3 | Um_nik | 3539 |
4 | slime | 3498 |
5 | djq_cpp | 3486 |
6 | MiracleFaFa | 3466 |
7 | ksun48 | 3452 |
8 | Radewoosh | 3406 |
9 | greenheadstrange | 3393 |
10 | xtqqwq | 3382 |
# | User | Contrib. |
---|---|---|
1 | -is-this-fft- | 183 |
2 | awoo | 181 |
3 | YouKn0wWho | 177 |
4 | Um_nik | 175 |
5 | dario2994 | 172 |
6 | Monogon | 171 |
7 | adamant | 168 |
7 | maroonrk | 168 |
9 | antontrygubO_o | 166 |
10 | errorgorn | 164 |
Name |
---|
std::map sorts key values, so while iterating them you go from less to bigger and that's what you need for this problem. However, unordered_map does not sort them and it leads to WA.
TooNewbie but why we need order to be sorted . why we need to iterate from lesser to higher . ?
You need to minimize the value of mp[1] since the possibility of traveling to that point is enough to visit all positions. While considering the values from lower to higher and if you had 1 in your map, it will appear earlier, consequently, you will find more optimal choices for mp[1].
okay , i understand . basically u r saying , for a particular mp[gcd] value , we have to check all pair , if we use un.map then some values may skip which will reduce our optimallity .
for the help.