Crashing Robots
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 13304 | Accepted: 5545 |
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
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
Source
解题思路：
机器人一共有三种操作：L、R、F，按照输入的指令一步一步地执行。一共有三种情况：
1.当机器人还没执行完所有操作时离开了矩阵范围
2.当机器人执行完所有操作，没有遇到情况1、2。
3.当机器人还没执行完所有操作的时候就相撞了
vis[][]数组存储的是机器人所在的位置。
AC代码：
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=10005;
int n,m,row,col;
struct Robot{
int x,y;
char dir;
}robot[maxn];
int vis[105][105];
int flag=0;
int main()
{
int t;
cin>>t;
while(t--){
memset(vis,0,sizeof vis);
char dir;
cin>>row>>col;
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>robot[i].x>>robot[i].y>>robot[i].dir;
vis[robot[i].x][robot[i].y]=i;
}
flag=1;
for(int i=1;i<=m;i++){
char c;
int id,num;
cin>>id>>c>>num;
if(flag){
if(c=='L'){
for(int i=0;i<num;i++){
if(robot[id].dir=='N')
robot[id].dir='W';
else if(robot[id].dir=='W')
robot[id].dir='S';
else if(robot[id].dir=='S')
robot[id].dir='E';
else if(robot[id].dir=='E')
robot[id].dir='N';
}
}
else if(c=='R'){
for(int i=0;i<num;i++){
if(robot[id].dir=='N')
robot[id].dir='E';
else if(robot[id].dir=='E')
robot[id].dir='S';
else if(robot[id].dir=='S')
robot[id].dir='W';
else if(robot[id].dir=='W')
robot[id].dir='N';
}
}
//c=='F'
else{
if(robot[id].dir=='N'){
vis[robot[id].x][robot[id].y]=0;
for(int i=0;i<num;i++){
robot[id].y++;
if(robot[id].y>col){
printf("Robot %d crashes into the wall\n",id);
flag = false;
break;
}
if(vis[robot[id].x][robot[id].y]){
printf("Robot %d crashes into robot %d\n",id,vis[robot[id].x][robot[id].y]);
flag=false;
break;
}
}
vis[robot[id].x][robot[id].y]=id;
}
if(robot[id].dir=='S'){
vis[robot[id].y][robot[id].x]=0;
for(int i=0;i<num;i++){
robot[id].y--;
if(robot[id].y<1){
printf("Robot %d crashes into the wall\n",id);
flag = false;
break;
}
if(vis[robot[id].x][robot[id].y]){
printf("Robot %d crashes into robot %d\n",id,vis[robot[id].x][robot[id].y]);
flag=false;
break;
}
}
vis[robot[id].x][robot[id].y]=id;
}
if(robot[id].dir=='W'){
for(int i=0;i<num;i++){
vis[robot[id].x][robot[id].y]=0;
robot[id].x--;
if(robot[id].x<1){
printf("Robot %d crashes into the wall\n",id);
flag = false;
break;
}
if(vis[robot[id].x][robot[id].y]){
printf("Robot %d crashes into robot %d\n",id,vis[robot[id].x][robot[id].y]);
flag=false;
break;
}
}
vis[robot[id].x][robot[id].y]=id;
}
if(robot[id].dir=='E'){
vis[robot[id].x][robot[id].y]=0;
for(int i=0;i<num;i++){
robot[id].x++;
if(robot[id].x>row){
printf("Robot %d crashes into the wall\n",id);
flag = false;
break;
}
if(vis[robot[id].x][robot[id].y]){
printf("Robot %d crashes into robot %d\n",id,vis[robot[id].x][robot[id].y]);
flag=false;
break;
}
}
vis[robot[id].x][robot[id].y]=id;
}
}
}
}
if(flag)
cout<<"OK\n";
}
return 0;
}