1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41
| #include <iostream> #include <queue> #include <cstring> #define x first #define y second using namespace std; const int N = 410; typedef pair<int, int> PII; int d[N][N], n, m, x0, y0; int nx[8] = {1, 1, -1, -1, 2, 2, -2, -2}; int ny[8] = {2, -2, 2, -2, 1, -1, 1, -1}; void bfs() { memset(d, -1, sizeof d); queue<PII> q; q.push({x0, y0}); d[x0][y0] = 0; while(q.size()) { PII t = q.front(); q.pop(); for(int i = 0; i < 8; i++) { int x = nx[i] + t.x, y = ny[i] + t.y; if(d[x][y]!=-1||x < 1 || y < 1|| x > n||y >m) continue; q.push({x, y}); d[x][y] = d[t.x][t.y] + 1; } } } int main() { cin >> n >> m >> x0 >> y0; bfs(); for(int i = 1; i <= n; i++, puts("")) for(int j = 1; j <= m; j++) printf("%-5d", d[i][j]); return 0; }
|