题目链接:
https://uva.onlinejudge.org/external/116/11624.pdf
将火也加入BFS的队列中去,人不能到达火已经到达的位置。
char a[maxn][maxn];
struct Node
{
int y,x;
int fire,step;
Node (){}
Node (int yy,int xx,int fi,int cn ) : y(yy),x(xx),fire(fi) ,step(cn){}
};
int dir[4][2]={{-1,0},{+1,0},{0,-1},{0,+1}};
int n,m;
bool vis[2][maxn][maxn];
bool out(int&y,int &x)
{
return y==1||y==n||x==1||x==m;
}
bool in(int &y,int &x)
{
return 1<=y&&y<=n&&1<=x&&x<=m;
}
int bfs()
{
int y,x;
queue<Node> q;
memset(vis,0,sizeof vis);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(a[i][j]=='J')
{
y=i,x=j;
vis[0][y][x]=1;
}
else if(a[i][j]=='F')
{
q.push(Node(i,j,1,0) );
vis[1][i][j]=1;
}
}
}
if(out(y,x)) return 1;
q.push( Node( y,x ,0 ,0 ) );
while(!q.empty())
{
Node t=q.front();q.pop();
y=t.y;
x=t.x;
int fire=t.fire;
int step=t.step;
for(int i=0;i<4;i++)
{
int ty=y+dir[i][0];
int tx=x+dir[i][1];
if(fire)
{
if(!in(ty,tx)||vis[fire][ty][tx]||a[ty][tx]=='#') continue;
vis[fire][ty][tx]=1;
q.push(Node( ty,tx,fire,step+1 ));
continue;
}
if(vis[fire][ty][tx]||vis[1^fire][ty][tx]||a[ty][tx]=='#') continue;
vis[fire][ty][tx]=1;
if(out(ty,tx) )
{
return step+2;
}
q.push(Node( ty,tx,fire,step+1 ) );
}
}
return -1;
}
int main()
{
int T;scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
scanf(" %c",&a[i][j]);
}
}
int ans;
if( (ans=bfs() )>=0) printf("%d\n",ans);
else puts("IMPOSSIBLE");
}
return 0;
}
头文件:
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#include<queue>
#include<vector>
#include<map>
#include<sstream>
#include<set>
#include<stack>
#include<utility>
#pragma comment(linker, "/STACK:102400000,102400000")
#define PI 3.1415926535897932384626
#define eps 1e-10
#define sqr(x) ((x)*(x))
#define FOR0(i,n) for(int i=0 ;i<(n) ;i++)
#define FOR1(i,n) for(int i=1 ;i<=(n) ;i++)
#define FORD(i,n) for(int i=(n) ;i>=0 ;i--)
#define lson num<<1,le,mid
#define rson num<<1|1,mid+1,ri
#define MID int mid=(le+ri)>>1
#define zero(x)((x>0? x:-x)<1e-15)
#define mk make_pair
#define _f first
#define _s second
using namespace std;
const int INF =0x3f3f3f3f;
const int maxn= 1000+10 ;
//const int maxm= ;
//const int INF= ;
typedef long long ll;
const ll inf =1000000000000000;//1e15;
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//fin.close();
//fout.close();
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
//by yskysker123