HDU1728 逃离迷宫(BFS)

迷宫题，典型的BFS，至于方向的判断，是一直沿一个方向搜索，特别坑的是把xy输入反一下，检查了好久。。。

#include<iostream>
#include<queue>
#include<string.h>
using namespace std;

int dir[4][2] = {1,0,-1,0,0,1,0,-1};
int n,m,map[101][101],x1,x2,yy1,y2,k;
char str[101][101];

struct node
{
    int x,y,s;
}p,q;

int bfs(int x,int y)
{
    int i,flag;
    queue<node> Q;
    p.x = x;
    p.y = y;
    p.s = -1;
    map[p.x][p.y] = -1;
    Q.push(p);
    while(!Q.empty())
    {
        p = Q.front();
        Q.pop();
        if(p.s>k)
            return -1;
        if(p.x == x2 && p.y == y2)
            return 1;
        for(i = 0; i<4; i++)
        {
            q.x = p.x+dir[i][0];
            q.y = p.y+dir[i][1];
            while(q.x>=1 && q.x<=m && q.y>=1 && q.y<=n && map[q.x][q.y] != -1)
            {
                if(map[q.x][q.y] == 0)
                {
                    q.s = map[q.x][q.y] = p.s+1;
                    Q.push(q);
                }
                q.x+=dir[i][0];
                q.y+=dir[i][1];
            }
        }
    }
    return -1;
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d %d",&m,&n);
		getchar();
		for(int i = 1;i<=m;i++){
			for(int j = 1;j<=n;j++){
				scanf("%c",&str[i][j]);
				if(str[i][j] == '.')
					map[i][j] = 0;
				else map[i][j] = -1;
			}
			getchar();
		}
        scanf("%d%d%d%d%d",&k,&yy1,&x1,&y2,&x2);
        int flg = bfs(x1,yy1);
        if(flg == -1)
            printf("no\n");
        else
            printf("yes\n");
    }

    return 0;
}