POJ_2632

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

分析:
就是一个大模拟,我在解决这个问题时,出了好几个错误,1.就是没有考虑机器人在移动的过程中就已经和其他的机器人相遇2.边界条件没有处理好,导致wa了几次,最后看了一组别人的数据才发现自己的问题,做这种题还是要细心,细致
代码:
(比较长,就是自己模拟的)

#include <iostream>
#include <cstring>
#include <cmath>
using namespace std;

int T;//总的测试次数
int A,B;//整个图的长宽
int arr[110][110];//表示整个图
int N,M;//N表示机器人数量.M表示机器人要进行的动作
struct reboots
{
    int x,y;//机器人的所在的坐标
    char dir;//机器人的行动方向
};
reboots brr[110];

//代表机器人的行为
struct action
{
    int num;
    char act;
    int n;
};
action crr[110];

int main()
{
    cin>>T;
    while(T--)
    {
        cin>>A>>B;
        cin>>N>>M;

        //初始化机器人
        for(int i=1;i<=N;i++)
            cin>>brr[i].x>>brr[i].y>>brr[i].dir;

        //机器人的行为
        int cns=0,step=0;//cns表示是第几个机器人,step表示走了几步或者转了几下
        char acts;//表示机器人的动作
        for(int j=1;j<=M;j++)
            cin>>crr[j].num>>crr[j].act>>crr[j].n;


        int i;
        bool flag02=false;//是否发生了碰撞
        bool flag=false;
        for(i=1;i<=M;i++)
        {
            cns = crr[i].num;
            acts = crr[i].act;
            step = crr[i].n;
            if(acts=='F')
            {
                if(brr[cns].dir=='W')
                {
                    while(step--)
                    {
                        brr[cns].x -= 1;

                        if(brr[cns].x>A || brr[cns].x<=0)
                        {
                            cout << "Robot "<< cns << " crashes into the wall" << endl;
                            flag02=true;
                            break;
                        }

                        flag=false;
                        for(int i=1;i<=N;i++)
                        {
                            if(brr[cns].x==brr[i].x && brr[cns].y==brr[i].y && i!= cns)
                            {
                                cout << "Robot "<< cns << " crashes into robot " << i <<endl;
                                flag02=true;
                                flag=true;
                                break;
                            }
                        }
                        if(flag)
                            break;
                    }
                }
                else if(brr[cns].dir=='N')
                {
                    while(step--)
                    {
                        brr[cns].y +=1;

                        if(brr[cns].y>B || brr[cns].y<=0)
                        {
                            cout << "Robot "<< cns << " crashes into the wall" << endl;
                            flag02=true;
                            break;
                        }

                        flag=false;
                        for(int i=1;i<=N;i++)
                        {
                        if(brr[cns].x==brr[i].x && brr[cns].y==brr[i].y && i!= cns)
                        {
                            cout << "Robot "<< cns << " crashes into robot " << i <<endl;
                            flag02=true;
                            flag=true;
                            break;
                        }
                        }
                        if(flag)
                            break;
                    }
                }
                else if(brr[cns].dir=='E')
                {
                    while(step--)
                    {
                        brr[cns].x += 1;
                        if(brr[cns].x>A || brr[cns].x<=0)
                        {
                            cout << "Robot "<< cns << " crashes into the wall" << endl;
                            flag02=true;
                            break;
                        }
                        flag=false;
                        for(int i=1;i<=N;i++)
                        {
                            if(brr[cns].x==brr[i].x && brr[cns].y==brr[i].y && i!= cns)
                            {
                                cout << "Robot "<< cns << " crashes into robot " << i <<endl;
                                flag02=true;
                                flag=true;
                                break;
                            }
                        }
                        if(flag)
                            break;
                    }
                }
                else
                {
                    while(step--)
                    {
                        brr[cns].y -= 1;

                        if(brr[cns].y>B || brr[cns].y<=0)
                        {
                            cout << "Robot "<< cns << " crashes into the wall" << endl;
                            flag02=true;
                            break;
                        }
                        flag=false;
                        for(int i=1;i<=N;i++)
                        {
                            if(brr[cns].x==brr[i].x && brr[cns].y==brr[i].y && i!= cns)
                            {
                                cout << "Robot "<< cns << " crashes into robot " << i <<endl;
                                flag02=true;
                                flag=true;
                                break;
                            }
                        }
                        if(flag)
                            break;
                    }
                }
                if(flag02)
                    break;
            }

            else if(acts == 'L')
            {
                step=step%4;
                if(step==0)
                    continue;
                if(step==1)
                {
                    if(brr[cns].dir == 'W')
                        brr[cns].dir = 'S';
                    else if(brr[cns].dir == 'S')
                        brr[cns].dir = 'E';
                    else if(brr[cns].dir == 'E')
                        brr[cns].dir = 'N';
                    else
                        brr[cns].dir = 'W';
                }
                else if(step==2)
                {
                    if(brr[cns].dir == 'W')
                        brr[cns].dir = 'E';
                    else if(brr[cns].dir == 'S')
                        brr[cns].dir = 'N';
                    else if(brr[cns].dir == 'E')
                        brr[cns].dir = 'W';
                    else
                        brr[cns].dir = 'S';
                }
                else if(step==3)
                {
                    if(brr[cns].dir == 'W')
                        brr[cns].dir = 'N';
                    else if(brr[cns].dir == 'S')
                        brr[cns].dir = 'W';
                    else if(brr[cns].dir == 'E')
                        brr[cns].dir = 'S';
                    else
                        brr[cns].dir = 'E';
                }
            }

            else if(acts == 'R')
            {
                step=step%4;
                if(step==0)
                    continue;
                if(step==1)
                {
                    if(brr[cns].dir == 'W')
                        brr[cns].dir = 'N';
                    else if(brr[cns].dir == 'S')
                        brr[cns].dir = 'W';
                    else if(brr[cns].dir == 'E')
                        brr[cns].dir = 'S';
                    else
                        brr[cns].dir = 'E';
                }
                else if(step==2)
                {
                    if(brr[cns].dir == 'W')
                        brr[cns].dir = 'E';
                    else if(brr[cns].dir == 'S')
                        brr[cns].dir = 'N';
                    else if(brr[cns].dir == 'E')
                        brr[cns].dir = 'W';
                    else
                        brr[cns].dir = 'S';
                }
                else if(step==3)
                {
                    if(brr[cns].dir == 'W')
                        brr[cns].dir = 'S';
                    else if(brr[cns].dir == 'S')
                        brr[cns].dir = 'E';
                    else if(brr[cns].dir == 'E')
                        brr[cns].dir = 'N';
                    else
                        brr[cns].dir = 'W';
                }
            }
        }

        if(!flag02)
            cout<<"OK"<<endl;
    }
    return 0;
}