CROBOTS - Crashing Robots

no tags 

 

In a modernized warehouse, robots are used to fetch the goods. Careful
planning is needed to ensure that the robots reach their destinations with-
out 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 simultane-
ously; a robot always completes its move before the next one starts mov-
ing.

 

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.

 

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.
Finally there are M lines, giving the instructions in sequential order. An instruction has the following format:
<robot #> <action> <repeat>
Where <action> 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:

  • 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.

 

Example

Input:
4
5 4
2 2
1 1 E
5 4 W
1 F 7
2 F 7
5 4
2 4
1 1 E
5 4 W
1 F 3
2 F 1
1 L 1
1 F 3
5 4
2 2
1 1 E
5 4 W
1 L 96
1 F 2
5 4
2 3
1 1 E
5 4 W
1 F 4
1 L 1
1 F 20


Output:
Robot 1 crashes into the wall
Robot 1 crashes into robot 2
OK
Robot 1 crashes into robot 2

hide comments
Stefan Burgic: 2015-03-17 23:53:09

Easy one :)

Haijun Deng: 2013-06-12 10:12:22

no picture, any one can give a link?

Mahmoud Aladdin: 2012-08-23 10:45:16

Well, according to the sequence in test case 2,
1 F 3
1 L 1
1 F 3
In the input means, that robot 1 will move 3 to east then turn to north, and hit the wall, as he moves 3 F to the north direction. And won't crash with robot 2 as robot 2 is 3 tiles SOUTH not NORTH. And the same sequence in test case 4.

Or there is something I'm missing ?!

EDIT: Ok, didn't notice that N is the positive y direction. :$ Now it is solved!!

Last edit: 2012-08-23 11:22:44
:D: 2012-08-23 07:40:28

Yes, 'L' on 'E' gives 'N'. Does this contradicts anything?

Mahmoud Aladdin: 2012-08-22 21:13:32

Ain't moving 'L' left when orientation is 'E' makes it revolve to 'N' in test case 2 ? Or I'm missing something ?

Archit Mittal: 2012-07-29 10:43:02

finally ac :)

♘Prabhat: 2012-06-21 06:50:31

Last edit: 2012-06-21 06:51:24
♘Prabhat: 2012-06-21 02:04:17

Last edit: 2012-06-21 06:52:00

Added by:Mohammad Kotb
Date:2010-08-08
Time limit:0.461s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: OBJC VB.NET
Resource:NCPC 2005