Submission #7448573

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 500005

using namespace std;

int m, n, minn = MAXN;
char mp[505][505];
char sp;
struct dot
{
	int x, y;
}st, ed;

void sch(int a, int b, int c)
{
	if(mp[a+1][b] == '.')
	{
		mp[a+1][b] = '#';
		sch(a+1, b, c+1);
	}
	else if(mp[a+1][b] == 'g')
	{
		cout << "Yes";
		exit(0);
	}
	if(mp[a][b+1] == '.')
	{
		mp[a][b+1] = '#';
		sch(a, b+1, c+1);
	}
	else if(mp[a][b+1] == 'g')
	{
		cout << "Yes";
		exit(0);
	}
	if(mp[a-1][b] == '.')
	{
		mp[a-1][b] = '#';
		sch(a-1, b, c+1);
	}
	else if(mp[a-1][b] == 'g')
	{
		cout << "Yes";
		exit(0);
	}
	if(mp[a][b-1] == '.')
	{
		mp[a][b-1] = '#';
		sch(a, b-1, c+1);
	}
	else if(mp[a][b-1] == 'g')
	{
		cout << "Yes";
		exit(0);
	}
}

int main()
{
	memset(mp, '#', sizeof(mp));
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= m; j++)
		{
			cin >> mp[i][j];
			if(mp[i][j] == 's')
			{
				st.x = i;  st.y = j;
			}
			if(mp[i][j] == 'g')
			{
				ed.x = i;  ed.y = j;
			}
		}
	}
	sch(st.x, st.y, 0);
	cout << "No";
	return 0;
}

Submission Info

Judge Result