http://acm.hdu.edu.cn/showproblem.php?pid=1728
注意行列反了 用经过每个点的最小转弯数来标记点是否压入队列
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn = 105;
const int inf = 1<<30;
int n,m,turn;
int sx,sy,ex,ey;
char map[maxn][maxn];
int vis[maxn][maxn];
int xs[] = {0,1,0,-1};
int ys[] = {1,0,-1,0};
struct node
{
int x,y,d,t;
};
bool BFS()
{
node cur,cnt;
queue<node>que;
cur.x = sx; cur.y = sy;
cur.d = -1; cur.t = -1;
que.push( cur );
while ( !que.empty() )
{
cur = que.front(); que.pop();
if( cur.t > turn )
continue;
if( cur.x == ex && cur.y == ey )
return true;
for ( int i = 0; i < 4; i ++ )
{
cnt.x = cur.x + xs[i];
cnt.y = cur.y + ys[i];
if ( cnt.x >= 1 && cnt.x <= n && cnt.y >= 1 && cnt.y <= m && map[cnt.x][cnt.y] == '.' )
{
if( i != cur.d )
cnt.t = cur.t + 1;
else
cnt.t = cur.t;
cnt.d = i;
if( vis[cnt.x][cnt.y] >= cnt.t )
{
vis[cnt.x][cnt.y] = cnt.t;
que.push(cnt);
}
}
}
}
return false;
}
int main()
{
//freopen("data.txt","r",stdin);
int t;
scanf("%d",&t);
while ( t -- )
{
scanf("%d%d",&n,&m);
for ( int i = 1; i <= n; i ++ )
{
getchar();
for ( int j = 1; j <= m; j ++ )
{
scanf("%c",&map[i][j]);
vis[i][j] = inf;
}
}
scanf("%d%d%d%d%d",&turn,&sy,&sx,&ey,&ex);
if( BFS() )
puts("yes");
else
puts("no");
}
return 0;
}