hdoj 2612 Find a way
来源:互联网 发布:淘宝开店保证金好退吗 编辑:程序博客网 时间:2024/04/29 08:00
Find a way
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4834 Accepted Submission(s): 1643
Problem Description
Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki.
Yifenfei’s home is at the countryside, but Merceki’s home is in the center of city. So yifenfei made arrangements with Merceki to meet at a KFC. There are many KFC in Ningbo, they want to choose one that let the total time to it be most smallest.
Now give you a Ningbo map, Both yifenfei and Merceki can move up, down ,left, right to the adjacent road by cost 11 minutes.
Yifenfei’s home is at the countryside, but Merceki’s home is in the center of city. So yifenfei made arrangements with Merceki to meet at a KFC. There are many KFC in Ningbo, they want to choose one that let the total time to it be most smallest.
Now give you a Ningbo map, Both yifenfei and Merceki can move up, down ,left, right to the adjacent road by cost 11 minutes.
Input
The input contains multiple test cases.
Each test case include, first two integers n, m. (2<=n,m<=200).
Next n lines, each line included m character.
‘Y’ express yifenfei initial position.
‘M’ express Merceki initial position.
‘#’ forbid road;
‘.’ Road.
‘@’ KCF
Each test case include, first two integers n, m. (2<=n,m<=200).
Next n lines, each line included m character.
‘Y’ express yifenfei initial position.
‘M’ express Merceki initial position.
‘#’ forbid road;
‘.’ Road.
‘@’ KCF
Output
For each test case output the minimum total time that both yifenfei and Merceki to arrival one of KFC.You may sure there is always have a KFC that can let them meet.
Sample Input
4 4Y.#@.....#..@..M4 4Y.#@.....#..@#.M5 5Y..@..#....#...@..M.#...#
Sample Output
668866
本题有多个@,一开始以为就两个,无语死了。
bfs+普通队列 ac:
#include<stdio.h>#include<queue>#include<algorithm> #include<string.h>#define INF 0x3f3f3f #define max 200+1using namespace std;int n,m; char map[max][max];int visit[max][max],time1[max][max],time2[max][max];struct node{int x,y,step;};int MIN(int x,int y){ return x<y?x:y;}void bfs(int startx,int starty,int p){int k;int move[4][2]={0,1,0,-1,1,0,-1,0};node now,next;queue<node>q;now.x=startx;now.y=starty;now.step=0;visit[now.x][now.y]=1;q.push(now); while(!q.empty()){next=q.front();q.pop();if(map[next.x][next.y]=='@')//找到 { if(p==1) { time1[next.x][next.y]=next.step; } else { time2[next.x][next.y]=next.step; } }for(k=0;k<4;k++){now.x=next.x+move[k][0];now.y=next.y+move[k][1];if(!visit[now.x][now.y]&&now.x>=0&&now.x<n&&now.y>=0&&next.y<m&&map[next.x][next.y]!='#'){now.step=next.step+1;visit[now.x][now.y]=1;q.push(now);}}} }int main(){int i,j,min;int xx,yy,xm,ym;char c;while(scanf("%d%d",&n,&m)!=EOF){c=getchar();for(i=0;i<n;i++){for(j=0;j<m;j++){scanf("%c",&map[i][j]);if(map[i][j]=='Y'){xx=i;yy=j;}if(map[i][j]=='M'){xm=i;ym=j;}}c=getchar();}memset(visit,0,sizeof(visit));memset(time1,INF,sizeof(time1));bfs(xx,yy,1);memset(time2,INF,sizeof(time2));memset(visit,0,sizeof(visit));bfs(xm,ym,2);min=INF;for(i=0;i<n;i++){ for(j=0;j<m;j++) { if(time1[i][j]!=INF&&time2[i][j]!=INF) { min=MIN(time1[i][j]+time2[i][j],min); } }}printf("%d\n",min*11);}return 0;}
0 0
- hdoj 2612 Find a way
- hdoj 2612 Find a way
- HDOJ 2612 Find a way
- HDOJ-2612 Find a way
- Find a way--hdoj
- hdoj 2612 Find a way (BFS)
- hdoj-2612-find a way-双向BFS
- HDOJ 2612 Find a way【BFS】
- HDOJ 2612 Find a way (双向BFS)
- HDU/HDOJ 2612 Find a way 双向BFS
- HDOJ 题目2612 Find a way(BFS)
- hdoj 2612 Find a way简单广搜
- HDOJ 2612 Find a way【最短路 双重bfs】
- hdoj 2612 Find a way (bfs,双向搜索)
- Find a way 2612
- HDOJ Find a way(两次bfs)
- HDU 2612 Find a way
- HDU-2612-Find a way
- jquery 判断input checkbox 是否选中
- 最小化Linux组织
- cocos2dx编译到android的错误
- (转)设计模式(7):模板方法模式
- Linux设备驱动探究第1天----spi驱动(1)
- hdoj 2612 Find a way
- Android抽屉效果的实现(不挤压,不覆盖)
- [省选前题目整理][BZOJ 2754][SCOI 2012]喵星球上的点名(后缀数组)
- mysql查询更新时的锁表机制分析
- Valid Parentheses
- C语言和设计模式(之组合模式)
- keil中忽略特定警告的方法
- String 构造,析构,复制,拷贝构造函数
- hdoj 1166 敌兵布阵 【单点更新+区间求和】 【线段树】 【树状数组】