POJ 1915 Knight Moves 双向BFS 入门
来源:互联网 发布:mac有必要安装office 编辑:程序博客网 时间:2024/06/03 08:21
Description
Background
Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him?
The Problem
Your task is to write a program to calculate the minimum number of moves needed for a knight to reach one point from another, so that you have the chance to be faster than Somurolov.
For people not familiar with chess, the possible knight moves are shown in Figure 1.
Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him?
The Problem
Your task is to write a program to calculate the minimum number of moves needed for a knight to reach one point from another, so that you have the chance to be faster than Somurolov.
For people not familiar with chess, the possible knight moves are shown in Figure 1.
Input
The input begins with the number n of scenarios on a single line by itself.
Next follow n scenarios. Each scenario consists of three lines containing integer numbers. The first line specifies the length l of a side of the chess board (4 <= l <= 300). The entire board has size l * l. The second and third line contain pair of integers {0, ..., l-1}*{0, ..., l-1} specifying the starting and ending position of the knight on the board. The integers are separated by a single blank. You can assume that the positions are valid positions on the chess board of that scenario.
Next follow n scenarios. Each scenario consists of three lines containing integer numbers. The first line specifies the length l of a side of the chess board (4 <= l <= 300). The entire board has size l * l. The second and third line contain pair of integers {0, ..., l-1}*{0, ..., l-1} specifying the starting and ending position of the knight on the board. The integers are separated by a single blank. You can assume that the positions are valid positions on the chess board of that scenario.
Output
For each scenario of the input you have to calculate the minimal amount of knight moves which are necessary to move from the starting point to the ending point. If starting point and ending point are equal,distance is zero. The distance must be written on a single line.
Sample Input
380 07 01000 030 50101 11 1
Sample Output
5280题意:给一个N*N的棋盘,并给出起点终点的x y坐标 球起点到终点的最小步数。双向BFS代码:#include<iostream>#include<cstdio>#include<queue>#include<cstring>#define qq 330using namespace std;int vis1[qq][qq]; //既标记路径 也统计步数int vis2[qq][qq];int fx1[8]={2,2,-2,-2,1,1,-1,-1};int fx2[8]={1,-1,1,-1,2,-2,2,-2};struct node { int x,y;}start,end; //双向BFS的两端起点 int sx,sy,ex,ey;int m;bool inside(int xx,int yy) //判断越界{ if(xx>=0&&yy>=0&&xx<m&&yy<m) return true; else return false;}void dbfs(){ int i,tq,tw; queue<node>q,w; //两个队列 start.x=sx;start.y=sy; end.x=ex;end.y=ey; q.push(start); w.push(end); vis1[sx][sy]=0; //后面的步数是从0开始加的 vis2[ex][ey]=0; while(!q.empty()&&!w.empty()) { node now,next; tq=q.size(); //为了先将一个队列的全部判断完 while(tq--) { now=q.front(); q.pop(); if(inside(now.x,now.y)&&vis2[now.x][now.y]!=-1) //两端开始的都经过这一点。。 { printf("%d\n",vis1[now.x][now.y]+vis2[now.x][now.y]); return; } for(i=0;i<8;i++) { next.x=now.x+fx1[i]; next.y=now.y+fx2[i]; if(inside(next.x,next.y)&&vis2[next.x][next.y]!=-1) //重要,,因为奇数步时。。。 { printf("%d\n",vis1[now.x][now.y]+1+vis2[next.x][next.y]); return; } if(inside(next.x,next.y)&&vis1[next.x][next.y]==-1) { vis1[next.x][next.y]=vis1[now.x][now.y]+1; q.push(next); } } } tw=w.size(); while(tw--) //同上 { now=w.front(); w.pop(); if(inside(now.x,now.y)&&vis1[now.x][now.y]!=-1) { printf("%d\n",vis1[now.x][now.y]+vis2[now.x][now.y]); return; } for(i=0;i<8;i++) { next.x=now.x+fx1[i]; next.y=now.y+fx2[i]; if(inside(next.x,next.y)&&vis1[next.x][next.y]!=-1) { printf("%d\n",vis2[now.x][now.y]+1+vis1[next.x][next.y]); return; } if(inside(next.x,next.y)&&vis2[next.x][next.y]==-1) { vis2[next.x][next.y]=vis2[now.x][now.y]+1; w.push(next); } } } }}int main(){ int t; scanf("%d",&t); while(t--) { scanf("%d",&m); scanf("%d%d%d%d",&sx,&sy,&ex,&ey); memset(vis1,-1,sizeof(vis1)); //标记为未走过 memset(vis2,-1,sizeof(vis2)); dbfs(); } return 0;}
双向BFS的精髓在于从起点终点同时开始搜索 当找到一点同时两端都经过时 即找到最短路径。。
0 0
- POJ 1915 Knight Moves 双向BFS 入门
- POJ 1915 Knight Moves bfs || 双向bfs
- poj 1915 knight moves (双向bfs)
- POJ 1915 Knight Moves(双向BFS)
- poj 1915 Knight Moves 【双向bfs】
- bfs入门题 poj 1915 knight moves
- POJ 1915-Knight Moves (单向BFS && 双向BFS 比较)
- POJ 2243 Knight Moves bfs || 双向bfs
- POJ 题目1915 Knight Moves(双向BFS)
- [poj 1915] Knight Moves [A*][DBFS 双向BFS]
- POJ-1915 Knight Moves(双向广搜BFS)
- (搜索,双向BFS)POJ.1915.Knight Moves
- POJ 2243:Knight Moves(双向BFS)
- POJ 1915 Knight Moves bfs
- POJ 1915Knight Moves(BFS)
- poj 1915 Knight Moves(bfs)
- poj 1915 Knight Moves(bfs)
- POJ 1915 BFS-Knight Moves
- poj 3087
- Html.ActionLink几种参数格式
- pat1050
- 基于json-lib.jar包 创建JSONObject的四个常用方法
- hdu1539Shredding Company dfs
- POJ 1915 Knight Moves 双向BFS 入门
- hdu 1160 FatMouse's Speed
- 分享给有缘人——给明年依然年轻的我们:欲望、外界、标签、天才、时间、人生目标、现实、后悔、和经历
- Esper事件处理引擎_4_XML 数据结构处理
- 单链表相关操作
- POJ 1984 Navigation Nightmare (数据结构-并查集)
- UVA - 705 Slash Maze(dfs+floodfiil)
- ssh中“Host key verification failed.“的解决方案
- 如何在NCBI实现大批量数据的一一对应