Submission #2739517


Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;

typedef vector<llong> V;

#define _ cin.tie(0);ios::sync_with_stdio(false);
int h,w;

int main(){ _;
  cin>>h>>w;
  char mez[h][w];
  stack<P> st;
  int d[]={1,0,-1,0};
  REP(i,h){
    REP(j,w){
      cin>>mez[i][j];
      if(mez[i][j]=='s')
	st.push(make_pair(i,j));
    }
  }

  while(!st.empty()){
    int y=st.top().first;
    int x=st.top().second;
	
    st.pop();

    REP(i,4){
      int dx=x+d[i];
      int dy=y+d[i^1];
      if (dx<0 || dx>=w || dy<0 || dy>=h)
	continue;
      
      if(mez[dy][dx]=='g'){
	cout<<"Yes"<<endl;
	return 0;
      }else if(mez[dy][dx] =='.'){
	st.push(make_pair(dy,dx));
	mez[dy][dx]='#';
      }
      
    }
  }
  cout<<"No"<<endl;
  
    
  return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User hajimete
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1246 Byte
Status AC
Exec Time 7 ms
Memory 1280 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 83
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt
All 00_min_01.txt, 00_min_02.txt, 00_min_03.txt, 00_min_04.txt, 00_min_05.txt, 00_min_06.txt, 00_min_07.txt, 00_min_08.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_rndhard_00.txt, 02_rndhard_01.txt, 02_rndhard_02.txt, 02_rndhard_03.txt, 02_rndhard_04.txt, 02_rndhard_05.txt, 02_rndhard_06.txt, 02_rndhard_07.txt, 02_rndhard_08.txt, 02_rndhard_09.txt, 02_rndhard_10.txt, 02_rndhard_11.txt, 02_rndhard_12.txt, 02_rndhard_13.txt, 02_rndhard_14.txt, 02_rndhard_15.txt, 02_rndhard_16.txt, 02_rndhard_17.txt, 02_rndhard_18.txt, 02_rndhard_19.txt, 02_rndhard_20.txt, 02_rndhard_21.txt, 02_rndhard_22.txt, 02_rndhard_23.txt, 02_rndhard_24.txt, 02_rndhard_25.txt, 02_rndhard_26.txt, 02_rndhard_27.txt, 02_rndhard_28.txt, 02_rndhard_29.txt, 02_rndhard_30.txt, 02_rndhard_31.txt, 02_rndhard_32.txt, 02_rndhard_33.txt, 02_rndhard_34.txt, 02_rndhard_35.txt, 02_rndhard_36.txt, 02_rndhard_37.txt, 02_rndhard_38.txt, 02_rndhard_39.txt, 03_rndhardsmall_00.txt, 03_rndhardsmall_01.txt, 03_rndhardsmall_02.txt, 03_rndhardsmall_03.txt, 03_rndhardsmall_04.txt, 03_rndhardsmall_05.txt, 03_rndhardsmall_06.txt, 03_rndhardsmall_07.txt, 03_rndhardsmall_08.txt, 03_rndhardsmall_09.txt
Case Name Status Exec Time Memory
00_min_01.txt AC 1 ms 256 KB
00_min_02.txt AC 1 ms 256 KB
00_min_03.txt AC 1 ms 256 KB
00_min_04.txt AC 1 ms 256 KB
00_min_05.txt AC 1 ms 256 KB
00_min_06.txt AC 1 ms 256 KB
00_min_07.txt AC 1 ms 256 KB
00_min_08.txt AC 1 ms 256 KB
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
00_sample_05.txt AC 1 ms 256 KB
01_rnd_00.txt AC 4 ms 512 KB
01_rnd_01.txt AC 6 ms 1152 KB
01_rnd_02.txt AC 4 ms 512 KB
01_rnd_03.txt AC 6 ms 1280 KB
01_rnd_04.txt AC 6 ms 1024 KB
01_rnd_05.txt AC 4 ms 512 KB
01_rnd_06.txt AC 5 ms 640 KB
01_rnd_07.txt AC 6 ms 768 KB
01_rnd_08.txt AC 4 ms 512 KB
01_rnd_09.txt AC 4 ms 512 KB
01_rnd_10.txt AC 7 ms 512 KB
01_rnd_11.txt AC 4 ms 512 KB
01_rnd_12.txt AC 7 ms 1024 KB
01_rnd_13.txt AC 6 ms 896 KB
01_rnd_14.txt AC 4 ms 512 KB
01_rnd_15.txt AC 4 ms 512 KB
01_rnd_16.txt AC 4 ms 512 KB
01_rnd_17.txt AC 7 ms 512 KB
01_rnd_18.txt AC 4 ms 512 KB
01_rnd_19.txt AC 4 ms 512 KB
02_rndhard_00.txt AC 4 ms 512 KB
02_rndhard_01.txt AC 4 ms 512 KB
02_rndhard_02.txt AC 4 ms 512 KB
02_rndhard_03.txt AC 4 ms 512 KB
02_rndhard_04.txt AC 4 ms 512 KB
02_rndhard_05.txt AC 4 ms 512 KB
02_rndhard_06.txt AC 4 ms 512 KB
02_rndhard_07.txt AC 4 ms 512 KB
02_rndhard_08.txt AC 4 ms 512 KB
02_rndhard_09.txt AC 4 ms 512 KB
02_rndhard_10.txt AC 4 ms 512 KB
02_rndhard_11.txt AC 4 ms 512 KB
02_rndhard_12.txt AC 4 ms 512 KB
02_rndhard_13.txt AC 4 ms 512 KB
02_rndhard_14.txt AC 4 ms 512 KB
02_rndhard_15.txt AC 4 ms 512 KB
02_rndhard_16.txt AC 4 ms 512 KB
02_rndhard_17.txt AC 4 ms 512 KB
02_rndhard_18.txt AC 4 ms 512 KB
02_rndhard_19.txt AC 4 ms 512 KB
02_rndhard_20.txt AC 4 ms 512 KB
02_rndhard_21.txt AC 4 ms 512 KB
02_rndhard_22.txt AC 4 ms 512 KB
02_rndhard_23.txt AC 4 ms 512 KB
02_rndhard_24.txt AC 4 ms 512 KB
02_rndhard_25.txt AC 4 ms 512 KB
02_rndhard_26.txt AC 4 ms 512 KB
02_rndhard_27.txt AC 4 ms 512 KB
02_rndhard_28.txt AC 4 ms 512 KB
02_rndhard_29.txt AC 4 ms 512 KB
02_rndhard_30.txt AC 4 ms 512 KB
02_rndhard_31.txt AC 4 ms 512 KB
02_rndhard_32.txt AC 4 ms 512 KB
02_rndhard_33.txt AC 4 ms 512 KB
02_rndhard_34.txt AC 4 ms 512 KB
02_rndhard_35.txt AC 4 ms 512 KB
02_rndhard_36.txt AC 4 ms 512 KB
02_rndhard_37.txt AC 4 ms 512 KB
02_rndhard_38.txt AC 4 ms 512 KB
02_rndhard_39.txt AC 4 ms 512 KB
03_rndhardsmall_00.txt AC 1 ms 256 KB
03_rndhardsmall_01.txt AC 1 ms 256 KB
03_rndhardsmall_02.txt AC 1 ms 256 KB
03_rndhardsmall_03.txt AC 1 ms 256 KB
03_rndhardsmall_04.txt AC 1 ms 256 KB
03_rndhardsmall_05.txt AC 1 ms 256 KB
03_rndhardsmall_06.txt AC 1 ms 256 KB
03_rndhardsmall_07.txt AC 1 ms 256 KB
03_rndhardsmall_08.txt AC 1 ms 256 KB
03_rndhardsmall_09.txt AC 1 ms 256 KB