27 5
O-O-O-O-O-O-O O-O-O-O-O-O-O
|\ \| | | |/| |\| | | |/ /|
O-O O O O O O-O O O O O O-O
|/ / /| |\ \| |/ /| |\ \ \|
O-O-O-O-O-O-O O-O-O-O-O-O-O

Answer: Just a picture

What can you tell me about test#10? Is it correct?

Can't get it. What in this test case.
P.S. finding bridges from e-maxx with deep of recursion.

I got WA #7 several times. If u also got WA just try this test:

9 5
O-O-O-O-O
|\ \|/ /|
O-O O O-O
|/|\ /|\|
O-O-O-O-O

It helped me to get AC.

I've got wa16 :( Please give me some useful tests.

15 15
O-O-O-O-O-O-O-O
|\| | | | | |/|
O O-O-O-O-O-O O
|\           /|
O-O O-O-O-O O-O
|/ /| | | |\ \|
O O-O O-O O-O O
| | | | | | | |
O O-O O-O O-O O
|\ \| | | |/ /|
O-O O-O-O-O O-O
|/           \|
O O-O-O-O-O-O O
|/| | | | | |\|
O-O-O-O-O-O-O-O

Edited by author 01.10.2009 19:57

In test 17 there is a bridge, that is an edge in connected graph removing which makes the graph disconnected.

Edited by author 03.01.2007 01:20

Edited by author 25.08.2008 23:29

Thanks to author) And I'm the 100 person who've solved it)

Edited by author 12.11.2007 16:16

There are two algorithms of determining a bridge in the graph: simple and advanced. Simple algorithm O(n^2) works more than 1s if written in Java, but less than 1s if written in C++.

I suggest to lower time limit to 0.5s, after that only advanced solutions O(n), (n=number of islands) will be accepted.

Two weeks ago my solution in Java was accepted, recently I tried to submit it and got Crash. Using 'extends Thread' to increase stack size I got Accepted again.

What happened to Java compiler? Was Java 6 installed?


Edited by author 14.01.2007 08:00

 I would be glad if someone could tell me exactly which of the restrictions are nedeed. It is unclear to me why I get WA at test16.. i think that my program works as I expect just that I  have either to many or to less restrictions. which of them are nedeed? and is "Our neighbors were the Twelfth, the Twenty Fourth, and the Thirtieth islands..." relevant???
thanks