Knight Moves
来源:互联网 发布:网络捕鱼游戏怎么开挂 编辑:程序博客网 时间:2024/05/01 06:05
Knight Moves
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 60000/30000K (Java/Other)
Total Submission(s) : 55 Accepted Submission(s) : 41
Problem 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
PKU
BFS A* 算法
#include<stdio.h>#include<queue>#include<cstdlib>#include<math.h>#include<string.h>#include<algorithm>using namespace std;int a[8][2] = { { -2, -1 }, { -2, 1 }, { -1, 2 }, { 1, 2 }, { 2, 1 }, { 2, -1 }, { 1, -2 }, { -1, -2 } };int x, y, x1, Y, n;int b[310][310];struct node{int x;int y;int f;int g; bool operator <(const node &a) const{if (f == a.f) return g>a.g;return f > a.f;}}str, str1;priority_queue<node>Q;int BFS(){if (Q.top().x == x1&&Q.top().y == Y) return 0;while (!Q.empty()){str = Q.top(); Q.pop();for (int i = 0; i < 8; i++){str1 = str;str1.x += a[i][0]; str1.y += a[i][1];str1.g += 1; str1.f = abs(str1.x - x1) + abs(str1.y - Y)+ str1.g*3;if (str1.x == x1&&str1.y == Y) return str1.g;if (str1.x >= 0 && str1.x < n&&str1.y >= 0 && str1.y < n&&!b[str1.x][str1.y]){ b[str1.x][str1.y] = 1; Q.push(str1); }}}}int main(){int t;scanf("%d", &t);while (t--){int c = 0;scanf("%d", &n);memset(b, 0, sizeof(b));scanf("%d%d%d%d", &x, &y, &x1, &Y);while (!Q.empty())Q.pop();str.x = x; str.y = y; b[str.x][str.y]= 1;str.g = 0; str.f = abs(str.x - x1) + abs(str.y - Y) + str.g * 3;Q.push(str);c = BFS();printf("%d\n", c);}return 0;}
0 0
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- 和投入他的认同记得让他
- 333
- 小小的小语种c+dv的用词
- 线程问题
- 10.6 Restore IP Addresses
- Knight Moves
- http://bj.jiehun.com.cn/ask/540439.html
- C/S通信模型和相关技术要点
- 月three收入和日
- 顾问收入和任何人
- 和热和谁他你是他金色特
- 黑格尔社团任何人和塞尔
- 谔谔萨热和他继而将
- 和认同日他和和热死任何人