最小步数NYOJ bfs

#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;

int d[9][9];  //标记此点是否访问并记录距离
int maze[9][9]={
    1,1,1,1,1,1,1,1,1,
    1,0,0,1,0,0,1,0,1,
    1,0,0,1,1,0,0,0,1,
    1,0,1,0,1,1,0,1,1,
    1,0,0,0,0,1,0,0,1,
    1,1,0,1,0,1,0,0,1,
    1,1,0,1,0,1,0,0,1,
    1,1,0,1,0,0,0,0,1,
    1,1,1,1,1,1,1,1,1};
const int INF=1<<10;
typedef pair<int ,int> P;
int n,sx,sy,gx,gy;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};   

int bfs()
{
    memset(d,0,sizeof(d));
    queue<P> que;
    for(int i=0;i<9;i++)
        for(int j=0;j<9;j++)
            d[i][j]=INF;
    que.push(P(sx,sy));
    d[sx][sy]=0;
    
    while(!que.empty())
    {
        P p=que.front();
        que.pop();
        if(p.first==gx&&p.second==gy)
            break;
        
        for(int i=0;i<4;i++)
        {
            int nx=p.first+dx[i],ny=p.second+dy[i];
            
            if(0<=nx&&nx<=8&&0<=ny&&ny<=8&&maze[nx][ny]==0&&d[nx][ny]==INF)  //当前位置是否可以加入
            {
                que.push(P(nx,ny));
                d[nx][ny]=d[p.first][p.second]+1;
            }
        }
    }
    return d[gx][gy];
}

int main()
{
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d%d%d%d",&sx,&sy,&gx,&gy);
        printf("%d
",bfs());
    }
    return 0;
}

挑战程序设计迷宫最短路径模板

#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;

int d[9][9];  //标记此点是否访问并记录距离
int maze[9][9]={
    1,1,1,1,1,1,1,1,1,
    1,0,0,1,0,0,1,0,1,
    1,0,0,1,1,0,0,0,1,
    1,0,1,0,1,1,0,1,1,
    1,0,0,0,0,1,0,0,1,
    1,1,0,1,0,1,0,0,1,
    1,1,0,1,0,1,0,0,1,
    1,1,0,1,0,0,0,0,1,
    1,1,1,1,1,1,1,1,1};
//typedef pair<int ,int> P;
struct node{
    int x,y,c;
};
int n,sx,sy,gx,gy;
int vis[9][9];  //判断是否访问了
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};   

int bfs()
{
    memset(vis,0,sizeof(vis));
    node ee,e1;
    ee={sx,sy,0};
    vis[sx][sy]=1;
    queue<node> q;
    q.push(ee);
    while(!q.empty())
    {
        ee=q.front();
        q.pop();
        if(ee.x==gx&&ee.y==gy)
            break;
        for(int i=0;i<4;i++)
        {
            int nx=ee.x+dx[i],ny=ee.y+dy[i];
            if(nx>=0&&nx<=8&&ny>=0&&ny<=8&&maze[nx][ny]==0&&vis[nx][ny]==0) 
            {
                e1.x=nx;e1.y=ny;e1.c=ee.c+1;
                q.push(e1);
                vis[nx][ny]=1;
            }
        }
    }
    return ee.c;
}

int main()
{
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d%d%d%d",&sx,&sy,&gx,&gy);
        printf("%d
",bfs());
    }
    return 0;
}

 原先写的，写完上面之后，知道自己错在判断条件上。