Submission #420563

---

Source Code Expand

//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int dx[4] = {-1,0,1,0};
int dy[4] = {0,-1,0,1};
int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int H, W; cin >> H >> W;
  VS vs(H);
  REP(i,H) cin >> vs[i];
  REP(i,H) vs[i] = "#" + vs[i] + "#";
  vs.insert(vs.begin(), string(SZ(vs[0]), '#'));
  vs.PB(string(SZ(vs[0]), '#'));
  //  for(auto& s: vs) cout<<s<<endl;

  W += 2, H += 2;
  int sx, sy, gx, gy;
  REP(y,H) REP(x,W)
	if(vs[y][x] == 's') sx = x, sy = y;
	else if(vs[y][x] == 'g') gx = x, gy = y;

  queue<PII> q;
  set<PII> s;
  q.push(MP(sx,sy));
  s.insert(MP(sx,sy));
  while(!q.empty()){
	PII p = q.front(); q.pop();
	REP(i,4){
	  PII t = p;
	  t.first += dx[i];
	  t.second += dy[i];
	  if(vs[t.second][t.first] == '#') continue;
	  if(!s.count(t)) q.push(t), s.insert(t);
	}
  }
  cout << (s.count(MP(gx,gy))? "Yes": "No") << endl;
  
  return 0;
}

Submission Info

Judge Result