hdu 3345 (BFS) (二)

2014-11-24 02:51:52 · 作者: · 浏览: 5
[q.x][q.y]=='#')continue;
q.v=fun(q.x,q.y,q.v);
if(q.v<0)continue;
if(q.v>dp[q.x][q.y])
{
dp[q.x][q.y]=q.v;
Q.push(q);
if(map[q.x][q.y]!='P')
ans[q.x][q.y]='*';
}
}
}
}

int main()
{
int T,i,j;
scanf("%d",&T);
while(T--)
{
scanf("%d%d%d",&n,&m,&mv);
getchar();
memset(dp,-1,sizeof(dp));

for(i=0;i {
gets(map[i]);
for(j=0;map[i][j];j++)
{
if(map[i][j]=='Y')
{
X=i;Y=j;
}
ans[i][j]=map[i][j];
}
ans[i][m]='\0';
}
bfs();
for(i=0;i puts(ans[i]);
printf("\n");
}
return 0;
}