Submission #3776654

---

Source Code Expand

import java.util.*;

public class Main {
  public static class Point {
    int y, x;

    public Point(int y, int x) {
      this.y = y;
      this.x = x;
    }
  }

  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[][] c = new char[50][50];
    for (int i = 0; i < R; i++) {
      c[i] = sc.next().toCharArray();
    }
    int INF = Integer.MAX_VALUE;
    int[][] dist = new int[50][50];
    for (int i = 0; i < R; i++) {
      for (int j = 0; j < C; j++) {
        dist[i][j] = INF;
      }
    }
    int[] dy = { -1, 0, 1, 0 };
    int[] dx = { 0, 1, 0, -1 };
    Deque<Point> que = new ArrayDeque<>();
    que.addLast(new Point(sy, sx));
    dist[sy][sx] = 0;
    while (que.size() > 0) {
      Point p = que.pollFirst();
      if (p.y == gy && p.x == gx) {
        break;
      }
      for (int i = 0; i < 4; i++) {
        int ny = p.y + dy[i];
        int nx = p.x + dx[i];
        if (0 <= ny && ny < R && 0 <= nx && nx < C && c[ny][nx] != '#' && dist[ny][nx] == INF) {
          que.addLast(new Point(ny, nx));
          dist[ny][nx] = dist[p.y][p.x] + 1;
        }
      }
    }
    System.out.println(dist[gy][gx]);
  }
}

Submission Info

Judge Result