poj 1573 Robot Motion 暑假训练第9题 模拟 大水题

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<map>
using namespace std;
map<char ,int> s;
int n,m,k,kk;
int kan=1;
int p,q,x,y;
char a[12][12];
int visit[12][12]={-1};
int dir[4][2]={-1,0,0,1,1,0,0,-1};
void check(int x,int y)
{
if(x<0||x>=n||y<0||y>=m)
{
kan=0;
}
else if(visit[x][y]!=-1)
{
kk=visit[x][y];
kan=2;
}
}
void tell()
{
int ll;
x=0;
y=k-1;
while(kan)
{
ll=s[a[x][y]];
p=dir[ll][0]+x;
q=dir[ll][1]+y;
check(p,q);
if(kan==0)
{
cout<<visit[x][y]+1<<" step(s) to exit"<<endl;
break;
}
if(kan==2)
{
cout<<kk<<" step(s) before a loop of "<<visit[x][y]+1-kk<<" step(s)"<<endl;
break;
}
visit[p][q]=visit[x][y]+1;
x=p;
y=q;
}
}
int main()
{
s['N']=0;s['E']=1,s['S']=2,s['W']=3;
while(cin>>n>>m>>k)
{
kan=1;
if(n==m&&m==k&&k==0)
break;
memset(visit,-1,sizeof(visit));
int i,j,t;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
cin>>a[i][j];
}
}
visit[0][k-1]=0;
tell();
}
return 0;
}