Submission #691261

---

Source Code Expand

import java.util.*;


public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int r = sc.nextInt();
		int c = sc.nextInt();
		int sy = sc.nextInt() - 1;
		int sx = sc.nextInt() - 1;
		int gy = sc.nextInt() - 1;
		int gx = sc.nextInt() - 1;

		char[][] maze = new char[r][];
		for (int i = 0; i < r; i++) {
			maze[i] = sc.next().toCharArray();
		}

		int[] dx = {1, -1, 0, 0};
		int[] dy = {0, 0, 1, -1};

		Queue<Integer> qx = new ArrayDeque<>();
		Queue<Integer> qy = new ArrayDeque<>();
		qx.add(sx);
		qy.add(sy);

		int[][] d = new int[r][c];
		d[sy][sx] = 1;
		while (!qx.isEmpty()) {
			int x = qx.remove();
			int y = qy.remove();

			if (x == gx && y == gy) {
				break;
			}

			for (int i = 0; i < dx.length; i++) {
				int nx = x + dx[i];
				int ny = y + dy[i];

				if (nx < 0 || nx >= c || ny < 0 || ny >= r) {
					continue;
				}
				if (d[ny][nx] > 0 || maze[ny][nx] == '#') {
					continue;
				}

				d[ny][nx] = d[y][x] + 1;
				qx.add(nx);
				qy.add(ny);
			}
		}

		System.out.println(d[gy][gx] - 1);

		sc.close();
	}
}

Submission Info

Judge Result