I tested for a long time and tried to understand why the thymus mockingly shows me such a mocking number, it's all because of the portals, it's just impossible there, I got so confused in them that I didn't understand how my code worked, in general, how to avoid such a problem. add all sorts of checks near the portals, which is right wherever there are portals, just destroy these portals completely, absolutely

Try this test (if you look neighbour cells in order from -1 left -1 up (11 oclock) clockwise)
4 4
#A#.
#A!.
##.#
.*$.

There can be more than one portal of same type

"Impossible" should start with uppercase 'I'

Try this test

4 4
!###
ABAA
AABA
*##$

The answer is 2

1)
in:
3 5
..*..
!....
....$
out: 3

2)
in:
5 8
....AA.#
.######!
...BA*##
.#######
..B$...B
out: 3

3)
in:
5 8
....AA.#
.######!
....#*##
.#######
..B$...B
out: Impossible

4)
in:
1 3
$*!
out: Impossible

5)
in:
1 3
*!$
out: 2


I have used BFS, but still WA 22 :-(

Edited by author 26.10.2008 13:57

Edited by author 26.10.2008 14:04

Edited by author 26.10.2008 14:17

Try this test:
3 3
##$
#*#
!##
Answer: Impossible

hi, I used bf search and all the things seem to work correctly, but I get WA 45... I have no idea what is my mistake... help me, please :) give me some tests

why?

Good tricky problem

Edited by author 05.12.2012 05:22

How can gelu's army reach the castle in 11 days??

I think my program is correct, but i've gotten wa 27 three times.
Does anyone know what this test iss?

DFS - TL22 1.046s
BFS - Accepted 0.031s

Which answer for test
2 2
#$
!*

Who have AC program, please help.

Is it true that the army must use teleport? Or it can ignore teleport?

Any tests?