|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||7||2||2||28.571%|
We are given a rectangular city map comprising n · m squares (1 ≤ n ≤ 100 and 1 ≤ m ≤ 100). The rows of squares of the map are numbered successively from top to bottom by numbers from 1 to n, and the columns from left to right successively from 1 to m. Each square is either free or blocked. Vehicular traffic is allowed only on free squares. From each free square one may move to a free square adjacent to it (i.e. a square that shares a side with it), however one is not allowed to turn back, i.e. to go back to a square X immediately after moving from X to an adjacent square Y.
The Right-Turn Drivers' Club ordered a computer program, which for any two different squares A and B decides whether it is possible to drive from A to B without turning left, and if so, the program finds such a route with the minimal length. The length of a route is the number of all its squares. The squares A and B are also considered squares of the route from A to B.
Write a program that:
NIE("no") in the standard output. If so, the program finds one of the shortest routes without left turns and writes it in the standard output. If at least one of the squares A, B is not free, then the answer is
In the first line of the standard input there are two integers separated by a single space: the number of rows n and the number of columns m. In each of the following n lines of the file there is a description of the corresponding row of the map. Such a description has a form of one word of length m consisting of digits 0 and 1. The digit 0 means that the corresponding square is free, and the digit 1 that it is blocked.
Next, in one line, there are two coordinates of the square A, separated by a single space: the row number not greater than n and the column number not greater than m. In the following line there are two coordinates of the square B, written the same way.
The data in the standard input are written correctly and your program need not verify that.
The following should be written in the standard output:
NIE, if there exist no route without left turns from A to B or at least one of the squares A, B is blocked.
8 9 010011101 011010101 000000000 111010101 101000100 111010101 000000000 101011111 2 6 3 8
12 2 6 3 6 4 6 5 6 5 5 5 4 4 4 3 4 3 5 3 6 3 7 3 8
8 9 010011101 011010101 000000000 111010101 101000100 111010101 000000000 101011111 2 6 1 3