zoj 1310 Robot

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1310

 

很麻烦的一题BFS,每次有5种操作,左转,右转,前进一步,两步或3步.

 

由于机器人是在方格的点上移动的,所以又开了一个grid数组,将原来输进去的那个以方格为单位的数组转化为以点位单位的数组.

 

然后dis数组用来标记到达每个点各个方向所需时间.

 

/* * 1310.cpp * * Created on: May 1, 2010 * Author: wyy * */ #define INF 0xffffff #define MaxVertexs 50 #include<cstdio> #include<queue> using namespace std; struct point { int x, y, d, t; }; point S, T; int M, N; int dis[4][MaxVertexs + 1][MaxVertexs + 1]; char graph[MaxVertexs][MaxVertexs]; char grid[MaxVertexs + 1][MaxVertexs + 1]; int d[4][2] = {​{0,0}, {0, 1}, {1, 0}, {1, 1}}; int dx[4] = {0, 1, 0, -1}; int dy[4] = {1, 0, -1, 0}; void Init() { char ch[6]; memset(grid, 0, sizeof(grid)); for(int i = 0; i < M; ++i) for(int j = 0; j < N; ++j) { scanf("%s", &graph[i][j]); if(graph[i][j] == '1') for(int k = 0; k < 4; ++k) grid[i + d[k][0]][j + d[k][1]] = '1'; for(int k = 0; k < 4; ++k) dis[k][i][j] = INF; } scanf("%d%d%d%d%s", &S.x, &S.y, &T.x, &T.y, ch); switch(ch[0]) { case 'e' : S.d = 0; break; case 's' : S.d = 1; break; case 'w' : S.d = 2; break; case 'n' : S.d = 3; break; } } bool IsValid(point p) { return (p.x > 0 && p.y > 0 && p.x < M && p.y < N && grid[p.x][p.y] != '1'); } int BFS() { queue<point> Q; point a, b; Q.push(S); while(!Q.empty()) { a = Q.front(); Q.pop(); if(a.x == T.x && a.y == T.y) return a.t; if(a.t + 1 < dis[(a.d + 1) % 4][a.x][a.y]) { b = a; ++b.t; b.d = (a.d + 1) % 4; dis[b.d][b.x][b.y] = b.t; Q.push(b); } if(a.t + 1 < dis[(a.d + 3) % 4][a.x][a.y]) { b = a; ++b.t; b.d = (a.d + 3) % 4; dis[b.d][b.x][b.y] = b.t; Q.push(b); } b = a; for(int i = 1; i <= 3; ++i) { b.x += dx[b.d]; b.y += dy[b.d]; if(!IsValid(b)) break; else if(a.t + 1 < dis[b.d][b.x][b.y]) { b.t = a.t + 1; dis[b.d][b.x][b.y] = b.t; Q.push(b); } } } return -1; } void Solve() { Init(); int ret = BFS(); printf("%d/n", ret); } int main() { //freopen("input.txt", "r", stdin); while(scanf("%d%d", &M, &N) && M && N) Solve(); //fclose(stdin); return 0; }