Submission #11602748

---

Source Code Expand

import java.util.Scanner;

class Main{
    static boolean[][] map;
    static boolean[][] checked;
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int h = sc.nextInt();
        int w = sc.nextInt();
        int sx = 0,sy = 0,gx = 0,gy = 0;
        map = new boolean[h + 2][w + 2];
        checked = new boolean[h + 1][w + 1];
        for(int i = 1; i <= h; i++){
            String str = sc.next();
            for(int j = 1; j<= w; j++){
                char chr = str.charAt(j - 1);
                if(chr == 's'){
                    sx = i; 
                    sy = j;
                    map[i][j] = true;
                }else if(chr == 'g'){
                    gx = i;
                    gy = j;
                    map[i][j] = true;
                }else if(chr == '.'){
                    map[i][j] = true;
                }
            }
        }
        sc.close();
        dfs(sx, sy);
        if(checked[gx][gy]){
            System.out.println("Yes");
        }else{
            System.out.println("No");
        }
    }
    public static void dfs(int sx, int sy){
        if(!map[sx][sy] || checked[sx][sy]){
            return;
        }

        checked[sx][sy] = true;
        dfs(sx + 1, sy);
        dfs(sx - 1, sy);
        dfs(sx, sy + 1);
        dfs(sx, sy - 1);
        return;
    }
}

Submission Info

Judge Result