最少步数

题目链接
方向数组有12个，基础的bfs

#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
using namespace std;
const int INF=0x3f3f3f3f;
struct Node{
	int x,y,level;
}now,Next,start;
int x1,y1,x2,y2;
bool vis[110][110];
int dx[]={1,1,-1,-1,2,2,-2,-2, 2,2,-2,-2};
int dy[]={2,-2,2,-2,1,-1,1,-1, 2,-2,2,-2};
int bfs(int x,int y){
	memset(vis,0,sizeof(vis));
	start.x=x,start.y=y,start.level=0;
	queue<Node> q;
	vis[x][y]=1;
	q.push(start);
	while(!q.empty()){
		now=q.front();
		q.pop();
		if(now.x==1&&now.y==1) return now.level;
		for(int i=0;i<12;i++){
			int nx=now.x+dx[i];
			int ny=now.y+dy[i];
			if(nx>=1&&nx<=100&&ny>=1&&ny<=100&&!vis[nx][ny]){
				Next.x=nx,Next.y=ny,Next.level=now.level+1;
				vis[nx][ny]=1;
				q.push(Next);
			} 
		}
	} 
	return -1;
}
int main(){
	cin>>x1>>y1>>x2>>y2;
	int ans1,ans2;
	ans1=bfs(x1,y1);
	ans2=bfs(x2,y2);
	cout<<ans1<<endl<<ans2<<endl;
}