【搜索】FZU 2150 Fire Game
来源:互联网 发布:淘宝如何引流量 编辑:程序博客网 时间:2024/05/21 10:44
Problem Description
Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then they start to fire all the grass. Firstly they choose two grids which are consisting of grass and set fire. As we all know, the fire can spread among the grass. If the grid (x, y) is firing at time t, the grid which is adjacent to this grid will fire at time t+1 which refers to the grid (x+1, y), (x-1, y), (x, y+1), (x, y-1). This process ends when no new grid get fire. If then all the grid which are consisting of grass is get fired, Fat brother and Maze will stand in the middle of the grid and playing a MORE special (hentai) game. (Maybe it’s the OOXX game which decrypted in the last problem, who knows.)
You can assume that the grass in the board would never burn out and the empty grid would never get fire.
Note that the two grids they choose can be the same.
Input
The first line of the date is an integer T, which is the number of the text cases.
Then T cases follow, each case contains two integers N and M indicate the size of the board. Then goes N line, each line with M character shows the board. “#” Indicates the grass. You can assume that there is at least one grid which is consisting of grass in the board.
1 <= T <=100, 1 <= n <=10, 1 <= m <=10
Output
For each case, output the case number first, if they can play the MORE special (hentai) game (fire all the grass), output the minimal time they need to wait after they set fire, otherwise just output -1. See the sample input and output for more details.
Sample Input
3 3
.#.
###
.#.
3 3
.#.
#.#
.#.
3 3
...
#.#
...
3 3
###
..#
#.#
Sample Output
Case 2: -1
Case 3: 0
Case 4: 2
思路:两两枚举为’#‘的位置;注意所枚举的两个位置的次序不同,结果也不同;
代码:
#include<cstdio>#include<cstring>#include<queue>#include<algorithm>using namespace std;#define inf 0x3f3f3f3fstruct node{ int x,y;} a[105];int n,m;char s[15][15];int dist[15][15];int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};typedef pair<int,int > P;void bfs(int x1,int y1,int x2,int y2){ queue<P>que; while(!que.empty()) que.pop(); for(int i=0;i<n;i++) for(int j=0;j<m;j++) dist[i][j]=inf; que.push(P(x1,y1)),que.push(P(x2,y2)); dist[x1][y1]=dist[x2][y2]=0; while(que.size()) { P p=que.front(); que.pop(); for(int i=0;i<4;i++) { int nx=p.first+dx[i],ny=p.second+dy[i]; if(nx>=0&&nx<n&&ny>=0&&ny<m&&dist[nx][ny]==inf&&s[nx][ny]=='#') { dist[nx][ny]=dist[p.first][p.second]+1; que.push(P(nx,ny)); } } }}int main(){ int T,cas=0; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); for(int i=0; i<n; i++) scanf("%s",s[i]); int cnt=0; for(int i=0; i<n; i++) for(int j=0; j<m; j++) if(s[i][j]=='#') a[cnt].x=i,a[cnt++].y=j; int maxx=0,res=inf; for(int i=0;i<cnt;i++) for(int j=0;j<cnt;j++) { bfs(a[i].x,a[i].y,a[j].x,a[j].y); maxx=0; for(int ii=0;ii<n;ii++) for(int jj=0;jj<m;jj++) { if(s[ii][jj]=='#') maxx=max(maxx,dist[ii][jj]); } res=min(maxx,res); } if(res==inf) printf("Case %d: -1\n",++cas); else printf("Case %d: %d\n",++cas,res); } return 0;}
- FZU 2150 Fire Game 搜索
- 【搜索】FZU 2150 Fire Game
- FZU 2150 Fire Game(双端bfs搜索)
- FZU 2150 Fire Game
- FZU 2150 Fire Game
- FZU 2150 Fire Game
- FZU 2150 Fire Game
- FZU 2150 Fire Game
- FZU-2150 Fire Game
- fzu 2150 Fire Game
- FZU 2150 Fire Game
- FZU 2150 - Fire Game
- fzu 2150 Fire Game
- FZU 2150 Fire Game
- FZU 2150 Fire Game
- FZU 2150Fire Game
- FZU 2150 Fire Game
- FZU-2150-Fire Game
- 【Java】——zookeeper伪集群搭建异常 My id 4 not in the peer list
- web页面内容打印总结
- PHP 文件处理常用操作
- Java 8:不要再用循环了
- 工作中redis锁的问题记录
- 【搜索】FZU 2150 Fire Game
- 欢迎使用CSDN-markdown编辑器
- s3c2440时钟学习(韦东山老师课程学习笔记)
- Ztree 实现搜索节点高亮显示,重置功能
- Python——网络爬虫
- Codeforces 892 B. Wrath (递推)
- 【转】Docker Volume 之权限管理-Docker运行gogs容器时使用-v参数映射本地目录-报权限错误的原因及解决办法
- Luminar 2018(图片后期处理软件)官方破解版V2018.1.0.0.1010下载 | luminar photo editor
- Document Object Model( 文档对象模型 )