HDU 2102

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int n, m, t, flag, vis1[12][12], vis2[12][12];
int gox[4] = { 0,0,1,-1 }, goy[4] = { 1,-1,0,0 };
int rx, ry, num;
char a[12][12], b[12][12];
void map1(int x, int y, int step);
void map2(int x, int y, int step);
int hehe(int x, int y)
{
	return abs(x - rx) + abs(y - ry);
}
void map2(int x, int y, int step)
{
	if (flag || step > t)
		return;
	if (step + hehe(x, y) > t&&num == 2)
		return;
	if (b[x][y] == 'P')
	{
		if (step <= t)
			flag = 1;
		return;
	}
	int xx, yy;
	for (int i = 0; i < 4; i++)
	{
		xx = x + gox[i];
		yy = y + goy[i];
		if (xx >= 0 && yy >= 0 && xx < m&&yy < n&&b[xx][yy] != '*' && !vis2[xx][yy])
		{
			vis2[xx][yy] = 1;
			if (b[xx][yy] == '#')
			{
				if (a[xx][yy] != '*'&&a[xx][yy] != '#')
					map1(xx, yy, step + 1);
			}
			else  map2(xx, yy, step + 1);
			vis2[xx][yy] = 0;
		}
	}
	return;
}
void map1(int x, int y, int step)
{
	if (flag || step > t)
		return;
	if (step + hehe(x, y) > t&&num == 1)
		return;
	if (a[x][y] == 'P')
	{
		if (step <= t)
			flag = 1;
		return;
	}
	int xx, yy;
	for (int i = 0; i < 4; i++)
	{
		xx = x + gox[i];
		yy = y + goy[i];
		if (xx >= 0 && yy >= 0 && xx < m&&yy < n&&a[xx][yy] != '*' && !vis1[xx][yy])
		{
			vis1[xx][yy] = 1;
			if (a[xx][yy] == '#')
			{
				if (b[xx][yy] != '*'&&b[xx][yy] != '#')
					map2(xx, yy, step + 1);
			}
			else  map1(xx, yy, step + 1);
			vis1[xx][yy] = 0;
		}
	}
	return;
}
int main()
{
	int c;
	cin>>c;
	while (c--)
	{
		cin>>m>>n>>t;
		flag = num = 0;
		memset(vis1, 0, sizeof(vis1));
		memset(vis2, 0, sizeof(vis2));
		for (int i = 0; i < m; i++)
		{
			cin>>a[i];
			for (int j = 0; j < n; j++)
				if (a[i][j] == 'P')
				{
					rx = i;
					ry = j;
					num = 1;
				}
		}
		for (int i = 0; i < m; i++)
		{
			cin>> b[i];
			for (int j = 0; j < n; j++)
				if (b[i][j] == 'P')
				{
					rx = i;
					ry = j;
					num = 2;
				}
		}
		vis1[0][0] = 1;
		map1(0, 0, 0);
		if (flag)
			cout<<"YES\n";
		else cout<<"NO\n";
	}
}

bfs，要在bfs的基础上增加是否会撞死，然后就没什么了。。（听说找到公主时，小于t也可以。。。。。。。。。）