c++程序设计题:题目是Knight Moves 请高手帮忙,非常感谢!
DescriptionBackgroundMrSomurolov,fabulouschess-gamerindeed,assertsthatnooneelsebuthim...
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.
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.
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
3
8
0 0
7 0
100
0 0
30 50
10
1 1
1 1
Sample Output
5
28
0 展开
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.
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.
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
3
8
0 0
7 0
100
0 0
30 50
10
1 1
1 1
Sample Output
5
28
0 展开
展开全部
#include<cstdio>
#include<cstring>
using namespace std;
int n,m,depe[10][2]={{1,2},{2,1},{2,-1},{1,-2},{-1,-2},{-2,-1},{-2,1},{-1,2}};
int starx,stary,endx,endy,book[310][310],line[4][900000];
void bfss(int num,int sum){
if(num>sum) return;
int x=line[1][num];
int y=line[2][num];
if(x==endx&&y==endy){
printf("%d\n",line[3][num]-1);
return;
}
for(int i=0;i<8;++i){
int newx=x+depe[i][0];
int newy=y+depe[i][1];
if(newx>=0&&newy>=0&&newx<n&&newy<n&&book[newx][newy]==0){
sum++;
line[1][sum]=newx;
line[2][sum]=newy;
line[3][sum]=line[3][num]+1;
book[newx][newy]=1;
}
}
bfss(num+1,sum);
return;
}
int main(){
scanf("%d",&m);
while(m){
scanf("%d",&n);
scanf("%d %d",&starx,&stary);
scanf("%d %d",&endx,&endy);
memset(book,0,sizeof(book));
memset(line,0,sizeof(line));
book[starx][stary]=1;
line[3][1]=1;
line[1][1]=starx;
line[2][1]=stary;
bfss(1,1);
m--;
}
return 0;
}
2011-02-26
展开全部
太复杂了!
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询