POJ 1915 Knight Moves(BFS)
来源:互联网 发布:高达纸模淘宝店有哪些 编辑:程序博客网 时间:2024/05/18 02:15
Knight Moves
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 26653 Accepted: 12559
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
Source
TUD Programming Contest 2001, Darmstadt, Germany
#include<iostream> #include<cstring> #include<queue> using namespace std; #define maxn 305 bool vis[maxn][maxn]; int a[maxn][maxn]; int n,sx,sy,ex,ey; int dir[8][2]={-2,1,-1,2,1,2,2,1,2,-1,1,-2,-1,-2,-2,-1}; struct node { int x,y,step; }; bool OK(int x,int y) { if(x>=0&&x<n&&y>=0&&y<n) return true; else return false; } int BFS() { queue<node>q; node start,mid,next; start.x=sx; start.y=sy; start.step=0; q.push(start); while(!q.empty()) { mid = q.front(); q.pop(); if(mid.x == ex && mid.y == ey) return mid.step; for(int i = 0; i<8; i++) { next.x = mid.x+dir[i][0]; next.y = mid.y+dir[i][1]; if(next.x == ex && next.y == ey) return mid.step+1; if (OK(next.x,next.y)&&!vis[next.x][next.y]) { next.step=mid.step+1; vis[next.x][next.y]=true; q.push(next); } } } return 0;} int main() { int t; cin>>t; while(t--) { cin>>n; cin>>sx>>sy; cin>>ex>>ey; memset(vis,false,sizeof(vis)); vis[sx][sy]=true; cout<<BFS()<<endl; } return 0; }
阅读全文
0 0
- POJ 1915 Knight Moves (BFS)
- poj 1915 Knight Moves(BFS遍历)
- Poj 1915 Knight Moves(BFS)
- POJ 1915 Knight Moves(BFS)
- POJ 1915-Knight Moves(BFS-跳马)
- POJ 1915 Knight Moves(BFS)
- POJ 1915:Knight Moves(BFS)
- poj 1915 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
- [BFS]poj 1915 Knight Moves
- Poj 1915 Knight Moves ( BFS
- POJ 1915 Knight Moves BFS
- 【BFS】poj 1915 Knight Moves
- POJ 1915 Knight Moves bfs || 双向bfs
- 一些前端开发中最常用的JS代码片段
- 10.2.0.4 DG 数据文件同步问题处理
- 题目1178:复数集合
- Android 百分比屏幕适配方案
- Centos7 dumpe2fs: 没有那个文件或目录
- POJ 1915 Knight Moves(BFS)
- 线程与进程的区别
- 阿拉伯数字(1到4000)转化为罗马数字的javascript实现
- Android图片放置技巧
- 运行cs231n课程中Assignment1中的示例代码
- less 和 sass 配置
- 【实战教程】腾讯云&搭建微信小程序服务
- 立体视觉_基于多频外差的三频正弦波理想状态下的解相位
- SpringBoot中级教程之SpringBoot自定义配置(十一)