Submission #7137024

---

Source Code Expand

#include <string>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <bitset>
#include <stack>
using namespace std;

struct pos
{
    int x;
    int y;
    pos() {}
    pos(int _x, int _y)
    {
        x = _x; y = _y;
    }
};

int main()
{
    int h, w;
    cin >> h >> w;
    char* cell = new char[h * w];
    bool* visited = new bool[h * w];
    pos s, g;
    for (int x = 0; x < h; x++)
    {
        for (int y = 0; y < w; y++)
        {
            visited[h * x + y] = false;
            cin >> cell[h * x + y];
            if (cell[h * x + y] == 's')
            {
                s.x = x; s.y = y;
            }
            else if (cell[h * x + y] == 'g')
            {
                g.x = x; g.y = y;
            }
        }
    }

    stack<pos> st;
    st.push(s);
    while (!st.empty())
    {
        pos c = st.top();
        st.pop();

        if (visited[h * c.x + c.y] || cell[h * c.x + c.y] == '#') continue;
        else if (cell[h * c.x + c.y] == 'g')
        {
            cout << "Yes" << endl;
            return 0;
        }
        visited[h * c.x + c.y] = true;

        if (c.x > 0) st.push(pos(c.x - 1, c.y));
        if (c.x < h - 1) st.push(pos(c.x + 1, c.y));
        if (c.y > 0) st.push(pos(c.x, c.y - 1));
        if (c.y < w - 1) st.push(pos(c.x, c.y + 1));
    }

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

Submission Info

Judge Result