Solitaire
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 2 Accepted Submission(s) : 0
Problem Description
Solitaire is a game played on a chessboard 8x8. The rows and columns of the chessboard are numbered from 1 to 8, from the top to the bottom and from left to right respectively.<br><br>There are four identical pieces on the board. In one move it is allowed to:<br><br>> move a piece to an empty neighboring field (up, down, left or right),<br><br>> jump over one neighboring piece to an empty field (up, down, left or right). <br><br><center><img src=/data/images/1401-1.gif></center><br><br>There are 4 moves allowed for each piece in the configuration shown above. As an example let's consider a piece placed in the row 4, column 4. It can be moved one row up, two rows down, one column left or two columns right.<br><br>Write a program that:<br><br>> reads two chessboard configurations from the standard input,<br><br>> verifies whether the second one is reachable from the first one in at most 8 moves,<br><br>> writes the result to the standard output.<br>
Input
Each of two input lines contains 8 integers a1, a2, ..., a8 separated by single spaces and describes one configuration of pieces on the chessboard. Integers a2j-1 and a2j (1 <= j <= 4) describe the position of one piece - the row number and the column number respectively. Process to the end of file.<br>
Output
The output should contain one word for each test case - YES if a configuration described in the second input line is reachable from the configuration described in the first input line in at most 8 moves, or one word NO otherwise.<br>
Sample Input
4 4 4 5 5 4 6 5<br>2 4 3 3 3 6 4 6<br>
Sample Output
YES<br>
Source
Southwestern Europe 2002