Problem:
Problem D: Twirling Robot

Let's play a game using a robot on a rectangular board
covered with a square mesh (Figure D-1).
The robot is initially set at the start square in the northwest corner
facing the east direction.
The goal of this game is to lead the robot
to the goal square in the southeast corner.

Figure D-1: Example of a board

The robot can execute the following five types of commands.

"Straight":

Keep the current direction of the robot, and move forward to the next square.

"Right":

Turn right with 90 degrees from the current direction, and move forward to the next square.

"Back":

Turn to the reverse direction, and move forward to the next square.

"Left":

Turn left with 90 degrees from the current direction, and move forward to the next square.

"Halt":

Stop at the current square to finish the game.

Each square has one of these commands assigned as shown in Figure D-2.
The robot executes the command assigned to the square where it resides,
unless the player gives another command to be executed instead.
Each time the player gives an explicit command,
the player has to pay the cost that depends on the command type.

Figure D-2: Example of commands assigned to squares

The robot can visit the same square several times during a game.
The player loses the game when the robot goes out of the board
or it executes a "Halt" command before arriving at the goal square.

Your task is to write a program that calculates the minimum cost to lead the robot
from the start square to the goal one.

Input

The input is a sequence of datasets.
The end of the input is indicated by a line containing two zeros separated by a space.
Each dataset is formatted as follows.

w h

s(1,1) ... s(1,w)

s(2,1) ... s(2,w)

...

s(h,1) ... s(h,w)

c0 c1 c2 c3

The integers h and w are the numbers of rows and columns of the board,
respectively.
You may assume 2 ≤ h ≤ 30 and 2 ≤ w ≤ 30.
Each of the following h lines consists of w numbers delimited by a space.
The number s(i, j) represents the command assigned to the square
in the i-th row and the j-th column as follows.

0: "Straight"

1: "Right"

2: "Back"

3: "Left"

4: "Halt"

You can assume that a "Halt" command is assigned to the goal square.
Note that "Halt" commands may be assigned to other squares, too.

The last line of a dataset contains four integers
c0, c1, c2, and c3, delimited by a space,
indicating the costs that the player has to pay
when the player gives
"Straight", "Right", "Back", and "Left" commands
respectively.
The player cannot give "Halt" commands.
You can assume that all the values of
c0, c1, c2, and c3
are between 1 and 9, inclusive.

Output

For each dataset, print a line only having a decimal integer indicating the minimum cost
required to lead the robot to the goal.
No other characters should be on the output line.

Sample Input

8 3
0 0 0 0 0 0 0 1
2 3 0 1 4 0 0 1
3 3 0 0 0 0 0 4
9 9 1 9
4 4
3 3 4 0
1 2 4 4
1 1 1 0
0 2 4 4
8 7 2 1
2 8
2 2
4 1
0 4
1 3
1 0
2 1
0 3
1 4
1 9 3 1
0 0

Output for the Sample Input

1
11
6

Solution in JAVA (judge verdict: Accepted)

// Twirling Robot
import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int[] dx = { 0, 1, 0, -1 };
		int[] dy = { -1, 0, 1, 0 };
		while (true) {
			int w = sc.nextInt(), h = sc.nextInt();
			if ((w | h) == 0)
				break;
			int[][] field = new int[h][w];
			for (int i = 0; i < h; i++)
				for (int j = 0; j < w; j++)
					field[i][j] = sc.nextInt();
			int[] command = new int[4];
			for (int i = 0; i < 4; i++)
				command[i] = sc.nextInt();
			int[][][] costs = new int[4][h][w];
			for (int k = 0; k < 4; k++)
				for (int i = 0; i < h; i++)
					Arrays.fill(costs[k][i], -1);
			PriorityQueue<Node> queue = new PriorityQueue<Node>();
			queue.add(new Node(0, 0, 0, 'E'));
			while (!queue.isEmpty()) {
				Node node = queue.poll();
				int x = node.x;
				int y = node.y;
				int cost = node.cost;
				if (node.dir == 'N') {
					if (costs[0][y][x] >= 0 && costs[0][y][x] <= cost)
						continue;
					costs[0][y][x] = cost;
					for (int i = 0; i < 4; i++) {
						int tcost = cost;
						if (field[y][x] != i)
							tcost += command[i];
						int tx = x + dx[i];
						int ty = y + dy[i];
						if (tx >= 0 && tx < w && ty >= 0 && ty < h)
							switch (i) {
							case 0:
								queue.add(new Node(tx, ty, tcost, 'N'));
								break;
							case 1:
								queue.add(new Node(tx, ty, tcost, 'E'));
								break;
							case 2:
								queue.add(new Node(tx, ty, tcost, 'S'));
								break;
							default:
								queue.add(new Node(tx, ty, tcost, 'W'));
							}
					}
				}
				if (node.dir == 'E') {
					if (costs[1][y][x] >= 0 && costs[1][y][x] <= cost)
						continue;
					costs[1][y][x] = cost;
					for (int i = 0; i < 4; i++) {
						int tcost = cost;
						if (field[y][x] != i)
							tcost += command[i];
						int tx = x + dx[(1 + i) % 4];
						int ty = y + dy[(1 + i) % 4];
						if (tx >= 0 && tx < w && ty >= 0 && ty < h)
							switch (i) {
							case 0:
								queue.add(new Node(tx, ty, tcost, 'E'));
								break;
							case 1:
								queue.add(new Node(tx, ty, tcost, 'S'));
								break;
							case 2:
								queue.add(new Node(tx, ty, tcost, 'W'));
								break;
							default:
								queue.add(new Node(tx, ty, tcost, 'N'));
							}
					}
				}
				if (node.dir == 'S') {
					if (costs[2][y][x] >= 0 && costs[2][y][x] <= cost)
						continue;
					costs[2][y][x] = cost;
					for (int i = 0; i < 4; i++) {
						int tcost = cost;
						if (field[y][x] != i)
							tcost += command[i];
						int tx = x + dx[(2 + i) % 4];
						int ty = y + dy[(2 + i) % 4];
						if (tx >= 0 && tx < w && ty >= 0 && ty < h)
							switch (i) {
							case 0:
								queue.add(new Node(tx, ty, tcost, 'S'));
								break;
							case 1:
								queue.add(new Node(tx, ty, tcost, 'W'));
								break;
							case 2:
								queue.add(new Node(tx, ty, tcost, 'N'));
								break;
							default:
								queue.add(new Node(tx, ty, tcost, 'E'));
							}
					}
				}
				if (node.dir == 'W') {
					if (costs[3][y][x] >= 0 && costs[3][y][x] <= cost)
						continue;
					costs[3][y][x] = cost;
					for (int i = 0; i < 4; i++) {
						int tcost = cost;
						if (field[y][x] != i)
							tcost += command[i];
						int tx = x + dx[(3 + i) % 4];
						int ty = y + dy[(3 + i) % 4];
						if (tx >= 0 && tx < w && ty >= 0 && ty < h)
							switch (i) {
							case 0:
								queue.add(new Node(tx, ty, tcost, 'W'));
								break;
							case 1:
								queue.add(new Node(tx, ty, tcost, 'N'));
								break;
							case 2:
								queue.add(new Node(tx, ty, tcost, 'E'));
								break;
							default:
								queue.add(new Node(tx, ty, tcost, 'S'));
							}
					}
				}
			}
			int result = Integer.MAX_VALUE;
			for (int i = 0; i < 4; i++)
				if (costs[i][h - 1][w - 1] >= 0)
					result = Math.min(result, costs[i][h - 1][w - 1]);
			System.out.println(result);
		}
		sc.close();
	}

	static class Node implements Comparable<Node> {
		int x, y, cost;
		char dir;

		Node(int i, int j, int c, char d) {
			x = i;
			y = j;
			cost = c;
			dir = d;
		}

		public int compareTo(Node anotherNode) {
			if (this.dir == anotherNode.dir)
				return this.cost - anotherNode.cost;
			return this.dir - anotherNode.dir;
		}

	}
}