noobied's blog

By noobied, history, 6 years ago, In English

http://mirror.codeforces.com/contest/242/submission/39896396 why my soltion gives TLE while other solution with same approach got accepted Can anyone help me out .Please Don't Downvote i already got -23 Contributions.

UpD:with use of treemap it got accepted but with AbstractMap.SimpleEntry it get tle is it bcz of bad hash function implemented in AbstrtactMap.SimpleEntry ?

  • Vote: I like it
  • -9
  • Vote: I do not like it

| Write comment?
»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

You just answered your own question, HashMap use a hash function which is O(n), however TreeSet is guaranteed to be O(log(n)).