AcWing188. 武士风度的牛

输入样例：

10 11
..........
....*.....
..........
...*.*....
.......*..
..*..*...H
*.........
...*...*..
.K........
...*.....*
..*....*..

输出样例：

5

#include
using namespace std;
const int N=200;
int n,m,vis[N][N],sx,sy,ex,ey;
char ch[N][N];
struct node{
	int x,y,t;
};
int check(int x,int y){
	return x>0&&y>0&&x<=m&&y<=n;
}
int dir[8][2]={2,-1,2,1,-2,-1,-2,1,1,2,1,-2,-1,2,-1,-2};
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			cin>>ch[i][j];
			if(ch[i][j]=='K') sx=i,sy=j;
			else if(ch[i][j]=='H') ex=i,ey=j;
		}
	}
//	cout<q;
	q.push({sx,sy,0});
	vis[sx][sy]=1;
	while(q.size()){
		node u=q.front();
//		cout<