Submission #7135651

---

Source Code Expand

#include <iostream>
#include <string>

using namespace std;

int H,W;
char map[501][501];
bool visited[501][501];

void dfs(int h, int w)
{
    visited[h][w] = true;

    if(map[h][w] == 'g'){
        cout << "Yes" << endl;
        exit(0);
    }

    int nexth = h,nextw = w;
    nexth = h-1;
    if(nexth >= 0 && !visited[nexth][nextw] && map[nexth][nextw] != '#'){
        dfs(nexth,nextw);
    }
    nexth = h+1;
    if(nexth < H && !visited[nexth][nextw] && map[nexth][nextw] != '#'){
        dfs(nexth,nextw);
    }    
    nexth = h; nextw = w-1;
    if(nextw >= 0 && !visited[nexth][nextw] && map[nexth][nextw] != '#'){
        dfs(nexth,nextw);
    }   
    nextw = w+1;
    if(nextw < W && !visited[nexth][nextw] && map[nexth][nextw] != '#'){
        dfs(nexth,nextw);
    }  
}


int main()
{
    cin >> H >> W;
    for(int i=0; i<H; i++){
        cin >> map[i];
    }

    for(int i=0; i<H; i++){
        for(int j=0; j<W; j++){
            visited[i][j] = false;
        }
    }

    for(int i=0; i<H; i++){
        for(int j=0; j<W; j++){
            if(map[i][j] == 's'){
                dfs(i,j);
            }
        }
    }

    cout << "No" << endl;
}

Submission Info

Judge Result