U230140 武士风度的牛

#include <bits/stdc++.h>
using namespace std;
const int N = 200, M = 110, INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
typedef long long int LL;
int n, m;
char g[N][N];
#define x first
#define y second
int dist[N][N];
typedef pair<int, int> PII;
PII q[N * N];
int dx[8] = {-1, -2, -2, -1, 1, 2, 2, 1};
int dy[8] = {-2, -1, 1, 2, 2, 1, -1, -2};
int bfs(int x,int y)
{
    memset(dist, -1, sizeof dist);
    dist[x][y] = 0;
    int hh = 0, tt = 0;
    q[0] = {x, y};
    while (tt >= hh)
    {
        PII t = q[hh++];
        for (int i = 0; i < 8; i++)
        {
            int a = t.x + dx[i], b = t.y + dy[i];
            if (a < 0 || a >= n || b < 0 || b >= m)
                continue;
            if (dist[a][b] != -1)
                continue;
            if(g[a][b]=='*')
                continue;
            if(g[a][b]=='H')
                return dist[t.x][t.y] + 1;
            dist[a][b] = dist[t.x][t.y] + 1;
            q[++tt] = {a, b};
        }
    }
    return -1;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> m >> n;
    int begini = 0, beginj = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> g[i];
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (g[i][j] == 'K')
            {
                begini = i;
                beginj = j;
                break;
            }
        }
    }
    cout << bfs(begini, beginj) << endl;
    return 0;
}