Submission #1358896

---

Source Code Expand

    #include <iostream>
    #include <queue>
    #include <string>
    using namespace std;
    #define MAX 500
    int h, w;
    string s[MAX];
    int dd[5] = { 1, 0, -1, 0, 1 };
    bool dfs(int y, int x) {
    	if (0 > y || 0 > x || y >= h || x >= w || s[y][x] == '#') return false;
    	if (s[y][x] == 'g') {
    		return true;
    	}
    	s[y][x] = '#';
    	for (int i = 0; i < 4; ++i) {
    		if (dfs(y + dd[i], x + dd[i + 1])) {
    			return true;
    		}
    	}
    	return false;
    }
     
    int main() {
    	int sy, sx, gy, gx;
    	bool flg = true;
    	cin >> h >> w;
    	for (int i = 0; i < h; ++i) {
    		cin >> s[i];
    	}
    	for (sy = 0; sy < h; ++sy) {
    		for (sx = 0; sx < w; ++sx) {
    			if (s[sy][sx] == 's') {
    				flg = false;
    				break;
    			}
    		}
    		if (!flg) break;
    	}
    	cout << (dfs(sy, sx) ? "Yes" : "No") << endl;
    	return 0;
    }

Submission Info

Judge Result