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
解释一下输入输出
这是一个机器人跑动的问题，给出机器人坐标和场地范围，以及行动指令；如果撞墙或者撞到其它机器人就停止（注意，输入要完成）

输入：4是4组数据

5 4 是场地范围

2 2  2个机器人，两个指令；

1 1 E    1,1 是坐标，E是机器人此时面临的方向；

1 F 7    1是机器人序号   F  是指令   7是执行次数

关于指令

          F: 直走；

          L:左转90度；

          R:右转90度；

 

 

下面的代码是我同学的  他写的比我的简洁

 #include<cstdio>
 #include<cstring>
 #include<iostream>
 using namespace std ;
 int len,high;
 int a,b,j ;
 struct node
 {
     int x;
     int y ;
     int dire;
 } s[];
 int judge(int k)
 {
     int i;
     if(s[k].x > len||s[k].x< ||s[k].y>high||s[k].y<)
     {
         printf("Robot %d crashes into the wall\n",k);
         return ;
     }
     for(i =  ; i <= a ; i++)
     {
         if(i == k)
             continue;
         if(s[i].x == s[k].x&&s[i].y == s[k].y)
         {
             printf("Robot %d crashes into robot %d\n",k,i);
             return  ;
         }
     }
     return  ;
 }
 int main()
 {
     int n ;
     cin>>n;
     for(int i =  ; i <= n ; i++)
     {
         cin>>len>>high;
         cin>>a>>b ;
         char dire ;
         for(j =  ; j <= a ; j++)
         {
             cin>>s[j].x>>s[j].y>>dire;
             if(dire == 'N')
                 s[j].dire =  ;
             if(dire == 'W')
                 s[j].dire =  ;
             if(dire == 'S')
                 s[j].dire =  ;
             if(dire == 'E')
                 s[j].dire =  ;
         }
         int num,repeat,flag =  ;
         char order ;
         for(j =  ; j <= b ; j++)
         {
             cin>>num>>order>>repeat ;
             for(int h =  ; h <= repeat ; h++ )//把这个放在外边是为了底下的左右指令时比较好处理
             {
                 if(order == 'F')
                 {
                     if(s[num].dire == )
                     {
                         s[num].y++ ;
                         if(!judge(num))
                         {
                             flag =  ;
                             break ;
                         }
                     }
                     else if(s[num].dire == )
                     {
                         s[num].x--;
                         if(!judge(num))
                         {
                             flag =  ;
                             break ;
                         }
                     }
                     else if(s[num].dire == )
                     {
                         s[num].y--;
                         if(!judge(num))
                         {
                             flag =  ;
                             break ;
                         }
                     }
                     else if(s[num].dire == )
                     {
                         s[num].x++ ;
                         if(!judge(num))
                         {
                             flag =  ;
                             break ;
                         }
                     }
                 }
                 if(order == 'L')
                     s[num].dire = (+s[num].dire)% ;
                 if(order == 'R')
                     s[num].dire = (s[num].dire-+)%;
             }
             if(flag == )
                 break ;
         }
         if(j < b)
             for(++j ; j <= b ; j++)
                 cin>>num>>order>>repeat ;
         if(flag == )
             printf("OK\n");
     }
     return   ;
 }