hdu 1026 bfs+记录路径

题意：从0,0点出发到n-1,m-1点，路上的数字代表要在这个点额外待多少秒，求最短的路

递归输出路径即可

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
using namespace std;
#define MOD 1000000007
const int INF=0x3f3f3f3f;
const double eps=1e-5;
#define cl(a) memset(a,0,sizeof(a))
#define ts printf("*****
");
const int MAXN=1005;
int n,m,tt;
int sumt=0;
struct node
{
    int x,y,t;
    node(){}
    node(int xx,int yy,int tt)
    {
        x=xx,y=yy,t=tt;
    }
    friend bool operator<(node a,node b)
    {
        return a.t>b.t;
    }
};
bool vis[MAXN][MAXN];
int dir[MAXN][MAXN];
char maze[MAXN][MAXN];
int d[4][2]={0,1,1,0,-1,0,0,-1};
int kk=0;
int outpath(int x,int y)    //递归输出，从x，y出发所在的时间
{
    if(x==0&&y==0)
    {
        int nt=1;
        printf("%ds:(%d,%d)->",nt,x,y);
        return nt;
    }
    else
        kk=dir[x][y];
    int nt=outpath(x-d[kk][0],y-d[kk][1]);
    printf("(%d,%d)
",x,y);
    if(0<maze[x][y]-'0'&&maze[x][y]-'0'<=9)
    {
        int l=maze[x][y]-'0';
        while(l--)
        printf("%ds:FIGHT AT (%d,%d)
",++nt,x,y);
    }
    if(nt==sumt) return 0;
    printf("%ds:(%d,%d)->",++nt,x,y);
    return nt;
}
void bfs()
{
    node now,next;
    priority_queue<node> q;
    q.push(node(0,0,0));
    vis[0][0]=1;
    while(!q.empty())
    {
        now=q.top();
        q.pop();
        if(now.x==n-1&&now.y==m-1)
        {
            printf("It takes %d seconds to reach the target position, let me show you the way.
",now.t);
            sumt=now.t;
            outpath(n-1,m-1);
            printf("FINISH
");
            return;
        }
        for(int i=0;i<4;i++)
        {
            next.x=now.x+d[i][0];
            next.y=now.y+d[i][1];
            next.t=now.t+1;
            if(next.x>=0&&next.y>=0&&next.x<n&&next.y<m&&!vis[next.x][next.y]&&maze[next.x][next.y]!='X')
            {
                if('0'<maze[next.x][next.y]&&maze[next.x][next.y]<='9')
                {
                    next.t+=maze[next.x][next.y]-'0';
                    vis[next.x][next.y]=1;
                    dir[next.x][next.y]=i;
                    q.push(next);
                }
                else
                {
                    dir[next.x][next.y]=i;
                    vis[next.x][next.y]=1;
                    q.push(next);
                }
            }
        }
    }
    puts("God please help our poor hero.
FINISH");
}
int main()
{
    int i,j,k;
    #ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    #endif
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        for(i=0;i<n;i++)
        {
            scanf("%s",maze[i]);
        }
        cl(vis);
        bfs();
    }
}