题面
题解
从起点开始,步数为0,然后BFS能走到’日’的方向,更新距离即可
代码
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
const int N = 160;
int n, m;
char g[N][N];
PII q[N * N];
int dist[N][N];
int dx[] = {-2, -1, 1, 2, 2, 1, -1, -2};
int dy[] = {1, 2, 2, 1, -1, -2, -2, -1};
int bfs() {
int sx, sy;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (g[i][j] == 'K') {
sx = i, sy = j;
break;
}
}
}
int hh = 0, tt = -1;
q[++tt] = {sx, sy};
memset(dist, -1, sizeof dist);
dist[sx][sy] = 0;
while (hh <= tt) {
auto t = q[hh++];
int x = t.first, y = t.second;
for (int i = 0; i < 8; i++) {
int nx = x + dx[i], ny = y + dy[i];
if (nx < 0 || nx > n - 1 || ny < 0 || ny > m - 1) continue;
if (g[nx][ny] == '*') continue;
if (dist[nx][ny] != -1) continue;
if (g[nx][ny] == 'H') return dist[x][y] + 1;
dist[nx][ny] = dist[x][y] + 1;
q[++tt] = {nx,ny};
}
}
return -1;
}
int main() {
cin >> m >> n;
for (int i = 0; i < n; i++) cin >> g[i];
cout << bfs() << endl;
return 0;
}