Submission #4398160

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout.precision(12);
    cout.setf(ios_base::fixed, ios_base::floatfield);
    
    int H, W;
    cin >> H >> W;
    string m[502];
    m[0] = m[H+1] = "";
    for(int i=0;i<=W+1;i++){
        m[0].push_back('#');
        m[H+1].push_back('#');
    }
    for(int h=1;h<=H;h++){
        cin >> m[h];
        m[h] = "#" + m[h] + "#";
    }
    pair<int,int> s, g;
    for(int h=1;h<=H;h++){
        for(int w=1;w<=W;w++){
            if(m[h][w]=='s') s = {h, w};
            if(m[h][w]=='g') g = {h, w};
        }
    }
    
    stack<pair<int,int>> stk;
    stk.push(s);
    int dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};
    while(!stk.empty()){
        auto t = stk.top();
        stk.pop();
        for(int i=0;i<4;i++){
            switch(m[t.first+dy[i]][t.second+dx[i]]){
                case 'g':
                    cout << "Yes" << endl;
                    return 0;
                    break;
                case '.':
                    stk.push({t.first+dy[i], t.second+dx[i]});
                    m[t.first+dy[i]][t.second+dx[i]] = '#';
                    break;
            }
        }
    }

    cout << "No" << endl;
    return 0;
}

Submission Info

Judge Result