poj_2632

题目链接：http://poj.org/problem?id=2632

模拟题，只要思路清晰即可。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<set>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll  __int64
#define N 110
int vis[N][N];
int n,m;
int robots,instr;
struct Robots{
	int x,y;
	int dir;
}rb[110];
int dirx[5] = {0,1,0,-1};
int diry[5] = {1,0,-1,0};
bool check(int id,int x,int y){
	if(x<=0 || x>n || y<=0 || y>m){
		printf("Robot %d crashes into the wall\n",id);
		return false;
	}
	if(vis[x][y]){
		printf("Robot %d crashes into robot %d\n",id,vis[x][y]);
		return false;
	}
	return true;
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif
	int t;
	sf(t);
	while(t--){
			sfd(n,m);
			sfd(robots,instr);
			memset(vis,0,sizeof vis);
			char dir[3];
			int flag = 0;
			for(int i=1;i<=robots;i++){		//0->N,1->E,2->S,3->W
				scanf("%d%d%s",&rb[i].x,&rb[i].y,dir);
				if(dir[0] == 'N')
					rb[i].dir = 0;
				else if(dir[0] == 'E')
					rb[i].dir = 1;
				else if(dir[0] == 'S')
					rb[i].dir = 2;
				else
					rb[i].dir = 3;
//				if(!check(i,rb[i].x,rb[i].y)){
//						flag = 1;
//				}
				vis[rb[i].x][rb[i].y] = i;		//vis[i][j] = x represents that xth robot is on this area now
			}
			int id,rp;
			char act[3];
			for(int i=0;i<instr;i++){
				scanf("%d%s%d",&id,act,&rp);
				if(flag)
					continue;						//Note:only deal the first crash
				if(act[0] == 'L'){
					while(rp--){
						rb[id].dir = rb[id].dir-1;
						if(rb[id].dir<0)
							rb[id].dir = 3;
					}
				}else if(act[0]	 == 'R'){
					while(rp--){
						rb[id].dir = (rb[id].dir+1)%4;
					}
				}else{
					vis[rb[id].x][rb[id].y] = 0;	//when a robot moves,we should make vis[x][y]=0;
					while(rp--){
						int direction = rb[id].dir;
						rb[id].x += dirx[direction];
						rb[id].y += diry[direction];
						if(!flag && !check(id,rb[id].x,rb[id].y)){
							flag=1;
						}
					}
					if(!flag)
					 vis[rb[id].x][rb[id].y] = id;		//if x,y>0 we mark the destination vis[x][y]=id
				}
			}
			if(!flag)									//if no crash happens
				printf("OK\n");
	}
	return 0;
}