POJ-2632-Crashing Robots
2016-07-26 17:25
211 查看
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
Sample Output
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 9899 | Accepted: 4225 |
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
#include <iostream> #include<cstring> using namespace std; int Map[110][110]; struct node { int x,y,w; } peo[110]; int main() { int k, n, m, A, B,a,b; char c[5]; cin>>k; while(k--) { cin>>A>>B>>n>>m; memset(Map, 0, sizeof(Map)); for(int i = 1; i<=n; ++i) { cin>>peo[i].x>>peo[i].y>>c; switch(c[0]) { case 'W': peo[i].w = 100000; break; case 'N': peo[i].w = 100001; break; case 'E': peo[i].w = 100002; break; case 'S': peo[i].w = 100003; break; } Map[peo[i].x][peo[i].y] = i; } int id, x,flag =0; while(m--) { cin>>id>>c>>x; switch(c[0]) { case 'L': peo[id].w-=(x%4); break; case 'R': peo[id].w+=(x%4); break; case 'F': while(x--) { switch(peo[id].w%4) { case 0: peo[id].x-=1; break; case 1: peo[id].y+=1; break; case 2: peo[id].x+=1; break; case 3: peo[id].y-=1; break; } if(!flag&&(peo[id].x==0||peo[id].x==A+1||peo[id].y==0||peo[id].y==B+1)) { flag = 1; a = id; } else if(!flag&&Map[peo[id].x][peo[id].y]) { a = id; b = Map[peo[id].x][peo[id].y]; flag = 2; } else if(!flag) { Map[peo[id].x][peo[id].y] = id; switch(peo[id].w%4) { case 0: Map[peo[id].x+1][peo[id].y]= 0; break; case 1: Map[peo[id].x][peo[id].y-1]= 0; break; case 2: Map[peo[id].x-1][peo[id].y]= 0; break; case 3: Map[peo[id].x][peo[id].y+1]= 0; break; } } } break; } /* for(int i = 1;i<=A;++i) { for(int j = 1; j<=B; ++j) cout<<Map[i][j]; cout<<endl; }*/ } if(!flag)cout<<"OK"<<endl; else if(flag==1)cout<<"Robot "<<a<<" crashes into the wall"<<endl; else cout<<"Robot "<<a<<" crashes into robot "<<b<<endl; } return 0; }
相关文章推荐
- 单链表及相关操作
- 我的博客
- VS2005,VS2008,VS2010快捷键整理
- openjudge 1.7 20 :删除单词后缀
- POJ1060
- js获取URL中传来的参数
- PyGobject(二十二)布局容器之Frame
- 调用安卓手机相册和拍照,出现闪退,原因是创建的包名有问题。
- PHP高级程序员必学
- 【算法】二分查找——与答案进行比较的思维
- cocos2dx google升级libpng
- git的使用
- React Native加载网络图片失败
- WebView与Html交互,获取点击事件,并处理响应逻辑
- POJ 1426 Find The Multiple
- 圆周率 π 的研究
- 需要Device.dll 时,添加后显示 无法找到PInvoke DLL Device.dll
- LeetCode344. Reverse String
- HDU 3368 Reversi
- HDOJ-2141 Can you find it?