题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1824
代码:
#include <iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int x,y;
char str[65][65];
while(scanf("%d %d",&x,&y)!=EOF)
{
getchar();
for(int i=1;i<=x;i++)
gets(str[i]);
for(int i=1;i<=x;i++)
for(int j=y;j>=1;j--)
str[i][j]=str[i][j-1];
int xi,yi;
scanf("%d %d",&xi,&yi);
char to='N';
char cc[505];
while(gets(cc))
{
int len=strlen(cc);
for(int i=0;i<len;i++)
{
if(cc[i]==' ')
continue;
if(cc[i]=='Q')
goto gg;
if(cc[i]=='R')
{
if(to=='N')
to='E';
else if(to=='E')
to='S';
else if(to=='S')
to='W';
else if(to=='W')
to='N';
}
if(cc[i]=='L')
{
if(to=='N')
to='W';
else if(to=='W')
to='S';
else if(to=='S')
to='E';
else if(to=='E')
to='N';
}
if(cc[i]=='F')
{
if(to=='N' && str[xi-1][yi]!='*' && xi-1>=1)
xi=xi-1;
if(to=='E' && str[xi][yi+1]!='*' && yi+1<=y)
yi=yi+1;
if(to=='S' && str[xi+1][yi]!='*' && xi+1<=x)
xi=xi+1;
if(to=='W' && str[xi][yi-1]!='*' && yi-1>=1)
yi=yi-1;
}
}
}
gg: printf("%d %d %c\n",xi,yi,to);
}
return 0;
}