Блог пользователя kshitij_coder

Автор kshitij_coder, история, 4 года назад, По-английски

I was trying to solve the question B2 — Social Network (hard version). Question Link: https://codeforces.com/contest/1234/problem/B2

I first tried to code the solution using queue and unordered_map. But that gave me TLE. But when I used a map in place of unordered_map, the solution got accepted. Unordered_map does not keep the keys in a sorted format. Then why did an implementation using maps work better? Please guide me on this.

Thanks in advance!!

  • Проголосовать: нравится
  • -7
  • Проголосовать: не нравится

»
4 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

This is one of the most linked blogs to the issue.

»
4 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Unordered map works in constant time(O(1)) on "Average" but has a worst-case complexity of O(n). Map always works in O(logn) time. I hope this explains you why got TLE in this. Tip: Always use map if the constraints allow!