Submission #6954218

---

Source Code Expand

import java.util.ArrayDeque;
import java.util.Queue;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
    	Scanner sc = new Scanner(System.in);
    	try {
    		final int H = sc.nextInt();
    		final int W = sc.nextInt();

    		final int startY = sc.nextInt();
    		final int startX = sc.nextInt();
    		final int goalY = sc.nextInt();
    		final int goalX = sc.nextInt();

    		Maze maze = new Maze(H, W);
    		for (int i=0; i<H; i++) {
    			maze.init(i, sc.next());
    		}

    		YX start = new YX(startY - 1, startX - 1);
    		Queue<YX> queue = new ArrayDeque<>();
    		maze.set(start.y, start.x, 0);
    		queue.add(start);

    		while(!queue.isEmpty()) {
    			YX here = queue.remove();
    			if (maze.get(here.y-1, here.x) == -1) {
    				maze.set(here.y-1, here.x, maze.get(here.y,  here.x) + 1);
    				queue.add(new YX(here.y-1, here.x));
    			}
    			if (maze.get(here.y, here.x+1) == -1) {
    				maze.set(here.y, here.x+1, maze.get(here.y,  here.x) + 1);
    				queue.add(new YX(here.y, here.x+1));
    			}
    			if (maze.get(here.y+1, here.x) == -1) {
    				maze.set(here.y+1, here.x, maze.get(here.y,  here.x) + 1);
    				queue.add(new YX(here.y+1, here.x));
    			}
    			if (maze.get(here.y, here.x-1) == -1) {
    				maze.set(here.y, here.x-1, maze.get(here.y,  here.x) + 1);
    				queue.add(new YX(here.y, here.x-1));
    			}
    			// System.out.println(maze.toString());
    		}

    		System.out.println(maze.get(goalY - 1,  goalX - 1));

    	} finally {
    		sc.close();
    	}
    }
}


class Maze {
	final int H;
	final int W;
	int[][] maze;
	public Maze(int h, int w) {
		this.H = h;
		this.W = w;
		maze = new int[H][W];
	}

	public void init(int y, String mazelet) {
		for (int i=0; i<mazelet.length(); i++) {
			char c = mazelet.charAt(i);
			if (c == '#') {
				maze[y][i] = Integer.MAX_VALUE;
			} else {
				maze[y][i] = -1;
			}
		}
	}

	public void set(int y, int x, int i) {
		maze[y][x] = i;
	}

	public int get(int y, int x) {
		return maze[y][x];
	}

	public String toString() {
		StringBuffer sb = new StringBuffer();
		for (int y=0; y<maze.length; y++) {
			for (int x=0; x<maze[y].length; x++) {
				if (maze[y][x] == -1) {
					sb.append('.');
				} else if (maze[y][x] == Integer.MAX_VALUE) {
					sb.append('#');
				} else {
					// sb.append('o');
					sb.append(maze[y][x] % 10);
				}
			}
			sb.append("\n");
		}
		return sb.toString();
	}
}

class YX {
	public final int y;
	public final int x;
	public YX(int y, int x) {
		this.y = y;
		this.x = x;
	}

	public String toString() {
		return "[" + y + "," + x + "]";
	}
}

Submission Info

Judge Result