Submission #420222

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

string board[555];
bool vis[555][555];
int H, W;

bool dfs(const pii& s, const pii& g) {
    if (s == g) return true;
    vis[s.first][s.second] = true;
    for (int i = 0; i < 4; i++) {
        int ny = s.first+dy[i];
        int nx = s.second+dx[i];
        if (ny < 0 || ny >= H || nx < 0 || nx >= W) continue;
        if (board[ny][nx] == '#') continue;
        if (vis[ny][nx]) continue;
        pii next = pii(ny, nx);
        if (dfs(next, g)) return true;
    }
    return false;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> H >> W;
    pii start, goal;
    for (int i = 0; i < H; i++) {
        cin >> board[i];
        for (int j = 0; j < W; j++) {
            if (board[i][j] == 's') start = pii(i, j);
            if (board[i][j] == 'g') goal = pii(i, j);
        }
    }
    if (dfs(start, goal)) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}

Submission Info

Judge Result