poj_1573

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

也是模拟题，刚开始的时候有个地方没注意，wa了一发。后来看discuss里面的一组数据，试了下，发现错误的地方，改了就过了。

#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 n,m;
int dir[N][N];
int dirx[4] = {-1,0,1,0};
int diry[4] = {0,1,0,-1};
struct Node{
	int x,y,step;
};
int vis[15][15];
bool check(int x,int y){
	if(x<0 || x>=n || y<0 || y>=m)
		return false;
	return true;
}
void bfs(int x,int y){
	memset(vis,-1,sizeof vis);
	Node tmp;
	tmp.x = x;
	tmp.y = y;
	tmp.step = 0;
	queue<Node> q;
	q.push(tmp);
	vis[x][y] = 0;								//!!这句话记得加，wa一发
	while(!q.empty()){
		tmp = q.front();
		q.pop();
		int dr = dir[tmp.x][tmp.y];
		tmp.x += dirx[dr];
		tmp.y += diry[dr];
		tmp.step += 1;
		if(!check(tmp.x,tmp.y)){
			printf("%d step(s) to exit\n",tmp.step);
			return;
		}
		if(vis[tmp.x][tmp.y]>=0){		//只要再次访问，那说明肯定进入了死循环
			printf("%d step(s) before a loop of %d step(s)\n",vis[tmp.x][tmp.y],tmp.step-vis[tmp.x][tmp.y]);
			return;
		}
		vis[tmp.x][tmp.y] = tmp.step;
		q.push(tmp);
	}
	return;
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
#endif
//	int t;
	int k;
	while(scanf("%d%d%d",&n,&m,&k)!=EOF && n+m+k){
			char ch[20];
			memset(dir,-1,sizeof dir);
			for(int i=0;i<n;i++){
				sfs(ch);
				for(int j=0;j<m;j++){
					if(ch[j] == 'N')
						dir[i][j] = 0;
					else if(ch[j] == 'E')
						dir[i][j] = 1;
					else if(ch[j] == 'S')
						dir[i][j] = 2;
					else
						dir[i][j] = 3;
				}
			}
//			for(int i=0;i<n;i++){
//				for(int j=0;j<m;j++)
//					printf("%d",dir[i][j]);
//				printf("\n");
//			}
			bfs(0,k-1);
	}
	return 0;
}