Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstring>
- using namespace std;
- int maze[100][100];
- int visited[100][100];
- int judge=0;
- int stax,stay,endx,endy;
- void search(int x,int y){
- if(x==endx&&y==endy) {
- cout<<"Yes";
- judge=1;
- }
- else{
- if(maze[x+1][y]==0&&visited[x+1][y]==0) {
- visited[x+1][y]=1;
- search(x+1,y);
- visited[x+1][y]=0;
- }
- if(maze[x-1][y]==0&&visited[x-1][y]==0) {
- visited[x-1][y]=1;
- search(x-1,y);
- visited[x-1][y]=0;
- }
- if(maze[x][y+1]==0&&visited[x][y+1]==0) {
- visited[x][y+1]=1;
- search(x,y+1);
- visited[x][y+1]=0;
- }
- if(maze[x][y-1]==0&&visited[x][y-1]==0) {
- visited[x][y-1]=1;
- search(x,y-1);
- visited[x][y-1]=0;
- }
- }
- }
- int main(){
- int m,n;
- cin>>m>>n;
- for(int i=0;i<=m+1;++i){
- for(int j=0;j<=n+1;++j){
- maze[i][j]=1;
- }
- }
- for(int i=1;i<=m;++i){
- for(int j=1;j<=n;++j){
- cin>>maze[i][j];
- if(maze[i][j]==2) {
- stax=i;stay=j;
- }
- if(maze[i][j]==3){
- endx=i;endy=j;
- maze[i][j]=0;
- }
- }
- }
- visited[stax][stay]=1;
- search(stax,stay);
- if(judge==1) cout<<"Yes"<<endl;
- else cout<<"No"<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement