test

最新推荐文章于 2022-08-22 08:59:05 发布

liujc_

最新推荐文章于 2022-08-22 08:59:05 发布

阅读量436

点赞数 1

本文链接：https://blog.csdn.net/liujc_/article/details/51746414

版权

//hdu 1728
#include<cstdio>
#include<cstring>
#include<queue>
#define INF 10000000;
using namespace std;
int d1[4] = {0,0,1,-1};
int d2[4] = {1,-1,0,0};
int turn1[101][101];
char map[101][101];
int n,m,k;
int ok;
int sx,sy,ex,ey;
struct state
{
    int x,y;
    int turn;
    int dir;
}cur,next1;
void bfs(state temp)
{
    temp.dir = -1;
    temp.turn = 0;
    turn1[temp.x][temp.y] = 0;
    queue<state> q;
    q.push(temp);
    while(!q.empty())
    {
        cur = q.front();
        q.pop();  //之后最好将队列的头元素取出之后就将其弹出，避免之后忘记。。不要像以前那样写在下面。。防止剪枝的时候出错。。 
        if(cur.x == ex-1 && cur.y == ey-1)
        {
            if(cur.turn <= k)
            {
                ok = 1;
                printf("yes\n");
                return ;
            }
        }
        if(cur.turn > k)
        {
            //q.pop();  //剪枝后没有写这句然后死循环 
            continue;
        }
        for(int i = 0;i < 4;i++)
        {
            next1.x = cur.x + d1[i];
            next1.y = cur.y + d2[i];
            if(next1.x>=0&&next1.x<n&&next1.y>=0&&next1.y<m&&map[next1.x][next1.y]!='*')
            {
                if(cur.dir!=i &&cur.dir!=-1)
                {
                    next1.dir = i;
                    next1.turn = cur.turn+1;
                    if(next1.turn<=turn1[next1.x][next1.y])//此处必须是等于号
                    {
                        turn1[next1.x][next1.y] = next1.turn;
                        q.push(next1);   //一定要保证当前的转弯数是该点转弯数最小的才入队。。不然直接爆空间。。
                    }
                }
                else 
                {
                    next1.dir = i;
                    next1.turn = cur.turn;
                    if(next1.turn<=turn1[next1.x][next1.y])
                    {
                        turn1[next1.x][next1.y] = next1.turn;
                        q.push(next1);  
                    }
                }
            }
        }
        //q.pop();
    }
}
int main ()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        ok = 0;
        scanf("%d %d",&n,&m);
        for(int i = 0;i < n;i++)
        for(int j = 0;j < m;j++)
        turn1[i][j] = INF;
        for(int i = 0;i < n;i++)
        scanf("%s",map[i]);
        scanf("%d%d%d%d%d",&k,&sy,&sx,&ey,&ex);
        cur.x = sx-1;
        cur.y = sy-1;
        bfs(cur);
        if(!ok) printf("no\n");
    }
    return 0;
}