Submission #420577

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long

int H,W;
struct pos{
	int x,y;
	pos(int X,int Y){x=X;y=Y;}
	pos(){}
};
int isover(int x,int y){
	return(x<0 || y< 0 || x>=W || y>=H);
}
int main(){
	cin >> H >> W;
	vector<string> field(H);
	bool flag[H][W];
	REP(i,H)REP(j,W)flag[i][j]=false;
	int sx,sy;int gx,gy;
	REP(i,H){
		cin>>field[i];
		REP(j,W){
			if(field[i][j]=='s') {sx=j;sy=i;}
			if(field[i][j]=='g'){gx=j;gy=i;}
		}
	}
// 	cout<<sx<<sy<<endl;
// 	cout<<gx<<gy<<endl;
	queue<pos> Q;
	Q.push(pos(sx,sy));
	while(!Q.empty()){
		pos current = Q.front();
// 		cout<<current.x<<" " <<current.y<<endl;
		Q.pop();
		if(current.x==gx && current.y==gy){break;}
		int dx[]={1,0,-1,0};
		int dy[]={0,1,0,-1};
		REP(i,4){
			if(isover(current.x+dx[i],current.y+dy[i])) continue;
			pos next=pos(current.x+dx[i],current.y+dy[i]);
			if(flag[next.y][next.x]) continue;
			if(field[next.y][next.x]=='#') continue;
			flag[next.y][next.x]=true;
			Q.push(next);

// 			cout<<"L"<<endl;
		}
	}
	if(flag[gy][gx]){cout<<"Yes"<<endl;}
	else cout<<"No"<<endl;

	return 0;
}

Submission Info

Judge Result