HDU 2128 Tempter of the Bone II（BFS）

#include "stack"
#include "cstdio"
#include "iostream"
#include "cmath"
#include "set"
#include "sstream"
#include "cctype"
#include "string"
#include "cstring"
#include "algorithm"
#include "queue"
//#include "map"
using namespace std;
#define LL long long
#define inf 0x7ffffff
#define pa pair<int,int>
#define pi 3.1415926535897932384626433832795028841971

const int M=20;

struct node
{
    int x;
    int y;
    int vis[10][10];
    int cnt,nx;
}s,t;

int n,m;
char map[10][10];
//int vis[10][10];
int dir[4][2]={0,1,0,-1,1,0,-1,0};
int xx,yy,ans;

int bfs()
{
    int i,j;
	s.x=xx;s.y=yy;
	s.cnt=0;s.nx=0;
    queue<node>q;
	q.push(s);
    while(!q.empty())
    {
        t=q.front();
		q.pop();
        if(ans!=inf&&t.cnt>=ans)
            continue;
        for(i=0;i<4;++i)
        {
            int sx=t.x+dir[i][0];
			int sy=t.y+dir[i][1];
            int ss=t.cnt;int vis1=-1;
            if(sx>=0&&sx<n&&sy>=0&&sy<m)
            {
                if(map[sx][sy]=='D')
                {
                    if(ans>=ss+1)
                    {
                        ans=ss+1;
                    }

                }
                else if(t.vis[sx][sy]!=-1||map[sx][sy]=='.')
                {
                    ss+=1;vis1=t.nx;
                }
                else if(map[sx][sy]=='X'&&t.nx>0)
                {
                    ss+=2;vis1=t.nx-1;
                }
                else if(map[sx][sy]>='1'&&map[sx][sy]<='9')
                {
                    ss+=1;vis1=t.nx+(map[sx][sy]-'0');

                }
                if(vis1>t.vis[sx][sy])
                {
                    s.x=sx;s.y=sy;
                    s.cnt=ss;s.nx=vis1;
                    memcpy(s.vis,t.vis,sizeof(s.vis));
                    s.vis[sx][sy]=vis1;
                    q.push(s);
                }

            }

}

}
    if(ans==inf)
	return 0;
    else 
	return 1;

}
int main()
{
    int i,j;
    while(scanf("%d%d",&n,&m),n+m)
    {
        for(i=0;i<n;++i)
        {
            getchar();
            for(j=0;j<m;++j)
            {
                scanf("%c",&map[i][j]);
                if(map[i][j]=='S')
                {
                    xx=i;yy=j;
                }
            }
        }
        memset(s.vis,-1,sizeof(s.vis));
        s.vis[xx][yy]=0;ans=inf;
        int boo=bfs();
        if(boo==1)
            printf("%d\n",ans);
        else
            printf("-1\n");


    }

}

题意不多说，，麻烦了点，需要用到两个数组来标记。