Submission #3925776

---

Source Code Expand

import java.util.*;
import java.awt.Point;
class Main{
    static int cnt;
    static char[][] maze;
    static int[][] count;
    static int R;
    static int C;
    static Queue<Point> q;
    public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	R = sc.nextInt();
	C = sc.nextInt();
	Point start = new Point(sc.nextInt()-1, sc.nextInt()-1);
	Point end = new Point(sc.nextInt()-1, sc.nextInt()-1);
	maze = new char[R][C];
	count = new int[R][C];
	for(int i = 0; i<R; i++) {
            for(int j = 0; j<C; j++) {
                count[i][j] = 100000;
	    }
        }
	for(int i = 0; i<R; i++) {
	    String nextLine = sc.next();
	    for(int j = 0; j<C; j++) {
		maze[i][j] = nextLine.charAt(j);
	    }
	}

	q = new ArrayDeque<Point>();
	q.add(start);
	count[(int)(start.getX())][(int)(start.getY())] = 0;
	cnt = 0;
	while(q.peek() != null) {
	    Point p = q.poll();
	    if(count[(int)(end.getX())][(int)(end.getY())]<100000) break;
	    addPQ(p);
	    // 周りをqueueに入れる処理
	    //countを増やす
	    //塗り替え作業
	}
	System.out.println(count[(int)(end.getX())][(int)(end.getY())]);

    }

    public static void addPQ(Point p) {
	int x = (int)(p.getX());
	int y = (int)(p.getY());
	if(maze[x][y] == '#') return;
	maze[x][y] = '#';
	//	System.out.println("x,y = " + x + " , " + y);
	if(y+1<C && maze[x][y+1] == '.') {
	    q.add(new Point(x,y+1));
	    count[x][y+1] = count[x][y] + 1;
	}
	if(y-1>=0 && maze[x][y-1] == '.') {
	    q.add(new Point(x,y-1));
	    count[x][y-1] = count[x][y] + 1;

	}
	if(x-1>=0 && maze[x-1][y] == '.') {
	    q.add(new Point(x-1,y));
	    count[x-1][y] = count[x][y] + 1;
	}
	if(x+1<R && maze[x+1][y] == '.') {
	    q.add(new Point(x+1,y));
	    count[x+1][y] = count[x][y] + 1;
	}
    }

}

Submission Info

Judge Result