Submission #3787146


Source Code Expand

#include <bits/stdc++.h>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const array<pair<int,int>,4> fd{make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)}; 

int main(){
  int h,w;cin>>h>>w;char m[500][500];
  pair<int,int> start, goal;
  rep(i,h)rep(j,w){
    cin>>m[i][j];
    if(m[i][j] == 's')start = make_pair(i,j);
    else if (m[i][j] == 'g')goal = make_pair(i,j);
  }
  stack<pair<int,int>> s;
  bool visited[500][500];rep(i,500)rep(j,500)visited[i][j] = false;
  bool goalable = false;
  s.push(start);
  while(!s.empty()){
    pair<int,int> cur = s.top();s.pop();
    if(visited[cur.first][cur.second]||m[cur.first][cur.second]=='#'||cur.first<0||cur.second<0||cur.first>=h||cur.second>=w)continue;
    if(m[cur.first][cur.second]=='g'){goalable = true;break;}
    visited[cur.first][cur.second] = true;
    rep(i,4)s.push(make_pair(cur.first+fd[i].first,cur.second+fd[i].second));
  }
  if(goalable)cout << "Yes" << endl;
  else cout << "No" << endl;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User okitz
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1163 Byte
Status AC
Exec Time 27 ms
Memory 3712 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 512 KB
00_min_02.txt AC 1 ms 512 KB
00_min_03.txt AC 1 ms 512 KB
00_min_04.txt AC 1 ms 512 KB
00_min_05.txt AC 1 ms 512 KB
00_min_06.txt AC 1 ms 512 KB
00_min_07.txt AC 1 ms 512 KB
00_min_08.txt AC 1 ms 512 KB
00_sample_01.txt AC 1 ms 512 KB
00_sample_02.txt AC 1 ms 512 KB
00_sample_03.txt AC 1 ms 512 KB
00_sample_04.txt AC 1 ms 512 KB
00_sample_05.txt AC 1 ms 512 KB
01_rnd_00.txt AC 15 ms 768 KB
01_rnd_01.txt AC 21 ms 2688 KB
01_rnd_02.txt AC 20 ms 1280 KB
01_rnd_03.txt AC 19 ms 1920 KB
01_rnd_04.txt AC 15 ms 896 KB
01_rnd_05.txt AC 20 ms 768 KB
01_rnd_06.txt AC 21 ms 1408 KB
01_rnd_07.txt AC 23 ms 1664 KB
01_rnd_08.txt AC 15 ms 768 KB
01_rnd_09.txt AC 15 ms 768 KB
01_rnd_10.txt AC 21 ms 768 KB
01_rnd_11.txt AC 15 ms 768 KB
01_rnd_12.txt AC 21 ms 2176 KB
01_rnd_13.txt AC 26 ms 2432 KB
01_rnd_14.txt AC 15 ms 768 KB
01_rnd_15.txt AC 15 ms 768 KB
01_rnd_16.txt AC 15 ms 768 KB
01_rnd_17.txt AC 23 ms 896 KB
01_rnd_18.txt AC 15 ms 768 KB
01_rnd_19.txt AC 27 ms 3712 KB
02_rndhard_00.txt AC 15 ms 768 KB
02_rndhard_01.txt AC 15 ms 768 KB
02_rndhard_02.txt AC 16 ms 768 KB
02_rndhard_03.txt AC 17 ms 768 KB
02_rndhard_04.txt AC 16 ms 768 KB
02_rndhard_05.txt AC 15 ms 768 KB
02_rndhard_06.txt AC 15 ms 768 KB
02_rndhard_07.txt AC 15 ms 768 KB
02_rndhard_08.txt AC 15 ms 768 KB
02_rndhard_09.txt AC 15 ms 768 KB
02_rndhard_10.txt AC 15 ms 768 KB
02_rndhard_11.txt AC 15 ms 768 KB
02_rndhard_12.txt AC 15 ms 768 KB
02_rndhard_13.txt AC 16 ms 768 KB
02_rndhard_14.txt AC 15 ms 768 KB
02_rndhard_15.txt AC 15 ms 768 KB
02_rndhard_16.txt AC 15 ms 768 KB
02_rndhard_17.txt AC 15 ms 768 KB
02_rndhard_18.txt AC 15 ms 768 KB
02_rndhard_19.txt AC 15 ms 768 KB
02_rndhard_20.txt AC 15 ms 768 KB
02_rndhard_21.txt AC 15 ms 768 KB
02_rndhard_22.txt AC 15 ms 768 KB
02_rndhard_23.txt AC 15 ms 768 KB
02_rndhard_24.txt AC 15 ms 768 KB
02_rndhard_25.txt AC 15 ms 768 KB
02_rndhard_26.txt AC 15 ms 768 KB
02_rndhard_27.txt AC 15 ms 768 KB
02_rndhard_28.txt AC 15 ms 768 KB
02_rndhard_29.txt AC 15 ms 768 KB
02_rndhard_30.txt AC 15 ms 768 KB
02_rndhard_31.txt AC 15 ms 768 KB
02_rndhard_32.txt AC 15 ms 768 KB
02_rndhard_33.txt AC 15 ms 768 KB
02_rndhard_34.txt AC 15 ms 768 KB
02_rndhard_35.txt AC 17 ms 768 KB
02_rndhard_36.txt AC 15 ms 768 KB
02_rndhard_37.txt AC 15 ms 768 KB
02_rndhard_38.txt AC 15 ms 768 KB
02_rndhard_39.txt AC 15 ms 768 KB
03_rndhardsmall_00.txt AC 1 ms 512 KB
03_rndhardsmall_01.txt AC 1 ms 512 KB
03_rndhardsmall_02.txt AC 1 ms 512 KB
03_rndhardsmall_03.txt AC 1 ms 512 KB
03_rndhardsmall_04.txt AC 1 ms 512 KB
03_rndhardsmall_05.txt AC 1 ms 512 KB
03_rndhardsmall_06.txt AC 1 ms 512 KB
03_rndhardsmall_07.txt AC 1 ms 512 KB
03_rndhardsmall_08.txt AC 1 ms 512 KB
03_rndhardsmall_09.txt AC 1 ms 512 KB