HDU 1180 诡异的楼梯 BFS

思路：BFS，但是走两步会对结果造成影响，所以我就脑补了如果楼梯的方向不是对的话，就在楼梯上等一分钟，然后接着走，这样要处理下一分钟要走相同的方向。

数据：

1 3

S|T

1 3

S-T

3 4

T…

*-*S

*.|.

3 4

S|.|

-T-.

.|..

输出：

2

1

4

7

http://acm.hdu.edu.cn/showproblem.php?pid=1180

我的代码写得太丑了，还是太弱。

/*********************************************    Problem : HDU 1180    Author  : NMfloat    InkTime (c) NM . All Rights Reserved .********************************************/#include <map>#include <set>#include <queue>#include <cmath>#include <ctime>#include <cstdio>#include <cstring>#include <cstdlib>#include <iostream>#include <algorithm>#define rep(i,a,b)  for(int i = (a) ; i <= (b) ; i ++)#define rrep(i,a,b) for(int i = (b) ; i >= (a) ; i --)#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)#define cls(a,x)   memset(a,x,sizeof(a))#define eps 1e-8using namespace std;const int MOD = 1e9+7;const int INF = 0x3f3f3f3f;const int MAXN = 1e5+5;const int MAXE = 2e5+5;typedef long long LL;typedef unsigned long long ULL;struct Node {    int x,y;    int t;//经过的时间    int fa;//方向    Node(){}    Node(int _x,int _y,int _t,int _fa = 0) {x = _x ; y = _y ; t = _t; fa = _fa;}};int T,n,m,k;char Map[25][25];int vis[25][25];int fx[] = {0,1,-1,0,0};int fy[] = {0,0,0,-1,1};int sx,sy;int tmpx,tmpy;int ans;int qiao;queue<Node>q;void BFS() {    while(!q.empty())q.pop();    q.push(Node(sx,sy,0));    while(!q.empty()) {        Node tmp = q.front();        q.pop();        if(Map[tmp.x][tmp.y] == 'T') {            ans = tmp.t;            break;        }        if(Map[tmp.x][tmp.y] == '|' || Map[tmp.x][tmp.y] == '-') {            q.push(Node(tmp.x+fx[tmp.fa],tmp.y+fy[tmp.fa],tmp.t+1));            continue;        }        rep(i,1,4) {            tmpx = tmp.x + fx[i] ; tmpy = tmp.y + fy[i];            if(tmpx >= 1 && tmpx <= n && tmpy >= 1 && tmpy <= m) {                if(!vis[tmpx][tmpy]) {                    if(Map[tmpx][tmpy] == '.') {                        vis[tmpx][tmpy] = 1;                        q.push(Node(tmpx,tmpy,tmp.t+1));                    }                    else if(Map[tmpx][tmpy] == '-') {                        qiao = 0;                        tmpx = tmpx + fx[i] ; tmpy = tmpy + fy[i];                        int tmpt = tmp.t + 1;                        if(tmpx >= 1 && tmpx <= n && tmpy >= 1 && tmpy <= m && (Map[tmpx][tmpy] == '.' || Map[tmpx][tmpy] == 'T') && vis[tmpx][tmpy] == 0) {                            if(tmpt % 2 == 0) { // 改变                                if(i == 3 || i == 4) {                                    tmpt += 1;                                    qiao ++;                                }                            }                            else { // 不变                                if(i == 1 || i == 2) {                                    tmpt += 1;                                    qiao ++;                                }                            }                            if(qiao == 0) {                                vis[tmpx][tmpy] = 1;                                q.push(Node(tmpx,tmpy,tmpt));                            }                            else {                                q.push(Node(tmp.x+fx[i],tmp.y+fy[i],tmp.t+1,i));                            }                        }                    }                    else if(Map[tmpx][tmpy] == '|') {                        tmpx = tmpx + fx[i] ; tmpy = tmpy + fy[i];                        int tmpt = tmp.t + 1;                        qiao = 0;                        if(tmpx >= 1 && tmpx <= n && tmpy >= 1 && tmpy <= m && (Map[tmpx][tmpy] == '.' || Map[tmpx][tmpy] == 'T') && vis[tmpx][tmpy] == 0) {                            if(tmpt % 2) { // 不变                                if(i == 3 || i == 4) {                                    tmpt += 1;                                    qiao ++;                                }                            }                            else { // 改变                                if(i == 1 || i == 2) {                                    tmpt += 1;                                    qiao ++;                                }                            }                            if(qiao == 0) {                                vis[tmpx][tmpy] = 1;                                q.push(Node(tmpx,tmpy,tmpt));                            }                            else {                                q.push(Node(tmp.x+fx[i],tmp.y+fy[i],tmp.t+1,i));                            }                        }                    }                    else if(Map[tmpx][tmpy] == 'T') {                        vis[tmpx][tmpy] = 1;                        q.push(Node(tmpx,tmpy,tmp.t+1));                    }                }            }        }    }}void input() {    rep(i,1,n) scanf("%s",&Map[i][1])  ;}void solve() {    rep(i,1,n) rep(j,1,m) {        if(Map[i][j] == 'S') {            sx = i; sy = j;        }    }    cls(vis,0); vis[sx][sy] = 1;    BFS();    printf("%d\n",ans);}int main(void) {    //freopen("a.in","r",stdin);    //scanf("%d",&T); while(T--) {    while(~scanf("%d %d",&n,&m)) {    //while(scanf("%d",&n),n) {        input();        solve();    }    return 0;}