codeforces793 B. Igor and his way to work (dfs)

题目链接：codeforces793 B. Igor and his way to work (dfs)

求从起点到终点转方向不超过两次是否有解，，好水啊，感觉自己代码好搓。。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<limits.h>
#define CLR(a,b) memset((a),(b),sizeof((a)))
using namespace std;
typedef long long ll;
const int N = ;
int n, m;
int sx, sy, ex, ey;int flag;
char s[N][N];
int vis[N][N][][];
void dfs(int x, int y, int d, int turn) {//上下：d = 1，左右：d = 2
    if(turn >  || vis[x][y][d][turn]) return;
    if(x == ex && y == ey) {
        flag = true;
        return;
    }
    vis[x][y][d][turn] = ;
    if(x- >=  && s[x-][y] != '*' && !vis[x-][y][][turn+(d==)]) {
        dfs(x-, y, , turn + (d==));
    }
    if(x+ < n && s[x+][y] != '*' && !vis[x+][y][][turn+(d==)]) {
        dfs(x+, y, , turn + (d==));
    }
    if(y- >=  && s[x][y-] != '*' && !vis[x][y-][][turn+(d==)]) {
        dfs(x, y-, , turn + (d==));
    }
    if(y+ < m && s[x][y+] != '*' && !vis[x][y+][][turn+(d==)]) {
        dfs(x, y+, , turn + (d==));
    }
}
int main() {
    int i, j;
    scanf("%d%d ", &n, &m);
    for(i = ; i < n; ++i) {
        scanf("%s", s[i]);
        for(j = ; j < m; ++j) {
            if(s[i][j] == 'S') {sx = i; sy = j;}
            else if(s[i][j] == 'T') {ex = i; ey = j;}
        }
    }
    flag = ;
    CLR(vis, );
    dfs(sx, sy, , );
    if(flag) puts("YES");
    else puts("NO");
    return ;
}