仙岛求药

题目链接

#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
#include<cstdio>
using namespace std;
const int INF=0x3f3f3f3f;
const int N=100000;
char a[25][25];
bool vis[25][25];
int dx[]={0,-1,0,1};
int dy[]={-1,0,1,0};
int n,m;
struct Node{
	int x,y,level;
}now,Next,start;
int bfs(int x,int y){
	memset(vis,0,sizeof(vis));
	start.x=x,start.y=y,start.level=0;
	vis[x][y]=1;
	queue<Node> q;
	q.push(start);
	while(!q.empty()){
		now=q.front();
		q.pop();
		if(a[now.x][now.y]=='*')  return now.level;
		for(int i=0;i<4;i++){
			int nx=now.x+dx[i];             //注意不是x 
			int ny=now.y+dy[i];
			if(nx>=0&&nx<n&&ny>=0&&ny<m&&a[nx][ny]!='#'&&!vis[nx][ny]){
				Next.x=nx,Next.y=ny,Next.level=now.level+1;
				vis[nx][ny]=1;
				q.push(Next);
			}
		}
	}
	return -1;
}
int main(){
	while(cin>>n>>m&&(n&&m)){
		int sx,sy;
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				cin>>a[i][j];
			}
		}
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				if(a[i][j]=='@'){
					sx=i,sy=j;
				}
			}
		}
		int ans=bfs(sx,sy);
		cout<<ans<<endl;
	}
}