ACM: Gym 101047E Escape from Ayutthaya - BFS
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Description
Ayutthaya was one of the first kingdoms in Thailand, spanning since its foundation in 1350 to its collapse in 1767. The organization of Extraordinary Mystery Investigators (IME, in their language) aims to uncover the secrets of this ancient kingdom. One of IME's most notorious historians is Márcio "the indispensable" Himura. He is currently researching the laws and punishments in place during King Ramathibodi I's rule. Recent discoveries suggest how Ramathibodi I used to punish the subjects that did not convert to Theravada Buddhism, the religion he adopted.
The punishment involved trapping the accused prisoner in a room with a single exit and to light up a fire. If the prisoner could manage to reach the exit before getting caught on fire, she or he was forgiven and allowed to live. Márcio has access to some records that describe the floorplans of the rooms where this punishment took place. However, there are no documents asserting whether the prisoners were forgiven. Márcio would like to know whether each of these prisoners had any chance at all of having been forgiven. For that, Márcio represented each room as a grid with N rows and M columns, where each position has a symbol with the following meaning
where "start" is the person's initial position in the room when fire has been lit up. Moreover, Márcio imposed the following constraints in his model:
- Fire spreads in the four cardinal directions (N, S, E, O) at the speed of one cell per minute.
- The prisoners can also move in these four directions at the same speed.
- Neither fire nor the prisoners can walk through a wall.
- If the prisoner and fire occupy the same position at any instant, the prisoner dies instantaneously.
You are a member of IME and Márcio would like to know if you deserve your position. He has charged you with the task of determining whether a prisoner had any chance to be forgiven.
Input
The first line has a single integer T, the number if test cases.
Each instance consists of several lines. The first line contains two integers, N and M. Each of the following N lines contains exactly Msymbols representing, as described above, a room from which the prisoner must escape.
Limits
- 1 ≤ T ≤ 100
- The sum of the sizes of the matrices in all test cases will not exceed 2 cdot106
- 1 ≤ N ≤ 103
- 1 ≤ M ≤ 103
Output
For each instance, print a single line containing a single character. Print Y if the prisoner had any chance of being forgiven; otherwise, print N.
Sample Input
3
4 5
....S
.....
.....
F...E
4 4
...S
....
....
F..E
3 4
###S
####
E..F
Y
N
N
/*/
题意:
国王把犯人关在一个迷宫里,然后在迷宫里点火,只有一个出口,如果犯人逃出来了,将会被释放,给出这个迷宫的图和点火位置,问人能不能逃出。 很明显是BFS,但是一开始想错了,找到S和F两个点去BFS的,然后比较返回的最小步数,如果火走到E的步数小于人的步数坑定会被烧死的。但是少考虑了有多个火把的情况WA了一次。然后改好,再交了一次,发现前面的样例过的挺快,以为要A了,结果T在了text 6 噗。。。接着各种奇葩剪枝出来了。一直T在text 6 这组数据真的很可以。。。 在和队友冷静下来讨论了一会,突然灵感一闪,可以从起点BFS到终点,为何不能从终点往起点BFS顺便一次就把F和S全找了。 噗。。。 AC代码:
/*/
#include"algorithm"
#include"iostream"
#include"cstring"
#include"cstdio"
#include"string"
#include"vector"
#include"queue"
#include"cmath"
using namespace std;
#define FK(x) cout<<"["<<x<<"]"<<endl
#define memset(x,y) memset(x,y,sizeof(x))
#define memcpy(x,y) memcpy(x,y,sizeof(x))
#define bigfor(x) for(int qq=1;qq<=x;qq++)
#define FIN freopen("input.txt","r",stdin)
#define FOUT freopen("output.txt","w+",stdout) const int MX = 1e3+100;
int dir[4][2]= {{0,1},{1,0},{0,-1},{-1,0}};
int n,m;
bool vis[MX][MX];
char maps[MX][MX];
struct node {
int x,y,step;
node() {};
node(int xx,int yy,int s):x(xx),y(yy),step(s) {};
}; int BFS(int x,int y) {
node pe(0,0,1e9+10);
node fir(0,0,1e9+10);
memset(vis,0);
queue< node > Q;
while(!Q.empty())Q.pop();
vis[x][y]=1;
int sign=0;
Q.push(node(x,y,0));
while(!Q.empty()) {
node a=Q.front();
Q.pop();
if(maps[a.x][a.y]=='S'){
pe=a;
}
if(a.step>pe.step)return 1;
if(maps[a.x][a.y]=='F'){
return 0;
}
for(int i=0; i<4; i++) {
int xx=a.x+dir[i][0];
int yy=a.y+dir[i][1];
if(xx<0||yy<0||xx>=n||yy>=m||vis[xx][yy]) continue;
if(maps[xx][yy]=='#') continue;
vis[xx][yy]=1;
Q.push(node(xx,yy,a.step+1));
}
}
return 0;
} int main() {
int T;
cin>>T;
bigfor(T) {
scanf("%d%d",&n,&m);
for(int i=0; i<n; i++) {
scanf("%s",maps[i]);
}
int flag=0;
int ans=0;
for(int i=0; i<n; i++) {
for(int j=0; j<m; j++) {
if(maps[i][j]=='E') {
ans=BFS(i,j);
flag=1;
}
if(flag)break;
}
if(flag)break;
}
printf("%s\n",ans==1?"Y":"N");
}
return 0;
} /*/ 20
3 7
.......
F..E..S
....... 3 7
.......
.F.E..S
....... 3 7
F......
...E...
.....S. 3 7
......S
E......
......F 3 7
.....S.
E......
...F..F 3 7
.....S.
E...###
.F..#.F /*/
ACM: Gym 101047E Escape from Ayutthaya - BFS的更多相关文章
- bnu 52037 Escape from Ayutthaya
Escape from Ayutthaya Time Limit: 2000ms Memory Limit: 65536KB This problem will be judged on CodeFo ...
- ACM: Gym 100935F A Poet Computer - 字典树
Gym 100935F A Poet Computer Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d &am ...
- Codeforces Gym 100187E E. Two Labyrinths bfs
E. Two Labyrinths Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100187/prob ...
- Gym 101617J Treasure Map(bfs暴力)
http://codeforces.com/gym/101617/attachments 题意:给出一个图,每个顶点代表一个金矿,每个金矿有g和d两个值,g代表金矿初始的金子量,d是该金矿每天的金子量 ...
- Gym - 100971J (思维+简单bfs)
题目链接:http://codeforces.com/gym/100971/problem/J J. Robots at Warehouse time limit per test 2.0 s mem ...
- Gym - 100187E E - Two Labyrinths —— bfs
题目链接:http://codeforces.com/gym/100187/problem/E 题解:一开始做的时候是将两幅图合并,然后直接bfs看是否能到达终点.但这种做法的错的,因为走出来的路对于 ...
- ACM: Gym 101047M Removing coins in Kem Kadrãn - 暴力
Gym 101047M Removing coins in Kem Kadrãn Time Limit:2000MS Memory Limit:65536KB 64bit IO Fo ...
- ACM: Gym 101047K Training with Phuket's larvae - 思维题
Gym 101047K Training with Phuket's larvae Time Limit:2000MS Memory Limit:65536KB 64bit IO F ...
- ACM: Gym 101047B Renzo and the palindromic decoration - 手速题
Gym 101047B Renzo and the palindromic decoration Time Limit:2000MS Memory Limit:65536KB 64 ...
随机推荐
- JavaScript中的 offset, client,scroll
在js 中我们要用到的 offset, client, scroll 在这我把自己理解的给大家分享一下. offset div.offsetTop 指div距离上方或上层控件的距离,单位像素 div. ...
- 项目vue2.0仿外卖APP(三)
项目的结构如下: 项目资源准备 准备项目的各种图片资源等等 注意:在webpack可以不用css sprite,直接用单张图片,因为它会帮忙打包. 还有SVG图片, ...
- 重写官方TodoList,对于初学react+redux的人来说,很有好处
虽然官网的TodoList的例子写的很详细,但是都是一步到位,就是给你一个action,好家伙,全部都写好了,给你一个reducer,所有功能也是都写好了,但是我们这些小白怎么可能一下就消化那么多,那 ...
- 学习 opencv---(5) 创建Trackbar(活动条) &图像对比度,亮度值调整
学习如何在opencv 中用trackbar 函数创建和使用 轨迹条,以及图像对比度,亮度值的动态调整 一.OpenCV中轨迹条(Trackbar)的创建和使用 [1]创建轨迹条-----create ...
- 本地mysql打不开的解决方法
今天打开本地mysql的数据库,却一直打开报错.错误代码是10061. 让同事过来一看,发现是自己的mysql服务器并未启动.右下角任务管理器的mysql服务器为红色未启动状态.
- 如何设置redis中hash的field的expire ?
redis > hset expire:me name tom (integer) redis > hget expire:me name "tom" redis &g ...
- 一次erlang 节点CPU严重波动排查
新服务上线后观察到,CPU在10 ~ 70%间波动严重,但从每秒业务计数器看业务处理速度很平均. 接下来是排查步骤: 1. dstat -tam 大概每10s一个周期,网络流量开始变得很小,随后突然增 ...
- [恶趣味]搞了下局域网内的arp网络欺骗
挺无聊的. 扫描,伪装,抓包. 基本上搞完就失去乐趣了. 文章在这里,想搞的可以自己拿去搞下,其实很无聊,我真是个很容易无聊的人啊.
- 【ASP.NET】VS编译成功后自动生成Nuget包
在VisualStudio项目中,可以在每次编译成功后自动发布nuget包,具体配置过程如下: 1.下载nuget.exe,放置在Visual Studio项目的根目录下. 2.通过命令行生成 ...
- ArcGIS 10.1 BUG记录
声明:笔者使用ARCGIS 10.1 XXX版,YYY版可能没有此处描写的问题 1. 关于注册数据库 发布启用FA的服务,需要为数据库进行ArcGIS Server注册,若通过ArcMap执行注册,会 ...