Submission #162580

---

Source Code Expand

import java.util.*;
public class Main{
    public static void main(String[] args){
	new Main().run();
    }
    Scanner sc = new Scanner(System.in);

    int r, c, sy, sx, gy, gx;
    int[][] map;
    int wall = Integer.MIN_VALUE;
    LinkedList<int[]> que;
    int[] dirX = { 0, 1, -1, 0 };
    int[] dirY = { 1, 0, 0, -1 };

    void run(){
	put();
	solve();
	System.out.println(map[gy][gx]);
    }

    void solve(){
        que = new LinkedList<int[]>();
	map[sy][sx] = 0;
	search(sy, sx);
	while(que.size()!=0){
	    int[] p = que.pollFirst();
	    search(p[0], p[1]);
	}
    }

    void search(int y, int x){
	for(int i=0; i<4; i++){
	    int a = y+dirY[i];
	    int b = x+dirX[i];
	    if(map[a][b]==-1 || map[a][b]>map[y][x]+1){
		map[a][b] = map[y][x]+1;
		int[] p = { a, b };
		que.addFirst(p);
	    }
	}
    }

    void put(){
	r = sc.nextInt();
	c = sc.nextInt();
	sy = sc.nextInt()-1;
	sx = sc.nextInt()-1;
	gy = sc.nextInt()-1;
	gx = sc.nextInt()-1;

	map = new int[r][c];

	for(int i=0; i<r; i++){
	    String s = sc.next();
	    for(int k=0; k<c; k++)
		map[i][k] = s.charAt(k)=='#' ? wall : -1;
	}
    }
}

Submission Info

Judge Result