Discussion @ 1028. Stars @ Timus Online Judge

O(NlogN) solution,that works 0.078 sec!!!

Posted by Ilya Rasenstein (9 class) 13 Jun 2004 20:19

Cool!

Edited by author 13.06.2004 20:23

Re: O(NlogN) solution,that works 0.078 sec!!!

Posted by [OSTU] Alex Svetkin 22 Sep 2004 01:04

O(n*sqrt(n)) works 0.092... No diff at all :)
BTW, do n*log(n) algorithm involves (binary) trees?

Edited by author 22.09.2004 01:06

Re: O(NlogN) solution,that works 0.078 sec!!!

Posted by Gheorghe Stefan 22 Sep 2004 16:53

Well, N^2 also works!

Re: O(NlogN) solution,that works 0.078 sec!!!

Posted by LeXuS[Alex Kalugin] 22 Sep 2004 17:23

I don't think soo!

Discussion of Problem 1028. Stars