Chino with Ciste

https://ac.nowcoder.com/acm/contest/553/H

题意：给一个图找一条路使得从起点到终点拐弯次数最小；

思路：bfs；在一条路直走是遇到已经vis的不能立即退出，有可能经过这些vis的后还可以走！！！！！！

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x) memset(x,0,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e6+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

int n,m;
char mp[2009][2009];
int stx,sty,edx,edy;
struct node
{
    int x,y;
    int cnt;
    node(int _x,int _y,int _cnt)
    {
        x=_x;
        y=_y;
        cnt=_cnt;
    }
};
queue<node>q;
bool vis[2009][2009];
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
int bfs()
{
    q.push(node(stx,sty,0));
    vis[stx][sty]=1;
    while(!q.empty())
    {
        node t=q.front();
        q.pop();
        if(t.x==edx&&t.y==edy)
        {
            return t.cnt;
        }
        //cout<<t.x<<" "<<t.y<<endl;;
        for(int i=0;i<4;i++)
        {
            int x=t.x+dx[i];
            int y=t.y+dy[i];
            while(x>=0&&x<n&&y>=0&&y<m&&mp[x][y]!='*')//vis不能放这里
            {
                if(x==edx&&y==edy)
                {
                    return t.cnt;
                }
                if(!vis[x][y])
                {
                    vis[x][y]=1;
                    q.push(node(x,y,t.cnt+1));
                }
                x=x+dx[i];
                y=y+dy[i];
            }
        }
    }
    return -1;
}
int main()
{
    FASTIO;
    cin>>n>>m;
    for(int i=0;i<n;i++)
        cin>>mp[i];
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(mp[i][j]=='S')
            {
                stx=i;
                sty=j;
            }
            if(mp[i][j]=='T')
            {
                edx=i;
                edy=j;
            }
        }
    }
    int ans=bfs();
    if(ans==-1) cout<<"troil"<<endl;
    else cout<<ans<<endl;
    return 0;
}