hdoj2579Dating with girls(2)【BFS】
来源:互联网 发布:光伏预算软件 编辑:程序博客网 时间:2024/04/29 04:54
Dating with girls(2)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2664 Accepted Submission(s): 745
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
Source
HDU 2009-5 Programming Contest
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<queue>using namespace std;struct node{int x,y,time;};int n,m,k;char map[110][110];int vis[110][110][15];int mov[][2]={0,1,0,-1,1,0,-1,0};int bfs(int x,int y){queue<node>Q;node u,v;u.x=x;u.y=y;u.time=0;Q.push(u);while(!Q.empty()){u=Q.front();Q.pop();if(map[u.x][u.y]=='G')return u.time;for(int i=0;i<4;++i){v.x=u.x+mov[i][0];v.y=u.y+mov[i][1];if(v.x>=0&&v.x<n&&v.y>=0&&v.y<m&&(map[v.x][v.y]!='#'||(u.time+1)%k==0)&&!vis[v.x][v.y][(u.time+1)%k]){v.time=u.time+1;vis[v.x][v.y][v.time%k]=1;Q.push(v);}}}return -1;}int main(){int t,i,j;scanf("%d",&t);while(t--){scanf("%d%d%d",&n,&m,&k);int sx,sy;for(i=0;i<n;++i){scanf("%s",map[i]);for(j=0;j<m;++j){if(map[i][j]=='Y'){sx=i;sy=j;}}}memset(vis,0,sizeof(vis));int ans=bfs(sx,sy);if(ans==-1)printf("Please give me another chance!\n");else printf("%d\n",ans);}return 0;}
0 0
- hdoj2579Dating 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)
- HDU 2579 Dating with girls(2) (BFS)
- 【BFS】HDOJ Dating with girls(2) 2579
- hdu 2579 Dating with girls(2)【bfs】
- HDOJ 2579 Dating with girls(2)(bfs)
- hdoj 2579 Dating with girls(2) 【bfs】
- hdu2579 Dating with girls(2)--BFS
- HDU2579 Dating with girls(2) BFS
- HDU 2579/BFS/ Dating with girls(2)
- hdu Dating with girls(2) bfs加点东西 水题
- hdu 2579 Dating with girls(2)(BFS)
- ACM-BFS之Dating with girls(2)——hdu2579
- hdu 2579 Dating with girls(2) 【经典三维BFS】
- HDU 2579--Dating with girls(2)【BFS && 三维判重】
- json对象和jsonArray基本知识点
- SqlServer2005 恢复数据库时出现Exclusive access could not be obtained because the database is in use 的解决方法
- 杭电acm2187
- iOS深入学习(Block全面分析)
- 基于STM32在IAR中调用printf()函数
- hdoj2579Dating with girls(2)【BFS】
- 算法分析—渐近符号
- 图像处理与计算机视觉:基础,经典以及最近发展
- Unity+NGUI性能优化方法总结
- 使用https安全传送消息数据,服务端用分布式。
- StockEasy帮助
- hdu 5538House Building(长春现场赛)
- 一路走走停停之序言:往前走,别回头
- 【ZJOI2012】【BZOJ2657】旅游(journey)