poj 2312 Battle City bfs

简单bfs

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<queue>

using namespace std;

int n, m;
struct node{
	int x, y, t;
}st;

#define N 305
int dir[4][2] = {
	1, 0, -1, 0, 0, 1, 0, -1
};

int sx, sy, ex, ey;
char a[N][N];
int vis[N][N];
int ans;

bool f( int e, int r )
{
	if( a[e][r] == 'S' || a[e][r] == 'R')
		return 0;
	if (e >= 1 && e <= n && r >= 1 && r <= m)
		return 1;
	else
		return 0;
}

int bfs( )
{
	memset(vis, 0, sizeof(vis));
	queue<node> q;
	while( !q.empty() )
		q.pop();
	st.x = sx, st.y = sy, st.t = 0;
	vis[sx][sy] = 1;
	q.push(st);
	while ( !q.empty() )
	{
		node now = q.front();
		q.pop();
		//printf("%d %d\n", now.x, now.y); 
		if( now.x == ex && now.y == ey )
		{
			ans = ans < now.t ? ans : now.t;
			continue;
		}
		for( int i = 0; i < 4; i++ )
		{
			int xx = now.x + dir[i][0];
			int yy = now.y + dir[i][1];
			if ( f(xx, yy) && (!vis[xx][yy] || vis[xx][yy] > now.t) )
			{
				node nxt;
				nxt.x = xx;
				nxt.y = yy;
				nxt.t = now.t;
				if( a[xx][yy] == 'B' )
				{
					nxt.t += 2;
				}
				else
				{
					nxt.t++;
				}
				if( nxt.t > ans )
					continue;
				vis[xx][yy] = now.t;
				q.push(nxt);
			}
		}
	}
}

int main()
{
	int tt = 1;
	while(~scanf("%d%d", &n, &m) && (n || m))
	{
		getchar();
		for( int i = 1; i <= n; i++ )
		{
			for ( int j = 1; j <= m; j++ )
				scanf("%c", &a[i][j]);
			getchar();
		}
		for ( int i = 1; i <= n; i++ )
		{
			for( int j = 1; j <= m; j++)
			{
				if( a[i][j] == 'Y' )
				{
					sx = i;
					sy = j;
				}
				if( a[i][j] == 'T')
				{
					ex = i;
					ey = j;
				}
			}
		}
		ans = 999999;
		bfs();
		printf("%d\n", (ans == 999999) ? -1 : ans);
	}
	return 0;
}