Discussion @ 1134. Cards @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

back to board

Discussion of Problem 1134. Cards

Hint

Posted by muhammad 16 May 2010 21:20

linear time input + O(nlogn) time sorting + O(n)time availability checking gives ac in .015 sec and 150 kb.
I think better solution is possible. Please, let me know.

Re: Hint

Posted by YSYMYTH 3 Jul 2012 17:30

Use Hash Sort which is O(n)