1.题目描述:点击打开链接
2.解题思路:本题利用BFS解决,根据题意描述,可以把{x,y,dir,color}当做状态,然后进行状态转移即可。
3.代码:
#include<iostream>
#include<algorithm>
#include<cassert>
#include<string>
#include<sstream>
#include<set>
#include<bitset>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<deque>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<list>
#include<complex>
#include<functional>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
#define me(s) memset(s,0,sizeof(s))
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair <int,int> P;
const int N=25+10;
char g[N][N];
int d[N][N][4][5];
int dx[]={-1,0,1,0};
int dy[]={0,1,0,-1};
int r,c;
int sx,sy;
struct Node
{
int x,y,dir,color;
};
bool inside(int x,int y){return x>=0&&x<r&&y>=0&&y<c;}
Node go(Node u,int i)
{
int dir=u.dir;
dir=(dir+i+4)%4;
if(dir!=u.dir)
{
return Node{u.x,u.y,dir,u.color};
}
else
{
int color=(u.color+1)%5;
return Node{u.x+dx[u.dir],u.y+dy[u.dir],u.dir,color};
}
}
void bfs()
{
d[sx][sy][0][0]=0;
queue<Node>q;
q.push(Node{sx,sy,0,0});
while(!q.empty())
{
Node u=q.front();q.pop();
if(g[u.x][u.y]=='T'&&!u.color)
{
printf("minimum time = %d sec\n",d[u.x][u.y][u.dir][u.color]);
return;
}
for(int i=-1;i<2;i++)
{
Node v=go(u,i);
if(inside(v.x,v.y)&&g[v.x][v.y]!='#'&&d[v.x][v.y][v.dir][v.color]<0)
{
d[v.x][v.y][v.dir][v.color]=d[u.x][u.y][u.dir][u.color]+1;
q.push(v);
}
}
}
puts("destination not reachable");
}
int main()
{
int rnd=0;
while(~scanf("%d%d",&r,&c)&&(r||c))
{
memset(d,-1,sizeof(d));
for(int i=0;i<r;i++)
{
scanf("%s",g[i]);
for(int j=0;j<c;j++)
if(g[i][j]=='S')sx=i,sy=j;
}
if(rnd)puts("");
printf("Case #%d\n",++rnd);
bfs();
}
}