POJ 3083 BFS+DFS

题意真让人迷糊，尤其是方向半天没有搞明白，题目中这两句话（output on a single line the number of (not necessarily unique（可以重复访问某一点）) squares that a person would visit (including the 'S' and 'E') for (in order) the left, right, and shortest paths， Movement from one square to another is only allowed in the horizontal or vertical direction; movement along the diagonals is not allowed.）意思是

（1）优先沿着左边（左上右下的顺时针次序   相对与当前方向）根据上一步的方向来判断当前位置的走向

（2） 优先沿着右边（右上左下的逆时针次序  相对于当前方向）

（3）寻找最点路径（BFS）

大致题意就是这样！

大牛写的代码，简洁漂亮http://blog.csdn.net/wahaha1_/article/details/8664765

#include<stdio.h>
#include<string.h>
int n,m;
int r[4][2]= {{0,-1},{1,0},{0,1},{-1,0}};
int l[4][2]= {{0,1},{1,0},{0,-1},{-1,0}};
int vis[50][50];
char map[50][50];
int sx,sy,ex,ey,ans;
int que[2500][2];
int dfs1(int x,int y,int step)
{
    if(x==ex&&y==ey)
        return step+1;
    if(x<0||x>=n||y<0||y>=m||map[x][y]=='#')
        return 0;
    ans=(ans+3)%4;
    int temp=0;
    while(1)
    {
        temp=dfs1(x+l[ans][0],y+l[ans][1],step+1);
        if(temp>0)
            break;
        ans=(ans+1)%4;
    }
    return temp;
}
int dfs2(int x,int y,int step)
{
    if(x==ex&&y==ey)
        return step+1;
    if(x<0||x>=n||y<0||y>=m||map[x][y]=='#')
        return 0;
    ans=(ans+3)%4;
    int temp=0;
    while(1)
    {
        temp=dfs2(x+r[ans][0],y+r[ans][1],step+1);
        if(temp>0)
            break;
        ans=(ans+1)%4;
    }
    return temp;
}
int bfs()
{
    int fir=0,sec=0;
    que[sec][0]=sx;
    que[sec++][1]=sy;
    vis[sx][sy]=1;
    int step=1;
    while(fir<sec&&!vis[ex][ey])
    {
        int tmp=sec;
        step++;
        while(fir<tmp&&!vis[ex][ey])
        {
            int x=que[fir][0];
            int y=que[fir++][1];
            for(int i=0; i<4; i++)
            {
                int x1=x+r[i][0];
                int y1=y+r[i][1];
                if(x1>=0&&x1<n&&y1>=0&&y1<m&&!vis[x1][y1]&&map[x1][y1]!='#')
                {
                    que[sec][0]=x1;
                    que[sec++][1]=y1;
                    vis[x1][y1]=1;
                }
            }
        }
    }
    return step;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&m,&n);
        memset(que,0,sizeof(que));
        memset(vis,0,sizeof(vis));
        for(int i=0; i<n; i++)
        {
            scanf("%s",map[i]);
            for(int j=0; j<m; j++)
            {
                if(map[i][j]=='S')
                {
                    sx=i;
                    sy=j;
                }
                if(map[i][j]=='E')
                {
                    ex=i;
                    ey=j;
                }
            }
        }
        ans=0;
        printf("%d",dfs1(sx,sy,0));
        ans=0;
        printf(" %d",dfs2(sx,sy,0));
        printf(" %d\n",bfs());
    }
    return 0;
}

对上面代码加了注解：

#include<stdio.h>
#include<string.h>
int n,m;
int r[4][2]= {{0,-1},{1,0},{0,1},{-1,0}};		//逆时针
int l[4][2]= {{0,1},{1,0},{0,-1},{-1,0}};		//顺时针
int vis[50][50];
char map[50][50];
int sx,sy,ex,ey,ans;
int que[2500][2];
int dfs1(int x,int y,int step)
{
    if(x==ex&&y==ey)
        return step+1;
    if(x<0||x>=n||y<0||y>=m||map[x][y]=='#')
        return 0;
    ans=(ans+3)%4;		//相对当前走向，优先沿着左边
    int temp=0;
    while(1)		//判断当前位置的走向
    {
        temp=dfs1(x+l[ans][0],y+l[ans][1],step+1);
        if(temp>0)
            break;
        ans=(ans+1)%4;
    }
    return temp;
}
int dfs2(int x,int y,int step)
{
    if(x==ex&&y==ey)
        return step+1;
    if(x<0||x>=n||y<0||y>=m||map[x][y]=='#')
        return 0;
    ans=(ans+3)%4;
    int temp=0;
    while(1)
    {
        temp=dfs2(x+r[ans][0],y+r[ans][1],step+1);
        if(temp>0)
            break;
        ans=(ans+1)%4;
    }
    return temp;
}
int bfs()
{
    int fir=0,sec=0;
    que[sec][0]=sx;
    que[sec++][1]=sy;
    vis[sx][sy]=1;
    int step=1;
    while(fir<sec&&!vis[ex][ey])
    {
        int tmp=sec;
        step++;
        while(fir<tmp&&!vis[ex][ey])
        {
            int x=que[fir][0];
            int y=que[fir++][1];
            for(int i=0; i<4; i++)
            {
                int x1=x+r[i][0];
                int y1=y+r[i][1];
                if(x1>=0&&x1<n&&y1>=0&&y1<m&&!vis[x1][y1]&&map[x1][y1]!='#')
                {
                    que[sec][0]=x1;
                    que[sec++][1]=y1;
                    vis[x1][y1]=1;
                }
            }
        }
    }
    return step;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&m,&n);
        memset(que,0,sizeof(que));
        memset(vis,0,sizeof(vis));
        for(int i=0; i<n; i++)
        {
            scanf("%s",map[i]);
            for(int j=0; j<m; j++)
            {
                if(map[i][j]=='S')
                {
                    sx=i;
                    sy=j;
                }
                if(map[i][j]=='E')
                {
                    ex=i;
                    ey=j;
                }
            }
        }
        ans=0;
        printf("%d",dfs1(sx,sy,0));
        ans=0;
        printf(" %d",dfs2(sx,sy,0));
        printf(" %d\n",bfs());
    }
    return 0;
}