Submission #5246407


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

int fill(vector<vector<char>> &c, int H, int W) {
  int r=0;
  for (int i=1; i<=H; i++)
    for (int j=1; j<=W; j++) {
      if (c.at(i).at(j)=='s') {
        if (c.at(i).at(j-1)=='.') {
          c.at(i).at(j-1)='s';
          r=1;
        }          
        if (c.at(i).at(j+1)=='.') {
          c.at(i).at(j+1)='s';
          r=1;
        }
        if (c.at(i-1).at(j)=='.') {
          c.at(i-1).at(j)='s';
          r=1;
        }
        if (c.at(i+1).at(j)=='.') {
          c.at(i+1).at(j)='s';
          r=1;
        }
        if (c.at(i).at(j-1)=='g') return 2;
        if (c.at(i).at(j+1)=='g') return 2;
        if (c.at(i-1).at(j)=='g') return 2;
        if (c.at(i+1).at(j)=='g') return 2;        
      }
    }
  return r;
}

int main() {
  int H, W;
  cin >> H >> W;
  vector<vector<char>> c(H+2, vector<char>(W+2, '#'));
  for (int i=1; i<=H; i++)
    for (int j=1; j<=W; j++)
      cin >> c.at(i).at(j);
  int f=1;
  while (f!=0) {
    f=fill(c, H, W);
    if (f == 2) {
      cout << "Yes" << endl;
      return 0;
    }
  }
  cout << "No" << endl;
  return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User tnaito
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1181 Byte
Status
Exec Time 1074 ms
Memory 512 KB

Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt
All 100 / 100 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 1 ms 256 KB
00_min_02.txt 1 ms 256 KB
00_min_03.txt 1 ms 256 KB
00_min_04.txt 1 ms 256 KB
00_min_05.txt 1 ms 256 KB
00_min_06.txt 1 ms 256 KB
00_min_07.txt 1 ms 256 KB
00_min_08.txt 1 ms 256 KB
00_sample_01.txt 1 ms 256 KB
00_sample_02.txt 1 ms 256 KB
00_sample_03.txt 1 ms 256 KB
00_sample_04.txt 1 ms 256 KB
00_sample_05.txt 1 ms 256 KB
01_rnd_00.txt 15 ms 512 KB
01_rnd_01.txt 62 ms 512 KB
01_rnd_02.txt 285 ms 512 KB
01_rnd_03.txt 16 ms 512 KB
01_rnd_04.txt 135 ms 512 KB
01_rnd_05.txt 19 ms 512 KB
01_rnd_06.txt 65 ms 512 KB
01_rnd_07.txt 185 ms 512 KB
01_rnd_08.txt 15 ms 512 KB
01_rnd_09.txt 16 ms 512 KB
01_rnd_10.txt 868 ms 512 KB
01_rnd_11.txt 15 ms 512 KB
01_rnd_12.txt 15 ms 512 KB
01_rnd_13.txt 18 ms 512 KB
01_rnd_14.txt 15 ms 512 KB
01_rnd_15.txt 593 ms 512 KB
01_rnd_16.txt 15 ms 512 KB
01_rnd_17.txt 1074 ms 512 KB
01_rnd_18.txt 15 ms 512 KB
01_rnd_19.txt 404 ms 512 KB
02_rndhard_00.txt 51 ms 512 KB
02_rndhard_01.txt 50 ms 512 KB
02_rndhard_02.txt 234 ms 512 KB
02_rndhard_03.txt 224 ms 512 KB
02_rndhard_04.txt 21 ms 512 KB
02_rndhard_05.txt 21 ms 512 KB
02_rndhard_06.txt 32 ms 512 KB
02_rndhard_07.txt 20 ms 512 KB
02_rndhard_08.txt 91 ms 512 KB
02_rndhard_09.txt 91 ms 512 KB
02_rndhard_10.txt 89 ms 512 KB
02_rndhard_11.txt 89 ms 512 KB
02_rndhard_12.txt 68 ms 512 KB
02_rndhard_13.txt 68 ms 512 KB
02_rndhard_14.txt 106 ms 512 KB
02_rndhard_15.txt 106 ms 512 KB
02_rndhard_16.txt 32 ms 512 KB
02_rndhard_17.txt 33 ms 512 KB
02_rndhard_18.txt 30 ms 512 KB
02_rndhard_19.txt 30 ms 512 KB
02_rndhard_20.txt 49 ms 512 KB
02_rndhard_21.txt 49 ms 512 KB
02_rndhard_22.txt 80 ms 512 KB
02_rndhard_23.txt 83 ms 512 KB
02_rndhard_24.txt 40 ms 512 KB
02_rndhard_25.txt 40 ms 512 KB
02_rndhard_26.txt 41 ms 512 KB
02_rndhard_27.txt 26 ms 512 KB
02_rndhard_28.txt 39 ms 512 KB
02_rndhard_29.txt 39 ms 512 KB
02_rndhard_30.txt 17 ms 512 KB
02_rndhard_31.txt 17 ms 512 KB
02_rndhard_32.txt 89 ms 512 KB
02_rndhard_33.txt 79 ms 512 KB
02_rndhard_34.txt 45 ms 512 KB
02_rndhard_35.txt 45 ms 512 KB
02_rndhard_36.txt 36 ms 512 KB
02_rndhard_37.txt 36 ms 512 KB
02_rndhard_38.txt 37 ms 512 KB
02_rndhard_39.txt 37 ms 512 KB
03_rndhardsmall_00.txt 1 ms 256 KB
03_rndhardsmall_01.txt 1 ms 256 KB
03_rndhardsmall_02.txt 1 ms 256 KB
03_rndhardsmall_03.txt 1 ms 256 KB
03_rndhardsmall_04.txt 1 ms 256 KB
03_rndhardsmall_05.txt 1 ms 256 KB
03_rndhardsmall_06.txt 1 ms 256 KB
03_rndhardsmall_07.txt 1 ms 256 KB
03_rndhardsmall_08.txt 1 ms 256 KB
03_rndhardsmall_09.txt 1 ms 256 KB