zoukankan      html  css  js  c++  java
  • poj 2632Crashing 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


    机器人从某一个位置出发,按照题目要求的方法行走,问最后的状态(L表示向左转90度,R向右转90度,F向前走1米)。直接按照题目的要求模拟机器人的行走路线即可。
    View Code
     1 #include <stdio.h>
     2 #include <string.h>
     3 struct robot
     4 {
     5     int x,y;
     6     int dis;
     7 }r[110];
     8 int map[110][110];
     9 int dy[]={1,0,-1,0};
    10 int dx[]={0,-1,0,1};
    11 int charge(char c)
    12 {
    13     if(c=='N') return 0;
    14     if(c=='W') return 1;
    15     if(c=='S') return 2;
    16     if(c=='E') return 3;
    17 }
    18 int main()
    19 {
    20     int k,a,b,n,m;
    21     int i,j,flag,t;
    22     int x,y,num,cnt;
    23     char c,act;
    24     scanf("%d",&k);
    25     while(k--)
    26     {
    27         flag=1;
    28         memset(map,0,sizeof(map));
    29         scanf("%d%d",&a,&b);
    30         scanf("%d%d",&n,&m);
    31         for(i=1;i<=n;i++)
    32         {
    33             scanf("%d %d %c",&x,&y,&c);
    34             r[i].x=x,r[i].y=y,r[i].dis=charge(c);
    35             map[x][y]=i;
    36         }
    37         while(m--)
    38         {
    39             scanf("%d %c %d",&num,&act,&cnt);
    40             while(cnt--)
    41             {
    42                 if(flag!=1)
    43                     break;
    44                 if(act=='L')
    45                     r[num].dis=(r[num].dis+1)%4;
    46                 else if(act=='R')
    47                     r[num].dis=(r[num].dis+3)%4;
    48                 else
    49                 {
    50                     map[r[num].x][r[num].y]=0;
    51                     r[num].x+=dx[r[num].dis];
    52                     r[num].y+=dy[r[num].dis];
    53                     if(r[num].x==0||r[num].x>a||
    54                         r[num].y==0||r[num].y>b)
    55                         flag=0,t=num;
    56                     else if(map[r[num].x][r[num].y]!=0)
    57                         flag=2,t=num,j=map[r[num].x][r[num].y];
    58                     else
    59                         map[r[num].x][r[num].y]=num;
    60                 }
    61             }    
    62         }
    63         if(flag==1)
    64             printf("OK\n");
    65         else if(flag==0)
    66             printf("Robot %d crashes into the wall\n",t);
    67         else
    68             printf("Robot %d crashes into robot %d\n",t,j);  
    69     }
    70     return 0;
    71 }
     
  • 相关阅读:
    NX二次开发-UFUN UF_UI_add_to_class_sel将UDOTestClass类的显示名称加入到类选择对话框的类列表中
    NX二次开发-UFUN创建管道UF_MODL_create_tube
    NX二次开发-UFUN获得工作视图的tag UF_VIEW_ask_work_view
    SQLyog/Mysql怎么修改用户/root密码【转载】
    MySQL返回来的值都是字符串类型,还原每个字段【转载】
    NX二次开发-NX访问MySQL数据库(增删改查)
    NX二次开发-ug表达式函数ug_find_file读取当前prt所在路径【转发】
    QT界面开发-QProgressBar【转载】
    QT界面开发-使用new QComboBox添加触发事件
    QT界面开发-窗口滚动条【转发】
  • 原文地址:https://www.cnblogs.com/wilsonjuxta/p/2953738.html
Copyright © 2011-2022 走看看