Submission #691207

---

Source Code Expand

import java.util.*;

public class Main {
	void solve() {
		try(final Scanner sc = new Scanner(System.in)) {
			int h = sc.nextInt();
			int w = sc.nextInt();
			int sy = sc.nextInt() - 1;
			int sx = sc.nextInt() - 1;
			int gy = sc.nextInt() - 1;
			int gx = sc.nextInt() - 1;
			
			char[][] cs = new char[h][];
			int[][] dist = new int[h][w];
			for(int y = 0; y < h; y++) {
				cs[y] = sc.next().toCharArray();
				Arrays.fill(dist[y], -1);
			}
			dist[sy][sx] = 0;
			int[] que = new int[100 * 100];
			int s = 0, t = 0;
			que[t++] = sy*100+sx;
			int[] dx = new int[]{ 1, 0, -1, 0, };
			int[] dy = new int[]{ 0, -1, 0, 1, };
			while(s != t) {
				int x = que[s] % 100;
				int y = que[s] / 100;
				s++;
				for(int i = 0; i < 4; i++) {
					int xx = x + dx[i];
					int yy = y + dy[i];
					if(cs[yy][xx] != '#') {
						if(dist[yy][xx] == -1) {
							dist[yy][xx] = dist[y][x] + 1;
							que[t++] = yy * 100 + xx;
						}
					}
				}
			}
			System.out.println(dist[gy][gx]);
		}
	}

	public static void main(String[] args) {
		new Main().solve();
	}

}

Submission Info

Judge Result