#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 410;
#define x first
#define y second
int n, m, a, b;
typedef pair<int, int > PII;
PII q[N * N];
int dist[N][N];
int dx[] = { 2,2,1,1,-1,-1,-2,-2 };
int dy[] = { 1,-1,2,-2,2,-2,1,-1 };
void bfs(int x1, int y1) {
memset(dist, -1, sizeof(dist));
q[0] = { x1,y1 };
dist[x1][y1] = 0;
int hh = 0, tt = 0;
while (hh <= tt) {
auto t = q[hh++];
for (int i = 0; i < 8; i++) {
int c = t.x + dx[i], d = t.y + dy[i];
if (c<1 || d<1 || c>n || d>m) continue;
if (dist[c][d] >= 0) continue;
dist[c][d] = dist[t.x][t.y] + 1;
q[++tt] = { c, d };
}
}
}
int main() {
cin >> n >> m >> a >> b;
bfs(a, b);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
printf("%-5d", dist[i][j]);
}
cout << endl;
}
return 0;
}
P1443马的遍历
最新推荐文章于 2024-10-03 13:36:06 发布