Hello Codeforces community!
I have a question regarding question B in the recent CodeTon round.
My solution passed all pretests, but TLE on test 22 in the main tests. My code is: 150736681
I used an unordered_set
to keep tracking of the seen elements. However, when I changed it to set
, the solution passed main tests too. I have always thought that unordered_set
is faster than set
. Can someone please explain to me what's happening here?
Thanks for any help!
Read Blowing up unordered_map
Hi codemastercpp,
Thanks for your prompt reply!
Should I always use
set
instead ofunordered_set
? How should I decide which one to use?if complexity allows, I prefer using
set
/map
overunordered_set
/unordered_map
however, if constraints are tight, I usesafe_map
that is described in the blog I mentioned.Got it. Thanks!
https://codeforces.me/blog/entry/68000