Submission #9501360

---

Source Code Expand

#include<bits/stdc++.h>

int main()
{
    int h,w;
    std::cin >> h >> w;
    std::vector<std::vector<bool>> map(h + 2,std::vector<bool>(w + 2));
    std::pair<int,int> s,g;

    for(int i = 1; i <= h; i++){
        for(int j = 1; j <= w; j++){
            char a; std::cin >> a;
            if(a == 's'){s.first = i, s.second = j;map[i][j] = true;}
            else if(a == 'g'){g.first = i, g.second = j;map[i][j] = true;}
            else map[i][j] = a == '.';
        }
    }

    std::vector<std::pair<int,int>> dir = {{1,0},{0,1},{-1,0},{0,-1}};
    std::queue<std::pair<int,int>> que;
    que.push({s.first, s.second});
    map[s.first][s.second] = false;
    while(que.size()){
        auto cur = que.front();
        que.pop();
        for(auto i : dir){
            if(map[cur.first + i.first][cur.second + i.second]){
                que.push({cur.first + i.first, cur.second + i.second});
                map[cur.first + i.first][cur.second + i.second] = false;
            }
        }
    }
    std::cout << (map[g.first][g.second] ? "No" : "Yes") << std::endl;
}

Submission Info

Judge Result