Submission #420857

---

Source Code Expand

import java.util.Arrays;
import java.util.Scanner;


public class Main {

    int[] dy = {0,1,-1,0};
    int[] dx = {1,0,0,-1};
    void doIt() {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        
        map = new char[H+2][W+2];
        
        for(int i = 0; i < H+2;i ++) {
            Arrays.fill(map[i],'#');
        }
        int sy = 0;
        int sx = 0;

        for(int i = 1 ; i <= H; i++) {
            char[] c = sc.next().toCharArray();
            for (int j = 1; j <=W; j++) {
                map[i][j] = c[j-1];
                if(c[j-1] == 's') {
                    sy = i;
                    sx = j;
                }
            }
        }

        work = new int[H+2][W+2];
        System.out.println(dfs(sy, sx) ? "Yes" : "No");
    }
    
    
    char[][] map;
    int[][] work;
    
    boolean dfs(int y, int x) {
        
        if (map[y][x] == '#') {
            return false;
        } else if (work[y][x] == 0) {
            return false;
        } else if(map[y][x] == 'g') {
            return true;
        }
        
        work[y][x] = 1 ;
        
        boolean result = false;
        for(int i = 0; i < 4; i++) {
            result |= dfs(y + dy[i], x + dx[i]);
        }
        return result;
    }

    void doIt2() {
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        int Q = sc.nextInt();
        
        int[] indexes = new int[N];
        for(int i = 0; i < N; i++) {
            indexes[i] = i;
        }
        
        for(int i = 0; i < Q; i++) {
           int p = sc.nextInt();
           int t1 = indexes[sc.nextInt()];
           int t2 = indexes[sc.nextInt()];
           
           int learge = Math.max(t1, t2);
           int small = Math.min(t1, t2);
           
           if(p == 0) {
               indexes[learge] = small;
           } else {
               
               if(getHead(indexes, learge) == getHead(indexes, small)) {
                   System.out.println("Yes");
               } else {
                   System.out.println("No");
               }
               
           }
           
        }
        
    }
    
    int getHead(int[] indexes, int pos) {
        if(indexes[pos] == pos) {
            return pos;
        }
        return indexes[pos] = getHead(indexes, indexes[pos]);
       
    }
    
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        new Main().doIt();
    }

}

Submission Info

Judge Result