搜索已确认无误，但是输出格式总是不对，望dalao帮改

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
#define MAXN 508
using namespace std;
const int dx[12]={-2,-2,2,2,-1,-1,1,1};
const int dy[12]={-1,1,-1,1,-2,2,-2,2};
int n,m,x1,y1;
int maze[MAXN][MAXN];
bool v[MAXN][MAXN];
struct point{
	int x,y,step;
};
void bfs(){
	memset(v,0,sizeof(v));
	queue<point> q;
	q.push({x1,y1,0});
	v[x1][y1]=1;
	while(!q.empty()){
		point u=q.front();
		q.pop();
		for(int i=0;i<8;i++){
			int nx=u.x+dx[i],ny=u.y+dy[i];
			if(nx>=1&&nx<=n&&ny>=1&&ny<=m){
				if(v[nx][ny]==0){
					q.push({nx,ny,u.step+1});
					maze[nx][ny]=u.step+1;
					v[nx][ny]=1;
				}
			}
		}
	}
	return ;
}
int main(){
	scanf("%d%d%d%d",&n,&m,&x1,&y1);
	bfs();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(maze[i][j]==0&&(i!=x1||j!=y1)){
				maze[i][j]=-1;
			}
			if(j==1){
				printf("%d",maze[i][j]);
			}else{
				printf("%5d",maze[i][j]);
			}
		}
		printf("\n");
	} 
	return 0;
}