I sended many times and I know test #3.

<!-- begin test 3 -->
10 10 2 2 10
#........#
#.....####
#...###.##
#........#
#....###.#
#....#.#.#
###.#....#
#.##.###.#
#........#
##########
<!--end test 3 -->

The answer for this input is "Can be rescued by himself"
But how it could be?
The minimum length of the path is 20.

Or speleologist can swim between two diagonal blocks?
But how? the problem description isn't clear about it.

Somebody who has got AC, please, clarify...

  0  1  2  3  2  1  0  0  0  0
  0  2  3  4  3  2  0  0  0  0
  0  3  4  5  0  0  0 11  0  0
  0  4  5  6  7  8  9 10  9  0
  0  3  4  5  6  0  0  0  8  0
  0  2  3  4  5  0 11  0  7  0
  0  0  0  3  0  9 10  9  8  0
  0 11  0  0 11  0  0  0  7  0
  0 11 10  9 10  9  8  7  6  0
  0  0  0  0  0  0  0  0  0  0
This is matrix, that represent maximal possible count of air, in this test. Watch, you can go to (3, 5) and we can receive air, and go to the next. Than we can reach (5, 7) and receive air again. Than go to the (8, 8), and receive air here :) And than we go to the top, and *YAHOO*

Thank you for test3! I got AC...

I just increase D at start, and "rescued by himself" if there remain 2 breaths (not 1) at topmost row.

But is so strange...

Thanks, its such a nice problem but messed up with extremely confusing statement.