Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb. Question by Ibrahim Mesecan.
Castle on chessboard
Question:
You have some pieces (blocked cells) on a chessboard
and a castle. Show at least in have many moves the
castle can move to the given destination.
Input specification:
You will be first given 4 integers (x,y) coordinates
of starting and destination cells. Then you will be
given an integer (n) the number of blocked cells.
Each of the following n lines will provide two
integers (x,y) coordinates of the blocked cells.
Output specification:
Show one integer, the length of shortest path.
Show -1, if there is no path.
Sample Input I
1 1 4 5
4
3 3
3 5
4 3
3 4
|
Sample Input II
1 1 4 5
5
1 4
4 4
5 5
3 4
2 4
|
Sample Output I
3
|
Sample Output II
4
|
Для отправки решений необходимо выполнить вход.
|