Knight Moves(poj1915)
来源:互联网 发布:知乎删除提问 编辑:程序博客网 时间:2024/04/29 05:05
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
简单的宽度搜索(bfs)题目
以下是AC代码:
#include<stdio.h>#include<iostream>using namespace std;struct node { int x; int y; int step; };int main(){ int dir[8][2]={{2,1},{1,2},{-1,2},{-2,1},{2,-1},{1,-2},{-1,-2},{-2,-1}}; int n; cin>>n; for(int i=0;i<n;i++){ int visit[305][305]={{0}},m=0,k=0,l,bx,by,ex,ey,step=0; cin>>l>>bx>>by>>ex>>ey; struct node root,p ,queue[300*300+30]; root.x=bx;root.y=by;root.step=0; queue[k++]=root; while(true){ root=queue[m++]; if(root.x==ex && root.y==ey) { step=root.step; break; } else { for(int j=0;j<8;j++) { p.x=root.x+dir[j][0]; p.y=root.y+dir[j][1]; p.step=root.step+1; if(p.x>=0 &&p.x<l &&p.y<l &&p.y>=0 &&visit[p.x][p.y]==0) { visit[p.x][p.y]=1; queue[k++]= p; } } } } cout<<step<<endl; } return 0;}
0 0
- Knight Moves(poj1915)
- poj1915 Knight Moves(bfs)
- poj1915 Knight Moves(bfs)
- POJ1915(Knight Moves,双向BFS)
- poj1915 & poj2243 Knight Moves
- poj1915 Knight Moves
- poj1915 - Knight Moves
- POJ1915:Knight Moves(BFS)
- poj1915 Knight Moves
- POJ1915---Knight Moves
- POJ1915 (Knight Moves) BFS
- POJ1915 Knight Moves
- POJ1915 Knight Moves
- POJ1915--Knight's Moves
- [POJ1915] Knight Moves
- poj1915——Knight Moves
- POJ1915 Knight Moves 经典BFS
- POJ1915 Knight Moves BFS (UVA439 与之相似)
- div滚动条控制
- 谁需要它无论如何在线音频图书租赁服务
- Java程序员常犯的10个错误
- android即时消息处理机制
- HDU1028 Ignatius and the Princess III 【母函数模板题】
- Knight Moves(poj1915)
- Xampp安装,Xampp配置,Xampp教程,解决80端口动态IP无公网IP
- PHP读取数据库并按照中文名称进行排序实现代码
- 安卓自定义alertdialog中edittext点击不出现输入键盘解决方法
- The Suspects
- Android中Service类onStartCommand的返回值问题
- Web 设计新趋势: 使用 SVG 代替 Web Icon Font
- 该阶段超外差接收机
- 兼容IE和FF:获取Referer的JS和PHP方法 及 PHP利用curl伪造IP和来路