Submission #423697

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;

int H,W;
char meiro[500][500];
bool toutatu[500][500];
bool kekka=false;
int sx,sy,gx,gy;

void search(int x,int y){
    if(meiro[x][y] == '#' || x<0 || x>=W || y<0 ||y>=H )return;
    if(toutatu[x][y] == true) return;
    toutatu[x][y] = true;
    if(x==gx && y==gy){
        kekka = true;
        return;
    }

    search(x+1,y); //migi
    search(x,y-1); //sita
    search(x-1,y); //hidari
    search(x,y+1); //ue
}

int main(){
    cin >> H >> W;
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            cin >> meiro[i][j];
            if(meiro[i][j] == 's'){
                sx = i;
                sy = j;
            }
            else if(meiro[i][j] == 'g'){
                gx = i;
                gy = j;
            }
        }
    }

    search(sx,sy);
    if(kekka == true){
        cout << "yes" << endl;
    }
    else{
        cout << "No" << endl;
    }
    return 0;
}

Submission Info

Judge Result