POJ训练计划2632_Crashing Robots(模拟)

最新推荐文章于 2021-05-29 18:26:59 发布
原创 最新推荐文章于 2021-05-29 18:26:59 发布 · 708 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文介绍了一道关于机器人在仓库中移动并避免碰撞的问题。通过模拟每一步移动，判断机器人是否会发生碰撞，并实现相应的算法。

摘要生成于 C知道 ，由 DeepSeek-R1 满血版支持， 前往体验 >

 Crashing Robots
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

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
解题报告
模拟一题。。。
在每次向前走一步的时候判断是否有撞到其他机器人即可；还要注意的是break和continen的差别；
模拟题嘛，代码就是长，还好单步可以很清楚的调试。
#include <iostream>
#include <stdio.h>
#include <string.h>

using namespace std;
struct node
{
    int x,y;
    char D[2];
} rob[200];
int mmap[200][200];
int main()
{
    int n,m,a,b,i,j,t;
    int R,T;
    char A[2];
    scanf("%d",&t);
    while(t--)
    {
        int f=0;
        memset(mmap,0,sizeof(mmap));
        scanf("%d%d",&b,&a);
        scanf("%d%d",&n,&m);
        for(i=1; i<=n; i++)
        {
            scanf("%d%d%s",&rob[i].y,&rob[i].x,rob[i].D);
            rob[i].x=a-rob[i].x+1;
            mmap[rob[i].x][rob[i].y]=i;
        }
        while(m--)
        {

            scanf("%d%s%d",&R,A,&T);
            if(f)continue;
            mmap[rob[R].x][rob[R].y]=0;
            if(rob[R].D[0]=='E')
            {
                if(A[0]=='F')
                {
                    for(i=1; i<=T; i++)
                    {
                        if(rob[R].y+i<=b)
                        {
                            if(mmap[rob[R].x][rob[R].y+i]!=0)
                            {
                                f=1;
                                printf("Robot %d crashes into robot %d\n",R,mmap[rob[R].x][rob[R].y+i]);
                                break;
                            }
                        }
                    }
                    if(f==0)
                    {
                        rob[R].y+=T;
                        if(rob[R].y>b)
                        {
                            f=1;
                            printf("Robot %d crashes into the wall\n",R);
                            continue;
                        }
                        else mmap[rob[R].x][rob[R].y]=R;
                    }
                }
                else if(A[0]=='L')
                {
                    int k=T%4;
                    switch(k)
                    {
                    case 0:
                        rob[R].D[0]='E';
                        break;
                    case 1:
                        rob[R].D[0]='N';
                        break;
                    case 2:
                        rob[R].D[0]='W';
                        break;
                    case 3:
                        rob[R].D[0]='S';
                        break;
                    }
                }
                else if(A[0]=='R')
                {
                    int k=T%4;
                    switch(k)
                    {
                    case 0:
                        rob[R].D[0]='E';
                        break;
                    case 1:
                        rob[R].D[0]='S';
                        break;
                    case 2:
                        rob[R].D[0]='W';
                        break;
                    case 3:
                        rob[R].D[0]='N';
                        break;
                    }
                }
            }
            else if(rob[R].D[0]=='W')
            {
                if(A[0]=='F')
                {
                    for(i=1; i<=T; i++)
                    {
                        if(rob[R].y-i>=1)
                        {
                            if(mmap[rob[R].x][rob[R].y-i]!=0)
                            {
                                f=1;
                                printf("Robot %d crashes into robot %d\n",R,mmap[rob[R].x][rob[R].y-i]);
                                break;
                            }
                        }
                    }
                    if(f==0)
                    {
                        rob[R].y-=T;
                        if(rob[R].y<1)
                        {
                            f=1;
                            printf("Robot %d crashes into the wall\n",R);
                            continue;
                        }
                        else mmap[rob[R].x][rob[R].y]=R;
                    }
                }
                else if(A[0]=='R')
                {
                    int k=T%4;
                    switch(k)
                    {
                    case 0:
                        rob[R].D[0]='W';
                        break;
                    case 1:
                        rob[R].D[0]='N';
                        break;
                    case 2:
                        rob[R].D[0]='E';
                        break;
                    case 3:
                        rob[R].D[0]='S';
                        break;
                    }
                }
                else if(A[0]=='L')
                {
                    int k=T%4;
                    switch(k)
                    {
                    case 0:
                        rob[R].D[0]='W';
                        break;
                    case 1:
                        rob[R].D[0]='S';
                        break;
                    case 2:
                        rob[R].D[0]='E';
                        break;
                    case 3:
                        rob[R].D[0]='N';
                        break;
                    }
                }
            }
            else if(rob[R].D[0]=='N')
            {
                if(A[0]=='R')
                {
                    int k=T%4;
                    switch(k)
                    {
                    case 0:
                        rob[R].D[0]='N';
                        break;
                    case 1:
                        rob[R].D[0]='E';
                        break;
                    case 2:
                        rob[R].D[0]='S';
                        break;
                    case 3:
                        rob[R].D[0]='W';
                        break;
                    }
                }
                else if(A[0]=='F')
                {
                    for(i=1; i<=T; i++)
                    {
                        if(rob[R].x-i>=1)
                        {
                            if(mmap[rob[R].x-i][rob[R].y]!=0)
                            {
                                f=1;
                                printf("Robot %d crashes into robot %d\n",R,mmap[rob[R].x-i][rob[R].y]);
                                break;
                            }
                        }
                    }
                    if(f==0)
                    {
                        rob[R].x-=T;
                        if(rob[R].x<1)
                        {
                            f=1;
                            printf("Robot %d crashes into the wall\n",R);
                            continue;
                        }
                        else mmap[rob[R].x][rob[R].y]=R;
                    }
                }
                else if(A[0]=='L')
                {
                    int k=T%4;
                    switch(k)
                    {
                    case 0:
                        rob[R].D[0]='N';
                        break;
                    case 1:
                        rob[R].D[0]='W';
                        break;
                    case 2:
                        rob[R].D[0]='S';
                        break;
                    case 3:
                        rob[R].D[0]='E';
                        break;
                    }
                }
            }
            else if(rob[R].D[0]=='S')
            {
                if(A[0]=='L')
                {
                    int k=T%4;
                    switch(k)
                    {
                    case 0:
                        rob[R].D[0]='S';
                        break;
                    case 1:
                        rob[R].D[0]='E';
                        break;
                    case 2:
                        rob[R].D[0]='N';
                        break;
                    case 3:
                        rob[R].D[0]='W';
                        break;
                    }
                }
                else if(A[0]=='F')
                {
                    for(i=1; i<=T; i++)
                    {
                        if(rob[R].x+i<=a)
                        {
                            if(mmap[rob[R].x+i][rob[R].y]!=0)
                            {
                                f=1;
                                printf("Robot %d crashes into robot %d\n",R,mmap[rob[R].x+i][rob[R].y]);
                                break;
                            }
                        }
                    }
                    if(f==0)
                    {
                        rob[R].x+=T;
                        if(rob[R].x>a)
                        {
                            f=1;
                            printf("Robot %d crashes into the wall\n",R);
                            continue;
                        }
                        else mmap[rob[R].x][rob[R].y]=R;
                    }
                }
                else if(A[0]=='R')
                {
                    int k=T%4;
                    switch(k)
                    {
                    case 0:
                        rob[R].D[0]='S';
                        break;
                    case 1:
                        rob[R].D[0]='W';
                        break;
                    case 2:
                        rob[R].D[0]='N';
                        break;
                    case 3:
                        rob[R].D[0]='E';
                        break;
                    }
                }
            }
        }
        if(f==0)printf("OK\n");
    }
    return 0;
}


POJ训练计划2528_Mayor's posters(线段树/成段更新+离散化)
_nplus
08-10 3万+
解题报告 地址传送门 题意： 一些海报，覆盖上去后还能看到几张。 思路： 第一道离散化的题。 离散化的意思就是区间压缩然后映射。 给你这么几个区间[1,300000],[3,5],[6,10],[4,9] 区间左右坐标排序完就是 1,3,4,5,6,9,10,300000; 1,2,3,4,5,6, 7 ,8; 我们可以把上面的区间映射成[1,8],[2,4],[5,7],[
POJ训练计划2299_Ultra-QuickSort(线段树/单点更新)
_nplus
08-10 2713
解题报告 题意： 求逆序数。 思路： 线段树离散化处理。 #include #include #include #include #define LL long long using namespace std; LL sum[2001000],num[501000],_hash[501000]; void push_up(int rt) { sum[rt]=sum[rt
poj_2632_Crashing Robots(模拟)
Light_starlight
07-14 767
A - Crashing Robots Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Status Description In a modernized warehouse, robots are used to fetch the goo
POJ2632 HDU2300 Crashing Robots【模拟】
海岛Blog
03-11 272
Crashing Robots Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14225 Accepted: 5936 Description In a modernized warehouse, robots are used to fetch the goods. Careful planning is needed to ensure that the robots reach their destinations witho
poj 2632 Crashing Robots(模拟）
johsnows的博客
07-28 408
Crashing Robots Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9977   Accepted: 4243 Description In a modernized warehouse, robots are used to fetch the g
poj 2632 Crashing Robots_模拟
吹来的寒风
07-24 566
做的差点想吐，调来调去，编译器都犯毛病，wlgq，幸好1a。 题意：给你机器人怎走的路线，碰撞就输出 #include #include #include #include #define N 110 using namespace std; struct Rob{ int x,y,dire;//dire 1为e,2为s,3为w,4为n }rob[N]; int n,m
poj_2632 Crashing Robots（简单模拟）
凳子
10-14 259
Crashing Robots Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10282   Accepted: 4358 Description In a modernized warehouse, robots are used to fetch the go
POJ 2632 Crashing Robots【模拟】
DUT_LYH
05-29 217
#include <iostream> using namespace std; #define debug(x) cout<<#x<<": "<<(x)<<endl; #pragma warning(disable:4996) int K, A, B, N, M; int a[1002][1002]; struct rob { int x, y; int d; // n 0 , e 1 }; rob rbs[10
POJ 2632-Crashing Robots（模拟-robot移动）
Some.
01-19 782
Crashing Robots Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10491   Accepted: 4444 Description In a modernized warehouse, robots are used to fetch the go
模拟 | POJ2632.Crashing Robots
Redemption1997的博客
08-26 218
模拟 | POJ2632.Crashing Robots Link：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 destinatio...
poj 2632 Crashing Robots
山隹的博客
04-25 210
模拟题，考验一些细节的东西，但我真的是太笨了，细节方面总是出错。 这一题最关键的是如何用数组表示出这个二维坐标平面，我个人觉得把题目给的图顺时针旋转90度的话，就比较方便。 题源 以下是代码（虽然是从网上看的）： #include <iostream> #include <algorithm> #include <cstdio> #include <map...
POJ2632-Crashing Robots解题分析与AC代码
北大POJ2632-Crashing Robots是一道经典的编程题，常作为算法和编程能力的测试题出现在各大在线编程平台和算法竞赛中，如北京大学的在线评测系统（PKU Judge Online，简称POJ）。该题目要求参与者利用算法逻辑，编写...
POJ训练计划2251_Dungeon Master(三维BFS)
热门推荐
_nplus
05-08 1万+
#include #include #include #include #include using namespace std; int l,r,c; struct node { int x,y,z,step; }; char mmap[35][35][35]; int vis[35][35][35]; int dx[]= {0,0,0,0,1,-1}; int dy[]= {
POJ训练计划3096_Surprising Strings(STL/map)
_nplus
08-09 2376
解题报告 题目传送门 题意： 给一个字符串，要求，对于这个字符串空隔为k取字符对（k=0,1,2,3,4...）要求在相同的空隔取对过程汇总，整个字符串中没有一个相同字符对如： ZGBZ： 间隔为0的字符对有: ZG、GB、BZ，三个均不相同 间隔为1的字符对有: ZG、 GZ，均不相同 间隔为2的字符对有: ZZ 仅有一个，不必比较。 这种字符串定义为
POJ训练计划1936_All in All(串处理)
_nplus
06-12 1961
POJ训练计划
POJ训练计划1035_Spell checker(串处理/暴力)
_nplus
06-12 1591
POJ训练计划
POJ训练计划3041_Asteroids(二分图/最小点覆盖=最大匹配)
_nplus
07-26 1496
解题报告 题意： 给出NxN的矩阵，有M个点是障碍 每次只能删除一行或者一列，最少删除多少次才能清除障碍 思路： 把行和列看作两个集合结点，把障碍看作集合结点的连线，这样就转化成求用最少的点来消灭边，也就是最小点覆盖。 在二分图中：（n个结点，且没有孤立的点） 最小点覆盖=最大匹配 最大点独立=结点数-最大匹配 #include #inclu
POJ训练计划2299_Ultra-QuickSort(归并排序求逆序数)
_nplus
06-20 1078
Ultra-QuickSort Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 39279   Accepted: 14163 Description In this problem, you have to analyze a particular sorting
POJ训练计划1459_Power Network(网络流最大流/Dinic)
_nplus
07-19 1020
解题报告 这题建模实在是好建，，，好贱，，， 给前向星给跪了，纯dinic的前向星竟然TLE，sad，，，回头看看优化，，， 矩阵跑过了，2A，sad，，， /************************************************************************* > File Name: PowerN.cpp > Author: _nplu
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值