ACM-ICPC 2018 北京赛区网络预赛_A_ Saving Tang Monk II_BFS

传送门

题意：
1)‘S’ 是起点，‘T’ 是终点，‘.’是空地，‘#’是毒气室（进入毒气室需要一个面具），‘P’是加速点（到这点不需要花时间），‘B’是获得面具的地点，面具可以无限获得。
2）面具的上线是五个。进入毒气室的话要消耗一个面具，并且要在毒气室多呆一秒，问从S到T的最短时间。
思路：BFS。

#include<bits/stdc++.h>
#define debug(a) cout << #a << " " << a << endl
#define lnn putchar('\n')
#define see putchar(' ')
#define LL long long
#define ull unsigned long long
#define PI acos(-1.0)
#define eps 1e-6
const int N=200+7;
using namespace std;
char mp[N][N];
int n,m;
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
struct node{
    int x,y;
    int step,ox;
    bool operator<(const node &x) const {
        return x.step<step;
    }
}st;
priority_queue<node> q;
int vis[N][N][10];
bool check(int x,int y)
{
    if(x<1 || x>n || y<1 || y>m) return true;
    return false;
}
void bfs()
{
    while(!q.empty()) q.pop();
    memset(vis,0,sizeof vis);

    q.push(st);
    while(!q.empty()){
        node now=q.top();
        q.pop();

        if(mp[now.x][now.y]=='T'){
            printf("%d\n",now.step);
            return;
        }
       // printf("AAA%d %d\n",now.x,now.y);
        if(vis[now.x][now.y][now.ox]) continue;
        vis[now.x][now.y][now.ox]=1;
        for(int i=0;i<4;i++){
            int xx=dx[i]+now.x;
            int yy=dy[i]+now.y;
            if(check(xx,yy)) continue;

            if(mp[xx][yy]=='S' || mp[xx][yy]=='.' || mp[xx][yy]=='T'){
                if(vis[xx][yy][now.ox]) continue;
                q.push({xx,yy,now.step+1,now.ox});
            }else if(mp[xx][yy]=='#'){
                if(now.ox==0) continue;
                if(vis[xx][yy][now.ox-1]) continue;
                q.push({xx,yy,now.step+2,now.ox-1});
            }else if(mp[xx][yy]=='B'){
                if(vis[xx][yy][now.ox+1] || now.ox>4) continue;
                q.push({xx,yy,now.step+1,now.ox+1});
            }else if(mp[xx][yy]=='P'){
                if(vis[xx][yy][now.ox]) continue;
                q.push({xx,yy,now.step,now.ox});
            }
        }
    }
    puts("-1");
}
int main ()
{
    //yyy_3y
    //freopen("1.in","r",stdin);
	while(scanf("%d%d",&n,&m)!=EOF && n+m){
        for(int i=1;i<=n;i++) scanf("%s",mp[i]+1);
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(mp[i][j]=='S'){
                    st={i,j,0,0};
                }
            }
        }
        bfs();
	}
	return 0;
}