优先队列走迷宫,并记忆到达时间
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
#define MAX 999999
using namespace std;
int time,n,m;
int marktime[105][105];
char map[105][105];
int b[4][2]= {0,1,1,0,0,-1,-1,0};
struct node
{
int i,j,t;
friend bool operator<(node a,node b)
{
return a.t>b.t;
}
};
int ok(int i,int j)//判断是否时可行点(界内,非墙)
{
if(i>0&&i<=n&&j>0&j<=m&&map[i][j]!='#')
return 1;
else
return 0;
}
void bfs()
{
node front,rear;
front.t=0;
front.i=1;
front.j=1;
priority_queue<node>q;
q.push(front);
while(!q.empty())
{
front=q.top();
q.pop();printf("%d %d %d\n",front.i,front.j,front.t);
for(int i=0; i<4; i++)
{
rear.i=front.i+b[i][0];
rear.j=front.j+b[i][1];
if(ok(rear.i,rear.j))
{
rear.t=front.t+1;
if(map[rear.i][rear.j]>='0'&&map[rear.i][rear.j]<='9')
rear.t=front.t+map[rear.i][rear.j]-48;
if(marktime[rear.i][rear.j]>=rear.t||marktime[rear.i][rear.j]==-1)
{
marktime[rear.i][rear.j]=rear.t;
q.push(rear);
}
}
}
}
return;
}
int main()
{
int i,j,c;
while(~scanf("%d%d",&n,&m))
{
getchar();
for(i=1; i<=n; i++)
{
for(j=1; j<=m; j++)
{
scanf("%c",&c);
map[i][j]=c;
}
getchar();
}
memset(marktime,-1,sizeof(marktime));
marktime[1][1]=0;
bfs();
printf("%d\n",marktime[n][m]);
}
}
/**
4 5
.2#3.
.#.2.
2..#.
.#2..
*/