计蒜客-迷宫（一）

题目： 计蒜客-迷宫（一）

• 简单dfs

code

#include <bits/stdc++.h>
using namespace std;

char s[11][11];
int n, m;

bool FIND = false;
bool vis[11][11];
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};

void dfs(int x, int y)
{
   // printf("%d %d %c\n",x,y,s[x][y]);
    vis[x][y] = true;
    if(s[x][y] == 'T'){
        FIND = true;
        return;
    }
    for(int i = 0; i < 4; ++i){
        int xx = x + dx[i];
        int yy = y + dy[i];
        if(xx < 0 || xx >= n || yy < 0 || yy >= m) continue;
        if(vis[xx][yy]) continue;
        if(s[xx][yy] == '*') continue;
        dfs(xx, yy);
    }
}

int main()
{
    int sx, sy;
    scanf("%d%d",&n,&m);
    for(int i = 0; i < n; ++i){
        getchar();
        for(int j = 0; j < m; ++j){
            scanf("%c",&s[i][j]);
            if(s[i][j] == 'S'){
                sx = i;
                sy = j;
            }
        }
    }
    dfs(sx, sy);
    if(FIND) printf("yes\n");
    else printf("no\n");
    return 0;
}