ZSTU-2331:Knight Moves

//BFS
#include<iostream>
#include<cstring>
#define MAXN 100000
#define N 305
using namespace std;
int mp[N][N];
int dir[8][2] = {{-2,1},{-1,2},{1,-2},{2,1},{2,-1},{1,2},{-1,-2},{-2,-1}};//马走的方向
typedef struct Que
{
	int i,j;
	int step;
}Queue;
Queue q[MAXN];
int front,rear,L,cnt;
int flag;
void BFS(int si,int sj,int ei,int ej)
{
	memset(mp,0,sizeof(mp));
	int i,j,di;
	front =  -1;
	rear = 0;
	q[rear].i = si,q[rear].j = sj;
	q[rear].step = 0;
	while(front<rear)	//如果用循环队列这里就改为front!=rear
	{
//		front = (front+1)%MAXN;//可以用循环队列,数组也不用开那么大10000就够了
		front++;
		i = q[front].i,j = q[front].j;
		if (i==ei && j==ej)
			return;
		di = -1;
		while(++di<8)
		{
			if (i+dir[di][0]>=0&&i+dir[di][0]<L 
				&&j+dir[di][1]>=0 && j+dir[di][1]<L 
				&& mp[i+dir[di][0]][j+dir[di][1]]==0)	//判断是否可走
			{
			//	rear = (rear+1)%MAXN;
				rear++;
				q[rear].i = i+dir[di][0];
				q[rear].j = j+dir[di][1];
				mp[q[rear].i][q[rear].j] = 1;
				q[rear].step = q[front].step+1;//记录步长
			}
		}
	}
}
int main()
{
	int t,si,sj,ei,ej;
	cin>>t;
	while(t--)
	{
		cin>>L>>si>>sj>>ei>>ej;
		if (si==ei &&sj==ej)
			cout<<0<<endl;
		else 
		{
			BFS(si,sj,ei,ej);
			cout<<q[front].step<<endl;
		}
	}
	return 0;
}