Submission #420582

---

Source Code Expand

#include <iostream>
#define MAX 500
using namespace std;

void search(char c[][MAX], bool reached[][MAX], int x, int y, int h, int w);

int main(void)
{
    bool can = false;
    int x, y;
    int goal[2];
    int h, w;
    char c[MAX][MAX];
    bool reached[MAX][MAX] = {false};
    int i, j;
    
    cin >> h >> w;
    
    for ( i=0; i<h; i++ ) {
        for ( j=0; j<w; j++ ) {
            cin >> c[i][j];
        }
    }
    
    for ( i=0; i<h; i++ ) {
        for ( j=0; j<w; j++ ) {
            if ( c[i][j] == 's' ) {
                search(c, reached, i, j, h, w);
            }
            if ( c[i][j] == 'g' ) {
                x = i;
                y = j;
            }
        }
    }
    
    if ( reached[x][y] ) { can = true; }
    
    if ( can ) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
    
    return 0;
}

void search(char c[][MAX], bool reached[][MAX], int x, int y, int h, int w)
{
    if ( x < 0 || x >= h || y < 0 || y >= w ) { return; }
    if ( c[x][y] == '#' ) { return; }
    if ( reached[x][y] ) { return; }
    
    reached[x][y] = true;
    
    search(c, reached, x+1, y, h, w);
    search(c, reached, x-1, y, h, w);
    search(c, reached, x, y+1, h, w);
    search(c, reached, x, y-1, h, w);
    
}

Submission Info

Judge Result