Submission #7134373

---

Source Code Expand

import java.util.Scanner;


public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		// 整数の入力
		int hMax = sc.nextInt();
		int wMax = sc.nextInt();

		String[][] townMap = new String[wMax][hMax];
		boolean[][] reached = new boolean[wMax][hMax];
		int wg = 0;
		int hg = 0;

		for (int i = 0; i < hMax; i++) {
			String[] line = sc.next().split("");
			for (int j = 0; j < wMax; j++) {
				townMap[j][i] = line[j];
				System.out.print(townMap[j][i]);

				if (townMap[j][i].equals("g")){
					wg = j;
					hg = i;
				}
			}
			if(sc.hasNext()) sc.hasNextLine();
			System.out.println();
		}

		search(0, 0, wMax, hMax, reached, townMap);

		if (reached[wg][hg]) System.out.println("Yes");
		else System.out.println("No");
	}

	private static void search(int x, int y, int wMax, int hMax, boolean[][] reached, String[][] townMap) {
		
		if (x < 0 || y < 0 || x > wMax - 1 || y > hMax - 1) return;
      if (reached[x][y]) return;
		if (townMap[x][y].equals("#")) return;

		reached[x][y] = true;

		search(x + 1, y , wMax, hMax, reached, townMap);
		search(x - 1, y , wMax, hMax, reached, townMap);
		search(x, y + 1 , wMax, hMax, reached, townMap);
		search(x, y - 1 , wMax, hMax, reached, townMap);
	}}

Submission Info

Judge Result