Of course, it was a great round, but I guess I have a nice summary of it here:
Of course, it was a great round, but I guess I have a nice summary of it here:
Can anyone help me to describe the algorithm for solving this APIO 2012 Kunai?
http://apio-olympiad.org/2012/apio2012-official.pdf
Thanks XD
Hello kids,
I recently learned algorithm for finding bridge edges, but I couldn't find a clean code on it. Can anyone provide a nice implementation for the algorithm (I think it call Tarjan) for finding bridge edges?
Thanks very much!
Hello kids,
I am having a bit trouble with this problem from the IOI 1995. I solved part (1) by removing each node and checking for connectivity, but I cannot know how to solve part two, or give some reformulating in terms of graph theory. I cannot really understand what this part B is saying or asking for. (Some simple condition like part (1))
Does anyone have any ideas?
Thanks very much!