Submission #7572775

---

Source Code Expand

// "static void main" must be defined in a public class.
import java.util.*;
public class Main {
    //char[][] map;
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int H = scan.nextInt();
        int W = scan.nextInt();
        int start_x = 0;
        int start_y = 0;
        int goal_x = 0;
        int goal_y = 0;
        int sum = 0;
        boolean[][] seen = new boolean[H][W];
        char[][] map = new char[H][W];
        for(int i = 0; i < H; i++){
            String helper = scan.next();
            for(int m = 0; m < W; m++){
                map[i][m] = helper.charAt(m);
                if(map[i][m] == 's'){start_x = i; start_y = m;}
                if(map[i][m] == 'g'){goal_x = i; goal_y = m;}
            }
        }
        dfs(map, start_x, start_y, seen);
        if(seen[goal_x][goal_y]){System.out.println("Yes");}
        else{System.out.println("No");}
    }
    
    private static void dfs(char[][] map, int x, int y, boolean[][] seen){
        //System.out.println(" x : " + x + " y : " + y + "cnt : " + map[x][y]);
        seen[x][y] = true;
        for(int i = x-1; i <= x+1; i++){
            for(int m = y-1; m <= y+1; m++){
                if(0 <= i && i < map.length && 0 <= m && m < map[0].length){
                    if(map[i][m] != '#' && seen[i][m] == false){
                        dfs(map,i,m,seen);
                    }
                }
            }
        }
    }
}

Submission Info

Judge Result