ACM: 模拟题 poj 2632 (开始做模拟…

                                                                 
Crashing Robots

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.

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

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.

Sample 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

Sample Output

Robot 1 crashes into the wall

Robot 1 crashes into robot 2

OK

Robot 1 crashes into robot 2

题意: 输入每个机器人的坐标的方向,输入ACTION.最后判断机器人们是否碰撞,或则撞墙,或则没事.

解题思路:

     
     
     1.
直接模拟没什么好说的.

     
     
     2. 要注意的是L
or R是旋转多次.(一开始以为是走一步转一次).

代码:

#include <cstdio>

#include <iostream>

#include <cstring>

using namespace std;

#define MAX 105

int dir[4][2] = { {-1,0} , {0,-1} , {1,0} , {0,1} };

int n, m ;

int N, M ;

struct gridnode

{

    bool
visit;

    int
number;

}grid[MAX][MAX];

struct node

{

    int
x,y;

    int
direction;

}robot[MAX];

struct anode

{

    int
number;

    int
direction;

    int
step;

}action[MAX];

void init()

{

    for(int i =
0; i < MAX; ++i)

    {

  
   
 for(int j = 0; j < MAX; ++j)

  
   
 {

  
   
   
 grid[i][j].visit = false;

  
   
   
 grid[i][j].number = -1;

  
   
 }

    }

}

void runAction()

{

    for(int i =
1; i <= M; ++i)

    {

  
   
 int t = action[i].number;

  
   
 if(action[i].direction == 0)

  
   
 {

  
   
   
 for(int j = action[i].step; j > 0;
--j)

  
   
   
 {

  
   
   
 

  
   
   
   
 grid[ robot[t].x ][ robot[t].y ].visit =
false;

  
   
   
   
 grid[ robot[t].x ][ robot[t].y ].number =
-1;

  
   
   
 

  
   
   
 //  
 printf("%d %d
%d\n",t,robot[t].x,robot[t].y);

  
   
   
 

  
   
   
   
 robot[t].x += dir[ robot[t].direction ][0];

  
   
   
   
 robot[t].y += dir[ robot[t].direction ][1];

  
   
   
 

  
   
   
 

  
   
   
   
 if(robot[t].x >= 1
&& robot[t].x <= n
&& robot[t].y >= 1
&& robot[t].y <=
m)