poj 2632
来源:互联网 发布:语音速记软件 编辑:程序博客网 时间:2024/05/16 03:51
Crashing Robots
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8522 Accepted: 3682
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.
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
and 1 <= < repeat> <= 100 is the number of times the robot should perform this single move.
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:
Only the first crash is to be reported.
- 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
45 42 21 1 E5 4 W1 F 72 F 75 42 41 1 E5 4 W1 F 32 F 11 L 11 F 35 42 21 1 E5 4 W1 L 961 F 25 42 31 1 E5 4 W1 F 41 L 11 F 20
Sample Output
Robot 1 crashes into the wallRobot 1 crashes into robot 2OKRobot 1 crashes into robot 2
Source
Nordic 2005
#include<iostream>#include<cstring>#include<cstdio>//#include <bits/stdc++.h>using namespace std;struct node{ int x; int y; char z;} p[100000];int main(){//freopen("in.txt","r",stdin); int T; cin>>T; while(T--) { int a,b; cin>>a>>b; int N,M; cin>>N>>M; for(int i=1; i<=N; i++) { cin>>p[i].x>>p[i].y>>p[i].z; } int flag=1; for(int i=0; i<M; i++) { int n,r; char zh; cin>>n>>zh>>r; if(flag==0) continue; if(zh=='F') { for(int j=0; j<r; j++) { if(p[n].z=='E') {p[n].x++; // cout<<p[n].x; } else if(p[n].z=='W') p[n].x--; else if(p[n].z=='N') p[n].y++; else if(p[n].z=='S') p[n].y--; if(p[n].x==0||p[n].y==0||p[n].x==a+1||p[n].y==b+1) //<span id="transmark"></span> { cout<<"Robot "<<n<<" crashes into the wall"; flag=0; break; } for(int k=1; k<=N; k++) { if(k!=n) if(p[n].x==p[k].x&&p[n].y==p[k].y) { cout<<"Robot "<<n<<" crashes into robot "<<k; flag=0; break; } } if(flag==0) break; } } else if(zh=='L') { for(int j=0; j<r; j++) { if(p[n].z=='E') p[n].z='N'; else if(p[n].z=='W') p[n].z='S'; else if(p[n].z=='N') p[n].z='W'; else if(p[n].z=='S') p[n].z='E'; } } else if(zh=='R') { for(int j=0; j<r; j++) { if(p[n].z=='E') p[n].z='S'; else if(p[n].z=='W') p[n].z='N'; else if(p[n].z=='N') p[n].z='E'; else if(p[n].z=='S') p[n].z='W'; } } } if(flag) cout<<"OK"; cout<<endl; }}
0 0
- POJ 2632
- poj 2632
- poj 2632
- POJ 2632
- POJ 2632
- poj-2632
- POJ-2632
- poj 2632
- poj 2632
- poj 2632
- Poj 2632 Crashing Robots
- poj 2632 Crashing Robots
- poj 2632 Crashing Robots
- poj 2632 模拟
- poj-2632-Crashing Robots
- POJ 2632 Crashing Robots
- POJ 2632 Crashing Robots
- POJ 2632 Crashing Robots
- 分享一个很好用的验证码插件代码
- java 通过元数据改写jdbcUtil访问jar
- Eclipse搭建Spring开发环境
- C++ Primer 第五版 练习9.52 解答
- 待重写
- poj 2632
- Linux_USB驱动程序设计学习
- CSS3结构性伪类
- 面试题2:实现Singleton
- 计蒜客 难题题库 027 三值排序
- 快快快!27个提升效率的iOS开源库推荐
- 读书观点
- atitit.html编辑器的设计要点与框架选型 attilax总结
- gstreamer ugly插件x264enc不能编译的原因