hdu2579之BFS
来源:互联网 发布:淘宝零食旗舰店 编辑:程序博客网 时间:2024/06/06 02:38
Dating with girls(2)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1470 Accepted Submission(s): 414
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
#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<queue>#include<algorithm>#include<map>#include<iomanip>#define INF 99999999using namespace std;const int MAX=100+10;char Map[MAX][MAX];int mark[MAX][MAX][20];int n,m,k;int dir[4][2]={0,1,0,-1,1,0,-1,0};struct Node{int x,y,time;Node(){}Node(int X,int Y,int Time):x(X),y(Y),time(Time){}}start;int BFS(int &flag){queue<Node>q;Node oq,next;q.push(start);mark[start.x][start.y][start.time%k]=flag;while(!q.empty()){oq=q.front();q.pop();for(int i=0;i<4;++i){next=Node(oq.x+dir[i][0],oq.y+dir[i][1],oq.time+1);if(next.x<0 || next.y<0 || next.x>=n || next.y>=m)continue;if(mark[next.x][next.y][next.time%k] == flag)continue;if(next.time%k != 0 && Map[next.x][next.y] == '#')continue;mark[next.x][next.y][next.time%k]=flag;if(Map[next.x][next.y] == 'G')return next.time;q.push(next);}}return -1;}int main(){int num=0,t;cin>>t;while(t--){cin>>n>>m>>k;for(int i=0;i<n;++i)cin>>Map[i];for(int i=0;i<n;++i){for(int j=0;j<m;++j){if(Map[i][j] == 'Y')start.x=i,start.y=j;}}start.time=0;int temp=BFS(++num);if(temp != -1)cout<<temp<<endl;else cout<<"Please give me another chance!"<<endl;}return 0;}
- hdu2579之BFS
- hdu2579 BFS
- HDU2579(BFS)
- ACM-BFS之Dating with girls(2)——hdu2579
- hdu2579
- hdu2579 Dating with girls(2)--BFS
- HDU2579 Dating with girls(2) BFS
- 动态规划三维 hdu2579
- 【BFS】魔鬼之城
- hdu1429之BFS
- hdu2531之BFS
- hdu2653之BFS
- hdu2364之BFS
- hdu2216之BFS
- hdu1547之BFS
- hdu2102之BFS
- hdu2128之BFS
- hdu4308之BFS
- 黑马程序员 关于学习多态时的一些理解
- 学习笔记——Makefile中的=与:=
- 黑马程序员--银行业务调度系统
- ibatis中不翻译#和$
- 绘制余弦曲线
- hdu2579之BFS
- A. Candy Bags
- Java转成JSON处理类写法模式
- 找出有环链表中环的起点
- Html中的各种高度宽度
- myeclipse10 中修改html,servlet,jsp等的生成模板
- .NET JSON对象序列化和反序列化
- 判断两个链表是否相交
- C语言中volatile关键字的作用