Submission #3560118

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;

const int Movex[4] = {0, 0, 1, -1};
const int Movey[4] = {1, -1, 0, 0};
const int N = 500 + 10;
char Map[N][N];
bool vis[N][N];
int n, m, sx, sy, ex, ey;

void dfs(int x, int y) {
    vis[x][y] = true;
    int prex, prey, i;
    for(i = 0 ; i < 4; i++) {
        prex = x + Movex[i];
        prey = y + Movey[i];
        if(x == 0 || x > n || y == 0 || y > m) {
            continue;
        }
        if(!vis[prex][prey] && Map[prex][prey] != '#') {
            dfs(prex, prey);
        }
    }
}

int main() {
    int i, j, k;
    cin >> n >> m;
    memset(vis, false, sizeof(vis));
    for(i = 1; i <= n ; i++) 
      for(j = 1; j <= m; j++) {
        cin >> Map[i][j];
        if(Map[i][j] == 's') {
            sx = i;
            sy = j;
        }
        if(Map[i][j] == 'g') {
            ex = i;
            ey = j;
        }
    }
    dfs(sx, sy);
    if(vis[ex][ey]) {
        cout << "Yes" << endl;
        return 0;
    }
    cout << "No" << endl;
    return 0;
}

Submission Info

Judge Result