Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 7866   Accepted: 2586

Description

The Robot Moving Institute is using a robot in their local store to transport different items. Of course the robot should spend only the minimum time necessary when travelling from one place in the store to another. The robot can move only along a straight line (track). All tracks form a rectangular grid. Neighbouring tracks are one meter apart. The store is a rectangle N x M meters and it is entirely covered by this grid. The distance of the track closest to the side of the store is exactly one meter. The robot has a circular shape with diameter equal to 1.6 meter. The track goes through the center of the robot. The robot always faces north, south, west or east. The tracks are in the south-north and in the west-east directions. The robot can move only in the direction it faces. The direction in which it faces can be changed at each track crossing. Initially the robot stands at a track crossing. The obstacles in the store are formed from pieces occupying 1m x 1m on the ground. Each obstacle is within a 1 x 1 square formed by the tracks. The movement of the robot is controlled by two commands. These commands are GO and TURN. 
The GO command has one integer parameter n in {1,2,3}. After receiving this command the robot moves n meters in the direction it faces.

The TURN command has one parameter which is either left or right. After receiving this command the robot changes its orientation by 90o in the direction indicated by the parameter.

The execution of each command lasts one second.

Help researchers of RMI to write a program which will determine the minimal time in which the robot can move from a given starting point to a given destination.

Input

The input consists of blocks of lines. The first line of each block contains two integers M <= 50 and N <= 50 separated by one space. In each of the next M lines there are N numbers one or zero separated by one space. One represents obstacles and zero represents empty squares. (The tracks are between the squares.) The block is terminated by a line containing four positive integers B1 B2 E1 E2 each followed by one space and the word indicating the orientation of the robot at the starting point. B1, B2 are the coordinates of the square in the north-west corner of which the robot is placed (starting point). E1, E2 are the coordinates of square to the north-west corner of which the robot should move (destination point). The orientation of the robot when it has reached the destination point is not prescribed. We use (row, column)-type coordinates, i.e. the coordinates of the upper left (the most north-west) square in the store are 0,0 and the lower right (the most south-east) square are M - 1, N - 1. The orientation is given by the words north or west or south or east. The last block contains only one line with N = 0 and M = 0. 

Output

The output contains one line for each block except the last block in the input. The lines are in the order corresponding to the blocks in the input. The line contains minimal number of seconds in which the robot can reach the destination point from the starting point. If there does not exist any path from the starting point to the destination point the line will contain -1. 

Sample Input

9 10
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 1 0
0 0 0 1 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 1 0 0 0 0
0 0 0 1 1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 1 0
7 2 2 7 south
0 0

Sample Output

12

这题改了好几天。。。。。
错误的点:
1.在DEBUG的时候我尝试恢复路径,此时发现有的结点的pre信息被后来修改,是因为应当在入队的时候标记,而不是出队的时候
2.对于位置的移动判断写错,首先边界不能触碰,而且一个黑色方格周围的点也不能。
3.在枚举一个点沿着一个方向行走的可行距离的时候,当遇到黑色方块或者边界的时候要break 代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<queue>
#include<deque>
#include<iomanip>
#include<vector>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<fstream>
#include<memory>
#include<list>
#include<string>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MAXN 109
#define N 33
#define MOD 1000000
#define INF 1000000009
const double eps = 1e-;
const double PI = acos(-1.0); int X[] = { -,,, }, Y[] = { ,,,- };
bool been[MAXN][MAXN][];//四个方向
int n, m, rx, ry, g[MAXN][MAXN];
struct node
{
int x, y, dir, time;
node() = default;
node(int _x, int _y, int _dir, int _t) :x(_x), y(_y), dir(_dir), time(_t) {}
};
node pre[MAXN][MAXN][];
int d[MAXN][MAXN];
void print(node u)
{
vector<node> v;
for (;;)
{
//cout << u.x <<' '<< u.y << ' '<< u.dir << endl;
v.push_back(u);
if (u.time == ) break;
u = pre[u.x][u.y][u.dir];
}
int cnt = ;
for (int i = v.size() - ; i >= ; i--)
{
printf("%d %d %d %d\n", v[i].x, v[i].y, v[i].dir, v[i].time);
}
}
bool CanGo(int x, int y)
{
if (x< || x >= n || y< || y >= m)
return false;
if (g[x][y] || g[x + ][y] || g[x][y + ] || g[x + ][y + ])
return false;
return true;
}
int BFS(int x, int y, int d)
{
been[x][y][d] = true;
queue<node> q;
q.push(node(x, y, d, ));
while (!q.empty())
{
node t = q.front();
q.pop();
//cout << t.x << ' ' << t.y << ' ' << t.dir <<' ' << t.time << endl; if (t.x == rx&&t.y == ry)
{
//cout << t.prex << ' ' << t.prey << "::::" << t.dir << endl;
//print(t);
return t.time;
} if (!been[t.x][t.y][(t.dir + ) % ])
{
been[t.x][t.y][(t.dir + ) % ] = true;
pre[t.x][t.y][(t.dir + ) % ] = t;
q.push(node(t.x, t.y, (t.dir + ) % , t.time + ));
}
if (!been[t.x][t.y][(t.dir - + ) % ])
{
been[t.x][t.y][(t.dir - + ) % ] = true;
pre[t.x][t.y][(t.dir - + ) % ] = t;
q.push(node(t.x, t.y, (t.dir - + ) % , t.time + ));
}
for (int i = ; i <= ; i++)
{
int tx = t.x + X[t.dir] * i, ty = t.y + Y[t.dir] * i;
if (CanGo(tx, ty))
{
if(!been[tx][ty][t.dir])
{
been[tx][ty][t.dir] = true;
pre[tx][ty][t.dir] = t;
q.push(node(tx, ty, t.dir, t.time + ));
}
}
else
break;
}
}
return -;
}
int main()
{
while (scanf("%d%d", &n, &m), n + m)
{
memset(been, false, sizeof(been));
int tx, ty, d;
char op[];
for (int i = ; i <= n; i++)
for (int j = ; j <= m; j++)
scanf("%d", &g[i][j]);
scanf("%d%d%d%d%s", &tx, &ty, &rx, &ry, op);
if (!CanGo(rx, ry))
{
printf("-1\n");
continue;
}
if (op[] == 'n')
d = ;
else if (op[] == 'e')
d = ;
else if (op[] == 's')
d = ;
else
d = ;
printf("%d\n", BFS(tx, ty, d));
}
}

POJ 1376 Robot的更多相关文章

  1. 模拟 POJ 1573 Robot Motion

    题目地址:http://poj.org/problem?id=1573 /* 题意:给定地图和起始位置,robot(上下左右)一步一步去走,问走出地图的步数 如果是死循环,输出走进死循环之前的步数和死 ...

  2. Robot POJ - 1376

    The Robot Moving Institute is using a robot in their local store to transport different items. Of co ...

  3. POJ 1573 Robot Motion(BFS)

    Robot Motion Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 12856   Accepted: 6240 Des ...

  4. POJ 1573 Robot Motion(模拟)

    题目代号:POJ 1573 题目链接:http://poj.org/problem?id=1573 Language: Default Robot Motion Time Limit: 1000MS ...

  5. POJ 1573 Robot Motion

    Robot Motion Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 12978   Accepted: 6290 Des ...

  6. poj 1573 Robot Motion【模拟题 写个while循环一直到机器人跳出来】

                                                                                                         ...

  7. POJ 1573 Robot Motion 模拟 难度:0

    #define ONLINE_JUDGE #include<cstdio> #include <cstring> #include <algorithm> usin ...

  8. poj 1573 Robot Motion_模拟

    又是被自己的方向搞混了 题意:走出去和遇到之前走过的就输出. #include <cstdlib> #include <iostream> #include<cstdio ...

  9. poj 1367 robot(搜索)

    题意:给你一个图,求起点 到 终点的最少时间 每次有两种选择①:往前走1~3步                ②原地选择90°   费时皆是1s 图中1为障碍物,而且不能出边界.还要考虑机器人的直径 ...

随机推荐

  1. jquery实现图片预加载提高页面加载速度

    使用jquery实现图片预加载提高页面加载速度和用户体 我们在做网站的时候经常会遇到这样的问题:一个页面有大量的图片导致页面加载速度缓慢,经常会出现一个白页用户体验很不好.那么如何解决这个问题 呢?首 ...

  2. [Luogu 1312] noip11 Mayan游戏

    [Luogu 1312] noip11 Mayan游戏 Problem: Mayan puzzle是最近流行起来的一个游戏.游戏界面是一个 7 行5 列的棋盘,上面堆放着一些方块,方块不能悬空堆放,即 ...

  3. django 菜单权限

    一.什么是权限 能做哪些事情,不能做哪些事情,可以做的权限 二.设计权限 思路: web应用中,所谓的权限,其实就是一个用户能够访问的url,通过对用户访问的url进行控制,从而实现对用户权限的控制. ...

  4. 【转】Linux账号管理之useradd

    转自:http://www.jb51.net/article/45848.htm Linux 系统是一个多用户多任务的分时操作系统,任何一个要使用系统资源的用户,都必须首先向系统管理员申请一个账号,然 ...

  5. scala 变量定义,基本操作符

    scala是jvm语言,它将面向对象与函数风格结合的很好,它可以访问任何java类库并很好的结合使用. 它可以使程序更简单,同时可利用并发的威力. scala基本语法: package com.tes ...

  6. 安装office1406错误!!!急死个人。。。。。

    因为用到Microsoft.Office.Interop.Word,将word转PDF.所以在服务器上需要安装office,但是报错1406,不能将值插入注册表..... 然后百度各种问题,说需要将注 ...

  7. Linq学习(一)-初涉Linq

    一.何谓LINQ LINQ:Language Integrated Query语言集成查询,其本质是对ADO.NET结果集通过反射连同泛型特性转换成对象集,实现OR模型的转换 二.优点与缺点 优点:封 ...

  8. Android 微信分享图片

    "; //微信 APPID private IWXAPI iwxapi; private void regToWx() { iwxapi = WXAPIFactory.createWXAPI ...

  9. JS高级——instanceof语法

    基本语法 对象 instanceof 构造函数 基本使用 <script> function Person() { } //p--->Person.prototype--->O ...

  10. mounted钩子问题

    recommend.vue <script type="text/ecmascript-6"> import Slider from 'base/slider/slid ...