H - Fire!(bfs)

Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s location in the maze and which squares of the maze are on fire, you must determine whether Joe can exit the maze before the fire reaches him, and how fast he can do it. Joe and the fire each move one square per minute, vertically or horizontally (not diagonally). The fire spreads all four directions from each square that is on fire. Joe may exit the maze from any square that borders the edge of the maze. Neither Joe nor the fire may enter a square that is occupied by a wall.
Input
The first line of input contains a single integer, the number of test cases to follow. The first line of each test case contains the two integers R and C, separated by spaces, with 1 ≤ R,C ≤ 1000. The following R lines of the test case each contain one row of the maze. Each of these lines contains exactly C characters, and each of these characters is one of: • #, a wall • ., a passable square • J, Joe’s initial position in the maze, which is a passable square • F, a square that is on fire There will be exactly one J in each test case.
Output
For each test case, output a single line containing ‘IMPOSSIBLE’ if Joe cannot exit the maze before the fire reaches him, or an integer giving the earliest time Joe can safely exit the maze, in minutes.
Sample Input
2 4 4 #### #JF# #…# #…# 3 3 ### #J. #.F
Sample Output
3 IMPOSSIBLE

题意:
有一个农场起火了，Joe和火每次都可以向四周移动一格，问是否能帮助Joe逃出去，能逃出去，输出逃出去的最小时间，不能，输出IMPOSSIBLE。

思路：
火是有多堆的(T-T)，被坑了，利用bfs先加入Joe位置，再循环依次加入火堆位置，然后正常搜索，每次mn矩阵中的变化为Joe能走的位置变为J，火蔓延到的位置为F，能逃出去的条件为Joe位置已经超出了题中mn矩阵。

AC代码:

#include<iostream>
#include<cstdio>
#include<queue>
#include<math.h>
#include<string.h>
#include<algorithm> 
using namespace std;
int k,m,n;
char map[1005][1005];
int dir[4][2]={1,0,0,1,-1,0,0,-1};
struct P
{
	int x,y,t;
};
bool check(int a,int b)
{
	if(a>=0&&b>=0&&a<m&&b<n&&map[a][b]!='#')
	return true;
	return false;
}
void bfs(P people)
{
	queue<P> q;
	P now,next,fire;
	q.push(people);
	for(int i=0;i<m;i++)//依次向队列中加入火堆位置
	{
		for(int j=0;j<n;j++)
		{
			if(map[i][j]=='F')
			{
				fire.x=i;
				fire.y=j;
				fire.t=0;
				q.push(fire);
			}
		}
	}
	while(!q.empty())
	{
		now=q.front();
		q.pop();
		if(now.x<0||now.x>m-1||now.y<0||now.y>n-1)//Joe逃出条件
		{
			cout<<now.t<<endl;
			return;
		}
		for(int i=0;i<4;i++)
		{
			next.x=now.x+dir[i][0];
			next.y=now.y+dir[i][1];
			if(map[now.x][now.y]=='J'&&(next.x<0||next.x>m-1||next.y<0||next.y>n-1))//Joe下一步就逃出去啦
			{
				next.t=now.t+1;
				q.push(next);
			}
			else if(check(next.x,next.y))
			{
				if(map[now.x][now.y]=='J'&&map[next.x][next.y]=='.')//Joe变化
				{
					map[next.x][next.y]='J';
					next.t=now.t+1;
					q.push(next);
				}
				else if(map[now.x][now.y]=='F'&&map[next.x][next.y]!='F')//火堆变化
				{
					map[next.x][next.y]='F';
					next.t=now.t+1;
					q.push(next);
				}
			}
		}
	}
	cout<<"IMPOSSIBLE"<<endl;
}
int main()
{
	cin>>k;
	while(k--)
	{
		memset(map,0,sizeof(map));
		P people,fire;
		scanf("%d %d",&m,&n);
		for(int i=0;i<m;i++)
		{
			scanf("%s",map[i]);
			for(int j=0;j<n;j++)
			{
				if(map[i][j]=='J')
				{
					people.x=i;
					people.y=j;
					people.t=0;
				}
			}
		}
		bfs(people);
	}
	return 0;
}