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
题目大意：给定一个A*B的棋盘，N个机器人，每个机器人都有起始位置，M个指令（x，C，r）代表第x个机器人执行指令C重复r次。
F->向前走一步
L->向左转
R->向右转
若i号机器人撞墙，输出：Robot i crashes into the wall
若i号机器人撞到j号机器人，输出：Robot i crashes into robot j
若M个指令执行完仍无事故发生 输出:OK
解题思路：模拟，写的比较长。。。
Code：
#include<string>
#include<iostream>
#include<stdio.h>
#define INTO_WALL 0
#define INTO_ROBIT -1
#define SAFE 1
using namespace std;
struct Robit
{
int x,y;
int dir;
} R[];
int date1,date2,N,T,M,A,B;;
void step(int i,int dir)
{
if (dir==) R[i].y++;
if (dir==) R[i].x++;
if (dir==) R[i].y--;
if (dir==) R[i].x--;
}
int move(int i,char dir,int dis)
{
if (dir=='L')
for (int j=; j<=dis; j++)
R[i].dir=(R[i].dir-)?(R[i].dir-):;
else if (dir=='R')
for (int j=; j<=dis; j++)
R[i].dir=(R[i].dir-)?(R[i].dir+):;
else
{
for (int j=; j<=dis; j++)
{
step(i,R[i].dir);
if ((R[i].x>=A+||R[i].x<=)||(R[i].y>=B+||R[i].y<=))
{
date1=i;
return INTO_WALL;
}
for (int k=; k<=N; k++)
{
if (k==i) continue;
if (R[k].x==R[i].x&&R[k].y==R[i].y)
{
date1=i,date2=k;
return INTO_ROBIT;
}
}
}
}
return SAFE;
}
int main()
{
int flag=,tmp,meter,ok,i;
char tdir,ctmp;
cin>>T;
while (T--)
{
flag=;
cin>>A>>B;
cin>>N>>M;
for (i=; i<=N; i++)
{
cin>>R[i].x>>R[i].y>>ctmp;
if (ctmp=='N') R[i].dir=;
if (ctmp=='E') R[i].dir=;
if (ctmp=='S') R[i].dir=;
if (ctmp=='W') R[i].dir=;
}
for (i=; i<=M; i++)
{
cin>>tmp>>tdir>>meter;
if (flag) continue;
ok=move(tmp,tdir,meter);
if (ok==SAFE) continue;
else if (ok==INTO_ROBIT)
{
printf("Robot %d crashes into robot %d\n",date1,date2);
flag=;
}
else if (ok==INTO_WALL)
{
printf("Robot %d crashes into the wall\n",date1);
flag=;
}
}
if (!flag) printf("OK\n");
}
return ;
}