Title |
User |
Message |
Date Posted |

Erroneous Data |
sigkill |
Not that it really needs fixing, but for posterity: Case #1 has m = 0 Cases #5 through #12 have A_i = B_i for some i These violate the specification. See http://wcipeg.com/submissions/status/335913 |
Nov 26, 2015 - 1:42:26 am UTC |

Re: help? |
hansonw1 |
Do a quick time analysis of your code. 1. Your get() code takes log(M) time for the binary search, and on average M/2 time for the insertion. (The binary search is kinda useless, since you insert any... |
May 03, 2009 - 5:03:05 pm UTC |

help? |
Daniel |
Is there anyway to speed up the compression of the nodes in my algorithm? It seems that even compressing the nodes on the TLE cases causes it to TLE... Edit 1: Seems that quicksort times out on the 1... |
May 03, 2009 - 4:32:31 pm UTC |

Hint |
SourSpinach |
Think of this as an undirected graph - the foxlings are nodes, and the friendships are edges. This problem is just asking for the number of separate "connected component" (a component is a group of no... |
Apr 20, 2009 - 2:09:56 am UTC |

Re: Re: ummmmm |
platynumplatypus |
oh crap! i forgot about that. k that makes sense...thanks! |
Mar 11, 2009 - 10:18:49 pm UTC |

Re: ummmmm |
SourSpinach |
Foxling 5 has no friends, so if you give a cracker to him, why would it be divided among 5,8,9??? Keep in mind that the first line of input is NOT a friendship, it's N and M. |
Mar 11, 2009 - 9:35:41 pm UTC |

ummmmm |
platynumplatypus |
shouldn't the output for the sample input be three? because u give one cracker to 6 which will be divided among 6,1,7,3,2. that leaves 4,5,8,9. you give one to 5 and that cracker will be divided among... |
Mar 11, 2009 - 9:17:49 pm UTC |