1135. 飞越原野

典型的bfs题，每步分为两种mode，用三维数组记录两种mode所能到达点的状态，避免无意义的计算，其中许多编程技巧值得学习。为什么出来的一定是最少的时间呢？这是因为飞行mode与行走mode对ans的增益在每步当中都是一样的。学习构造函数的利用。

#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
int const maxn = 105;

int dr[]={0,1,0,-1};
int dc[]={1,0,-1,0};
int vis[maxn][maxn][maxn];



char p[maxn][maxn];
int m,n,d;
struct status{
    int r;
    int c;
    int val;
    int fly;
    status(int _r,int _c,int _fly,int _val):r(_r),c(_c),fly(_fly),val(_val) {
    }
};



int bfs()  {
    queue<status> Q;
    status tmp(1,1,d,0);
    Q.push(tmp);
    memset(vis,0,sizeof(vis));
    vis[1][1][d] = 1;
    while (!Q.empty()) {
        tmp = Q.front(); Q.pop();

        if (tmp.r==m&&tmp.c==n) return tmp.val;

        for (int i=0;i<4;i++) {
              int nr = tmp.r+dr[i];
              int nc = tmp.c+dc[i];
              if (nr<=0||nr>m||nc<=0||nc>n) continue;
              if (!vis[nr][nc][tmp.fly]&&p[nr][nc]=='P') {
                    vis[nr][nc][tmp.fly] = 1;
                    Q.push(status(nr,nc,tmp.fly,tmp.val+1));
              }           
              for (int j=2;j<=tmp.fly;j++) {
                 int nr = tmp.r+dr[i]*j;
                 int nc = tmp.c+dc[i]*j;
                 if (nr<=0||nr>m||nc<=0||nc>n) break;
                 if(p[nr][nc]=='L') continue;
                 if (!vis[nr][nc][tmp.fly-j]) {
                    vis[nr][nc][tmp.fly-j] = 1;
                    Q.push(status(nr,nc,tmp.fly-j,tmp.val+1));
                 }
              }
        }


    }

        return -1;

}





int main() {
    cin>>m>>n>>d;
    for (int i=1;i<=m;i++)
     for (int j=1;j<=n;j++) cin>>p[i][j];
     int ans = bfs();
     if (ans ==-1) cout<<"impossible"<<endl;
     else cout<<ans<<endl;
     return 0;

}