百练 4155 鸣人和佐助

百练 4155

#include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=200+5;
int R,C,vis[maxn][maxn][15];
char G[maxn][maxn];
int r0,c0,r1,c1;
struct Point{
	int x,y,step,t;
	Point(int x,int y,int s,int t): x(x),y(y),step(s),t(t){}
};
bool inside(int x,int y)
{
	return x>=0&&x<R&&y>=0&&y<C;
}
int bfs(int i,int j,int T)
{
	queue<Point> Q;
	Q.push(Point(i,j,0,T));
	vis[i][j][T]=1;
	while(!Q.empty())
	{
		int x=Q.front().x,y=Q.front().y,step=Q.front().step,t=Q.front().t;Q.pop();
		if(x==r1&&y==c1) return step;
		for(int dx=-1;dx<=1;dx++)
		for(int dy=-1;dy<=1;dy++)
		{
			if((dx&&dy)||(!dx&&!dy)) continue;
			int nx=x+dx;
			int ny=y+dy;
			if(!inside(nx,ny)) continue;
			if(G[nx][ny]=='#'&&t!=0&&!vis[nx][ny][t-1]) Q.push(Point(nx,ny,step+1,t-1)),vis[nx][ny][t-1]=1;
			else if(!vis[nx][ny][t]&&(G[nx][ny]=='*'||G[nx][ny]=='+')) Q.push(Point(nx,ny,step+1,t)),vis[nx][ny][t]=1;
		}
	}
	return -1;
}
int main()
{
	int T;
	cin>>R>>C>>T;
	for(int i=0;i<R;i++)
	for(int j=0;j<C;j++)
	{
		cin>>G[i][j];
		if(G[i][j]=='+') r1=i,c1=j;
		else if(G[i][j]=='@') r0=i,c0=j;		
	}
	cout<<bfs(r0,c0,T)<<endl;
	return 0;
}