提出 #7141057


ソースコード 拡げる

Copy
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;

template<typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b%a, a);
}

template<typename T>
T lcm(T a, T b) {
  return (a*b)/gcd(b%a, a);
}

bool seen[505][505];

bool dfs(const vector<string>& c, int i, int j, int w, int h) {
  if (c[i][j] == '#') return false;
  if (c[i][j] == 'g') return true;
  seen[i][j] = true;
  bool result = false;
  pair<int, int> dest[4] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
  for (auto& d : dest) {
    int n_i = i + d.first;
    int n_j = j + d.second;
    if (n_i < 0 || h <= n_i) continue;
    if (n_j < 0 || w <= n_j) continue;
    if (seen[n_i][n_j]) continue;
    result = result || dfs(c, n_i, n_j, w, h);
  }
  return result; 
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << setprecision(20);
  int h, w;
  cin >> h >> w;
  vector<string> c(h);
  rep(i, h) {
    cin >> c[i];
  }
  int start_i, start_j;
  vector<vector<bool>> graph(h);
  rep(i, h) {
    rep(j, w) {
      if (c[i][j] == 's') {
        start_i = i;
        start_j = j;
        continue;  
      }
    }
  }

  bool ok = dfs(c, start_i, start_j, w, h);
  if (ok) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}

提出情報

提出日時
問題 A - 深さ優先探索
ユーザ i_ken
言語 C++14 (GCC 5.4.1)
得点 100
コード長 1446 Byte
結果
実行時間 12 ms
メモリ 13568 KB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 100 / 100
結果
× 5
× 83
セット名 テストケース
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
ケース名 結果 実行時間 メモリ
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 2 ms 512 KB
01_rnd_01.txt 10 ms 11904 KB
01_rnd_02.txt 10 ms 6144 KB
01_rnd_03.txt 11 ms 13568 KB
01_rnd_04.txt 10 ms 10624 KB
01_rnd_05.txt 2 ms 512 KB
01_rnd_06.txt 8 ms 4864 KB
01_rnd_07.txt 8 ms 5760 KB
01_rnd_08.txt 2 ms 512 KB
01_rnd_09.txt 2 ms 512 KB
01_rnd_10.txt 7 ms 1792 KB
01_rnd_11.txt 2 ms 512 KB
01_rnd_12.txt 12 ms 11904 KB
01_rnd_13.txt 9 ms 8320 KB
01_rnd_14.txt 2 ms 512 KB
01_rnd_15.txt 9 ms 3584 KB
01_rnd_16.txt 2 ms 512 KB
01_rnd_17.txt 9 ms 2816 KB
01_rnd_18.txt 2 ms 512 KB
01_rnd_19.txt 3 ms 1408 KB
02_rndhard_00.txt 2 ms 640 KB
02_rndhard_01.txt 2 ms 640 KB
02_rndhard_02.txt 3 ms 896 KB
02_rndhard_03.txt 3 ms 896 KB
02_rndhard_04.txt 2 ms 512 KB
02_rndhard_05.txt 2 ms 512 KB
02_rndhard_06.txt 2 ms 640 KB
02_rndhard_07.txt 2 ms 512 KB
02_rndhard_08.txt 2 ms 768 KB
02_rndhard_09.txt 2 ms 768 KB
02_rndhard_10.txt 2 ms 768 KB
02_rndhard_11.txt 2 ms 768 KB
02_rndhard_12.txt 2 ms 640 KB
02_rndhard_13.txt 2 ms 640 KB
02_rndhard_14.txt 2 ms 768 KB
02_rndhard_15.txt 2 ms 768 KB
02_rndhard_16.txt 2 ms 640 KB
02_rndhard_17.txt 2 ms 640 KB
02_rndhard_18.txt 2 ms 640 KB
02_rndhard_19.txt 2 ms 640 KB
02_rndhard_20.txt 2 ms 640 KB
02_rndhard_21.txt 2 ms 640 KB
02_rndhard_22.txt 2 ms 640 KB
02_rndhard_23.txt 2 ms 640 KB
02_rndhard_24.txt 2 ms 640 KB
02_rndhard_25.txt 2 ms 640 KB
02_rndhard_26.txt 2 ms 640 KB
02_rndhard_27.txt 2 ms 512 KB
02_rndhard_28.txt 2 ms 640 KB
02_rndhard_29.txt 2 ms 640 KB
02_rndhard_30.txt 2 ms 512 KB
02_rndhard_31.txt 2 ms 512 KB
02_rndhard_32.txt 2 ms 640 KB
02_rndhard_33.txt 2 ms 640 KB
02_rndhard_34.txt 2 ms 640 KB
02_rndhard_35.txt 2 ms 640 KB
02_rndhard_36.txt 2 ms 640 KB
02_rndhard_37.txt 2 ms 640 KB
02_rndhard_38.txt 2 ms 640 KB
02_rndhard_39.txt 2 ms 640 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