poj 2632 Crashing Robots
来源:互联网 发布:ubuntu mv命令 编辑:程序博客网 时间:2024/05/16 19:13
Description
In a modernized warehouse, robots are used to fetch the goods. Careful planning is needed to ensure that the robots reach their destinations without crashing into each other. Of course, all warehouses are rectangular, and all robots occupy a circular floor space with a diameter of 1 meter. Assume there are N robots, numbered from 1 through N. You will get to know the position and orientation of each robot, and all the instructions, which are carefully (and mindlessly) followed by the robots. Instructions are processed in the order they come. No two robots move simultaneously; a robot always completes its move before the next one starts moving.
A robot crashes with a wall if it attempts to move outside the area of the warehouse, and two robots crash with each other if they ever try to occupy the same spot.
A robot crashes with a wall if it attempts to move outside the area of the warehouse, and two robots crash with each other if they ever try to occupy the same spot.
Input
The first line of input is K, the number of test cases. Each test case starts with one line consisting of two integers, 1 <= A, B <= 100, giving the size of the warehouse in meters. A is the length in the EW-direction, and B in the NS-direction.
The second line contains two integers, 1 <= N, M <= 100, denoting the numbers of robots and instructions respectively.
Then follow N lines with two integers, 1 <= Xi <= A, 1 <= Yi <= B and one letter (N, S, E or W), giving the starting position and direction of each robot, in order from 1 through N. No two robots start at the same position.
Figure 1: The starting positions of the robots in the sample warehouse
Finally there are M lines, giving the instructions in sequential order.
An instruction has the following format:
< robot #> < action> < repeat>
Where is one of
and 1 <= < repeat> <= 100 is the number of times the robot should perform this single move.
The second line contains two integers, 1 <= N, M <= 100, denoting the numbers of robots and instructions respectively.
Then follow N lines with two integers, 1 <= Xi <= A, 1 <= Yi <= B and one letter (N, S, E or W), giving the starting position and direction of each robot, in order from 1 through N. No two robots start at the same position.
Figure 1: The starting positions of the robots in the sample warehouse
Finally there are M lines, giving the instructions in sequential order.
An instruction has the following format:
< robot #> < action> < repeat>
Where is one of
- L: turn left 90 degrees,
- R: turn right 90 degrees, or
- F: move forward one meter,
and 1 <= < repeat> <= 100 is the number of times the robot should perform this single move.
Output
Output one line for each test case:
Only the first crash is to be reported.
- Robot i crashes into the wall, if robot i crashes into a wall. (A robot crashes into a wall if Xi = 0, Xi = A + 1, Yi = 0 or Yi = B + 1.)
- Robot i crashes into robot j, if robots i and j crash, and i is the moving robot.
- OK, if no crashing occurs.
Only the first crash is to be reported.
Sample Input
45 42 21 1 E5 4 W1 F 72 F 75 42 41 1 E5 4 W1 F 32 F 11 L 11 F 35 42 21 1 E5 4 W1 L 961 F 25 42 31 1 E5 4 W1 F 41 L 11 F 20
Sample Output
Robot 1 crashes into the wallRobot 1 crashes into robot 2OKRobot 1 crashes into robot 2
#include <iostream>#include <cstdio>#include <cstring>using namespace std;struct node{ int x,y; int dir;} r[110];int Map[110][110];int a,b;int flag;int Dir[][2] = {{0,1},{1,0},{0,-1},{-1,0}};void FF(int i,int step){ int x,y,d; x = r[i].x; y = r[i].y; d = r[i].dir; Map[x][y] = 0; while(step--) { x += Dir[d][0]; y += Dir[d][1]; if(x < 1 || x > a || y < 1 || y > b) { printf("Robot %d crashes into the wall\n",i); flag = true; return ; } if(Map[x][y]) { printf("Robot %d crashes into robot %d\n",i,Map[x][y]); flag = true; return ; } } Map[x][y] = i; r[i].x = x; r[i].y = y; return ;}void AA(int i,char ch,int step){ switch(ch) { case 'F': FF(i,step); break; case 'L': r[i].dir = (r[i].dir - step%4 + 4)%4; break; case 'R': r[i].dir = (r[i].dir + step%4)%4; break; }}int main(){ // freopen("in.txt","r",stdin); int T; cin>>T; while(T--) { memset(Map,0,sizeof(Map)); int n,m; cin>>a>>b>>n>>m; for(int i=1; i<=n; i++) { char ch; cin>>r[i].x>>r[i].y>>ch; switch(ch) { case 'N': r[i].dir = 0; break; case 'E': r[i].dir = 1; break; case 'S': r[i].dir = 2; break; case 'W': r[i].dir = 3; break; } Map[r[i].x][r[i].y] = i; } flag = false; while(m--) { char ch; int id,step; cin>>id>>ch>>step; if(flag == false) AA(id,ch,step); } if(!flag) cout<<"OK"<<endl; } return 0;}
0 0
- Poj 2632 Crashing Robots
- poj 2632 Crashing Robots
- poj 2632 Crashing Robots
- poj-2632-Crashing Robots
- POJ 2632 Crashing Robots
- POJ 2632 Crashing Robots
- POJ 2632 Crashing Robots
- POJ 2632 Crashing Robots
- POJ-2632-Crashing Robots
- POJ 2632 Crashing Robots
- POJ 2632 Crashing Robots
- POJ 2632 Crashing Robots
- poj 2632 Crashing Robots
- POJ 2632 Crashing Robots
- poj -2632 Crashing Robots
- poj 2632 Crashing Robots
- POJ 2632 Crashing Robots
- poj 2632 Crashing Robots
- 如何学习大数据以及学习曲线
- 数字图像学习1
- Aerospike使用介绍
- 设计模式之策略模式
- C++模板类继承中的Name Lookup
- poj 2632 Crashing Robots
- homeworkFour 有太多的感触
- Javascript高级程序设计第六七章
- 达内学习日志 Day01(下):JAVA开发环境
- 在OpenCV中图像边界扩展 copyMakeBorder 的实现
- hdu5336XYZ and Drops
- Crashing Robots(POJ--2632
- 《疯狂的程序员》翻后有感
- hdu 5319 Painter (2015多校第三场第4题)暴力模拟(瞎搞)