Submission #731764

---

Source Code Expand

import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	private static int[][] DIR = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

	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[][] map = new char[R][C];
		for (int i = 0; i < R; i ++) {
			map[i] = sc.next().toCharArray();
		}
		
		ArrayDeque<int[]> queue = new ArrayDeque<>();
		long[][] dist = new long[R][C];
		for (long[] d : dist) Arrays.fill(d, Integer.MAX_VALUE);
		
		queue.add(new int[]{sy, sx, 0});
		dist[sy][sx] = 0;

		while (queue.size() > 0) {
			int[] pos = queue.pollLast();
			
			for (int[] d : DIR) {
				int[] n = new int[]{pos[0] + d[0], pos[1] + d[1], pos[2] + 1};
				
				if (map[n[0]][n[1]] != '#' && dist[n[0]][n[1]] > pos[2] + 1) {
					dist[n[0]][n[1]] = pos[2] + 1;
					queue.add(n);
				}
			}
		}
		
		System.out.println(dist[gy][gx]);
	}
}

Submission Info

Judge Result