This question is of current Long contest of codechef.. u cant discuss it
On Tue, Apr 9, 2013 at 11:48 PM, anup1pma <anupsingh....@gmail.com> wrote: > hi... any one having idea of MST algo of o(n^2) where n is no. of nodes > and there are n^2 edges... I used fibonacci heaps but still getting TLE.. > > -- > You received this message because you are subscribed to the Google Groups > "Google Code Jam" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to google-code+unsubscr...@googlegroups.com. > To post to this group, send email to google-code@googlegroups.com. > To view this discussion on the web visit > https://groups.google.com/d/msg/google-code/-/Vhgwj5Lt1RYJ. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- Cheers! Sidhant Goyal -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to google-code+unsubscr...@googlegroups.com. To post to this group, send email to google-code@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
