Submission #6341992

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<queue>
#define MAXM 505
using namespace std;
int map[MAXM][MAXM];
int n,m;
int sx,sy;
int ex=0,ey=0;
struct point{
       int x,y;
       };
void printmap(){
     for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++)
                    cout<<map[i][j];
            cout<<endl;}
     }
bool bfs(){
     queue<point> path;
     point f;
     point p;
     f.x=sx,f.y=sy;
     path.push(f);
     
     while(path.size()){
          //printmap();
          //system("pause");
          f=path.front();
          path.pop();              
          if(f.x+1<=m&&map[f.x+1][f.y]==false){ 
               map[f.x+1][f.y]=true,p.x=f.x+1,p.y=f.y,path.push(p);
               if(p.x==ex&&p.y==ey) return true;
               }              
          if(f.x-1>=1&&map[f.x-1][f.y]==false) {
               map[f.x-1][f.y]=true,p.x=f.x-1,p.y=f.y,path.push(p);
               if(p.x==ex&&p.y==ey) return true;
               } 
          if(f.y+1<=n&&map[f.x][f.y+1]==false) {
               map[f.x][f.y+1]=true,p.x=f.x,p.y=f.y+1,path.push(p);
               if(p.x==ex&&p.y==ey) return true;
               } 
          if(f.y-1>=1&&map[f.x][f.y-1]==false) {
               map[f.x][f.y-1]=true,p.x=f.x,p.y=f.y-1,path.push(p);
               if(p.x==ex&&p.y==ey) return true;
               }               
                        }
     return false;
     }
int main(){
    cin>>n>>m;
    char t=n;
    
    for(int i=1;i<=m;i++){
            for(int j=1;j<=n;j++){
                    t=getchar();
                    while(t=='\n') 
                    t=getchar();
                    if(t=='s') {sx=i;sy=j;map[i][j]=true;}
                    else if(t=='.') map[i][j]=false;
                    else if(t=='#') map[i][j]=true;
                    else if(t=='g') {ex=i,ey=j;map[i][j]=false;}
                    }}
    
    if(bfs()) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    
    //system("pause");
    return 0;
    }

Submission Info

Judge Result