#include<bits/stdc++.h>
using namespace std;
const int tx[4]={1,0,-1,0};
const int ty[4]={0,1,0,-1};
struct Node{
int x,y;
};
bool vis[110][110];
int n,m;
void bfs(){
queue<Node>q;
q.push(Node{1,1});
bool bo=0;
while(!q.empty()){
Node hd=q.front();
q.pop();
if(hd.x==n&&hd.y==m){
bo=1;
break;
}
for(int i=0;i<4;i++){
int nx=hd.x+tx[i];
int ny=hd.y+ty[i];
if(vis[nx][ny]){
vis[nx][ny]=0;
q.push(Node{nx,ny});
}
}
}
if(bo)cout<<"Yes";
else cout<<"No";
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
char ch;
cin>>ch;
if(ch=='.')vis[i][j]=1;
}
}
bfs();
return 0;
}
B3625
最新推荐文章于 2024-10-08 20:32:22 发布