Submission #3401514

---

Source Code Expand

#include <iostream>
using namespace std;

int H,W;
const int MAX_H = 500;
const int MAX_W = 500;
char c[MAX_H][MAX_W];
bool reached[MAX_H][MAX_W];

void dfs(int x, int y){
    if(x < 0 || W <= x || y < 0 || H <= y ) return; 
    if(reached[x][y]) return;
    if(c[x][y] == '#') return; 

    reached[x][y] = true;

    dfs(x+1,y);
    dfs(x-1,y);
    dfs(x,y+1);
    dfs(x,y-1);
}

int main(){
    cin >> H >> W;
    for(int i = 0; i < H; i++){
        for(int j = 0; j < W; j++){
            cin >> c[i][j];
        }
    } //入力
    int sx, sy, gx, gy;
    for(int i = 0; i < H; i++){
        for(int j = 0; j < W; j++){
            if(c[i][j] == 's'){
                sx = j;
                sy = i;
            }
            if(c[i][j] == 'g'){
                gx = j;
                gx = i;
            }
        }
    }
    dfs(sx,sy);
    if(reached[gx][gy]) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}

Submission Info

Judge Result