Submission #1990105

---

Source Code Expand

#include <iostream>
using namespace std;

int H, W, sx, sy, gx, gy;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
const int MAX_H = 500, MAX_W = 500;
char c[MAX_H][MAX_W];

void dfs(int x, int y){
    if(x == gx && y == gy){
        c[gx][gy] = '#';
        return ;
    }
    c[x][y] = '#';
    for(int i = 0; i < 4; ++i){
        int nx = x + dx[i];
        int ny = y + dy[i];
        if(0 <= nx && nx < H && 0 <= ny && ny < W && c[nx][ny] != '#'){
            dfs(nx, ny);
        }
    }
}

int main(){
    cin >> H >> W;
    for(int i = 0; i < H; ++i){
        for(int j = 0; j < W; ++j) {
            cin >> c[i][j];
            if(c[i][j] == 's'){
                sx = i;
                sy = j;
            }else if(c[i][j] == 'g'){
                gx = i;
                gy = j;
            }
        }
    }

    dfs(sx, sy);
    cout << (c[gx][gy] == '#' ? "Yes\n" : "No\n");
    return 0;
}

Submission Info

Judge Result