Submission #3786783

---

Source Code Expand

import java.util.*;

public class Main {
    static int[][] reached;
    static char[][] map;
    static int sx;
    static int sy;
    static int H;
    static int W;
    static boolean ans = false;

    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int h = sc.nextInt();
        int w = sc.nextInt();
        String blank = sc.nextLine();

        reached = new int[h][w];
        map = new char[h][w];
        H = h;
        W = w;
        String target = "s";

        for(int i = 0; i < h; i++){
          String buf = sc.nextLine();
          if(buf.contains(target)){sx = i; sy = buf.indexOf(target);}
          map[i] = buf.toCharArray();
        }

        dfs(sx, sy);
        if(ans == true){System.out.println("Yes");}
        else{System.out.println("No");}
    }

    private static void dfs(int x, int y) {
        //reached[x][y] = 1;
        // 終了条件
        if(x<0 || x>=H || y<0 || y>=W || map[x][y] == '#'){return ;}
        if(reached[x][y] == 1){return;}
        reached[x][y] = 1;
        if(map[x][y] == 'g'){ans = true;}
        //再帰呼び出し
        dfs(x, y+1);
        dfs(x, y-1);
        dfs(x+1, y);
        dfs(x-1, y);

    }

}

Submission Info

Judge Result