noobied's blog

By noobied, history, 6 years ago, In English

http://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 ?

Full text and comments »

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

By noobied, history, 6 years ago, In English

How can i implement a Multiset in java which has all functions of treeset such as higher(),lower(),ceiling(),floor() etc. Is there is any way?

Full text and comments »

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

By noobied, history, 6 years ago, In English

How this Solution works even if in priority queue the values stored are not weights.I think for Dijikstra to work we should maintain a priority queue which give the node whose distance is shortest from the source but in this implementation the priority queue gives the smallest node number

LINK:http://codeforces.com/contest/20/submission/30960352

Full text and comments »

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

By noobied, history, 6 years ago, In English

I am not able to solve this question the constraints is very high what should i do QUESTION

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By noobied, history, 6 years ago, In English

HOW TO SOLVE THIS QUESTION QUES

Full text and comments »

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