Submission #6785007

---

Source Code Expand

#include <iostream>

#include <vector>
#include <map>
#include <algorithm>
#include <fstream>
#include<cstdio>
#include<iomanip>
#include<stack>
#include<queue>

#define REP(i, n) for(int i=0;i<n;i++)
#define REP2(i, s, n) for(int i=s;i<n;i++)
#define REP_1(i, n) for(int i=1;i<n+1;i++)
#define bitSearch(bit, n) for(int bit = 0; bit < (1 << N); bit++)
using namespace std;

void printAns(long long a) { cout << a << endl; }

void yesno(bool a) { if (a)cout << "Yes" << endl; else cout << "No" << endl; }

void YESNO(bool a) { if (a)cout << "YES" << endl; else cout << "NO" << endl; }

typedef long long ll;
typedef unsigned long ul;
typedef long double ld;

template<class T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

//ll INF = 10000000;
//ll mod = 1000000007;//10^9+7

using Graph = vector<vector<pair<int, int>>>;

//Graph G(100100);

string c[510];
bool field[510][510] = {false};

int H, W;

void dfs(int x, int y) {
    field[x][y] = true;
    vector<int> dx = {-1, 0, 0, 1};
    vector<int> dy = {0, -1, 1, 0};
    REP(i, 4) {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if (nx < 0 || nx >= H || ny < 0 || ny >= W) { continue; }
        if (c[nx][ny] == '#') { continue; }
        if (field[nx][ny] == false)
            dfs(nx, ny);
    }
}

//番号ズレ注意！！
int main() {

    cin >> H >> W;
    REP(i, H) {
        cin >> c[i];
    }
    int sh, sw, gh, gw;
    REP(i, H) {
        REP(j, W) {
            if (c[i][j] == 's') { sh = i, sw = j; }
            if (c[i][j] == 'g') { gh = i, gw = j; }
        }
    }
    dfs(sh, sw);
    yesno(field[gh][gw]);

}

Submission Info

Judge Result