Submission #420221

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
using namespace std;
int a, b;
vector<string> v;
pair<int, int> st;
pair<int, int> gol;
bool use[502][502];
int dx[] = { 0, 0, 1, -1 };
int dy[] = { 1, -1, 0, 0 };
int main(){
	cin >> a >> b;
	for (int i = 0; i < a; i++){
		string s;
		cin >> s;
		v.push_back(s);
	}
	for (int i = 0; i < a; i++){
		for (int j = 0; j < b; j++){
			if (v[i][j] == 's'){
				st = make_pair(i, j);
			}
			if (v[i][j] == 'g'){
				gol = make_pair(i, j);
			}
		}
	}
	queue<pair<int, int> > q;
	q.push(st);
	use[st.first][st.second] = true;
	while (!q.empty()){
		int x = q.front().first;
		int y = q.front().second;
		q.pop();
		for (int i = 0; i < 4; i++){
			int xx = x + dx[i];
			int yy = y + dy[i];
			if (xx >= 0 && yy >= 0 && xx < a&&yy < b){
				if (v[xx][yy] == '#'){
					continue;
				}
				if (use[xx][yy]){
					continue;
				}
				use[xx][yy] = true;
				q.push(make_pair(xx, yy));
			}
		}
	}
	if (use[gol.first][gol.second]){
		puts("Yes");
	}
	else{
		puts("No");
	}
	return 0;
}

Submission Info

Judge Result