hdoj 2579 Dating with girls(2) 【BFS&&三维数组标记】
来源:互联网 发布:马云 蚂蚁金服 知乎 编辑:程序博客网 时间:2024/06/06 07:09
Dating with girls(2)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2656 Accepted Submission(s): 741
Problem Description
If you have solved the problem Dating with girls(1).I think you can solve this problem too.This problem is also about dating with girls. Now you are in a maze and the girl you want to date with is also in the maze.If you can find the girl, then you can date with the girl.Else the girl will date with other boys. What a pity!
The Maze is very strange. There are many stones in the maze. The stone will disappear at time t if t is a multiple of k(2<= k <= 10), on the other time , stones will be still there.
There are only ‘.’ or ‘#’, ’Y’, ’G’ on the map of the maze. ’.’ indicates the blank which you can move on, ‘#’ indicates stones. ’Y’ indicates the your location. ‘G’ indicates the girl's location . There is only one ‘Y’ and one ‘G’. Every seconds you can move left, right, up or down.
The Maze is very strange. There are many stones in the maze. The stone will disappear at time t if t is a multiple of k(2<= k <= 10), on the other time , stones will be still there.
There are only ‘.’ or ‘#’, ’Y’, ’G’ on the map of the maze. ’.’ indicates the blank which you can move on, ‘#’ indicates stones. ’Y’ indicates the your location. ‘G’ indicates the girl's location . There is only one ‘Y’ and one ‘G’. Every seconds you can move left, right, up or down.
Input
The first line contain an integer T. Then T cases followed. Each case begins with three integers r and c (1 <= r , c <= 100), and k(2 <=k <= 10).
The next r line is the map’s description.
The next r line is the map’s description.
Output
For each cases, if you can find the girl, output the least time in seconds, else output "Please give me another chance!".
Sample Input
16 6 2...Y.....#...#.......#.....#....#G#.
Sample Output
7分析:bfs加标记 带回溯。代码:#include<cstdio>#include<cstring>#include<algorithm>#include<queue>#include<cstdlib>using namespace std;int dis[4][2]={1,0,-1,0,0,1,0,-1};int vis[110][110][110];char map[110][110];struct node{int x;int y;int step;}a,b;int sx,sy,ex,ey;int r,c,k;void bfs(){memset(vis,0,sizeof(vis));queue<node>q;a.x=sx;a.y=sy;a.step=0;q.push(a);while(!q.empty()){a=q.front();q.pop();if(map[a.x][a.y]=='G'){printf("%d\n",a.step);return;}for(int i=0;i<4;i++) { b.x=a.x+dis[i][0]; b.y=a.y+dis[i][1]; b.step=a.step+1; int s=b.step%k; if(b.x<r&&b.x>=0&&b.y<c&&b.y>=0&&!vis[b.x][b.y][s]) { vis[b.x][b.y][s]=1; if(map[b.x][b.y]=='#'&&s) continue; q.push(b); } }}printf("Please give me another chance!\n");}int main(){int t;scanf("%d",&t);while(t--){scanf("%d%d%d",&r,&c,&k);for(int i=0;i<r;i++)scanf("%s",map[i]);for(int i=0;i<r;i++) for(int j=0;j<c;j++) { if(map[i][j]=='Y') sx=i,sy=j; if(map[i][j]=='G') ex=i,ey=j; } bfs(); }return 0;}
0 0
- hdoj 2579 Dating with girls(2) 【BFS&&三维数组标记】
- HDOJ 2579 Dating with girls(2) (BFS+三维标记好)
- HDOJ-2579-Dating with girls(2) 【BFS 三维标记】
- hdoj--2579--Dating with girls(2)(搜索+三维标记)
- hdoj 2579 Dating with girls(2) 【BFS 取余标记】
- hdoj 2579 Dating with girls(2) 【bfs(标记状态)】
- hdoj 2579 Dating with girls(2) (BFS)
- 【BFS】HDOJ Dating with girls(2) 2579
- HDOJ 2579 Dating with girls(2)(bfs)
- hdoj 2579 Dating with girls(2) 【bfs】
- 杭电-2579Dating with girls(2)(bfs+三维标记)
- hdu 2579 Dating with girls(2) 【经典三维BFS】
- HDU 2579--Dating with girls(2)【BFS && 三维判重】
- HDOJ 2579 Dating with girls(2) (BFS)
- HDU 2579 Dating with girls(2) BFS+三重标记(标记时间)
- BFS:HDU2597-Dating with girls(2) (分时间标记状态)
- HDU 2579 Dating with girls(2) BFS
- HDU 2579 Dating with girls(2)(BFS)
- PHP+Mysql+AJAX无跳转刷新例子
- 小波变换入门知识总结
- LeJOS学习(6):Sensor的API研究-TouchSensor
- HDU 5523:Game
- 在iPhone上使用3D Touch
- hdoj 2579 Dating with girls(2) 【BFS&&三维数组标记】
- Spark学习笔记之初识
- 【C#】winform子窗体与父窗体传值,子窗体与子窗体传值
- 装饰模式----设计模式系列
- 职业生涯规划
- poj2367 拓扑排序入门
- iOS触摸事件处理
- 解决SSH框架中Struts不能接受Android的不同Key值上传图片问题
- Java ”22/Sep/2015:00:18:59“转换格式