提出 #7126458


ソースコード 拡げる

Copy
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int i=(a); i<(b); ++i) // a ≦ i < b 
#define Rrep(i,a,b) for(int i=(a);i>=(b);--i) // reverse repeat. a から b まで減少.
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#define RANGE(a,b,c) (a).begin()+b,(a).begin()+c // コンテナ a の 要素 b から c へのイテレータ
#define MOD 1000000007
// typedef
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
// グリッドグラフの移動ベクトル
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

bool ok = false;
vector<vector<bool>> seen(510, vector<bool>(510, false));

void goaldfs(VS &c, int h, int w){  
    if (c[h][w] == 'g') {
        ok = true;
        return;
    }

    seen[h][w] = true; // 往路の記録
    int chlen = c.size(), cwlen  = c[0].size();
    rep(i, 0, 4) {
        int nh = h +  dy[i], nw = w + dx[i];
        if (nh == chlen ||  nh == -1 ||  nw == -1 || nw == cwlen) continue;
        if (c[nh][nw] == '#') continue;
        if (seen[nh][nw]) continue;
        if (ok) continue;
        goaldfs(c, nh, nw);
        // c[h][w] = '#'; // 帰路の記録
    }
}

int main() {
cin.tie(0);
ios::sync_with_stdio(false);

int H, W; cin >> H >> W;
VS c(H); rep(i,0,H) cin >> c[i];

// 家の検索
rep(i,0,H) {
    rep(j,0,W){
        if (c[i][j] == 's') {
            goaldfs(c, i, j);
            break;
        }
    }
}

if (ok) cout << "Yes" << "\n";
else cout << "No" << "\n";

}

// 境界,出力文字列 チェック

提出情報

提出日時
問題 A - 深さ優先探索
ユーザ miuraKR
言語 C++14 (GCC 5.4.1)
得点 100
コード長 1742 Byte
結果
実行時間 20 ms
メモリ 26624 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 384 KB
00_min_04.txt 1 ms 256 KB
00_min_05.txt 1 ms 384 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 384 KB
00_sample_03.txt 1 ms 384 KB
00_sample_04.txt 1 ms 384 KB
00_sample_05.txt 1 ms 256 KB
01_rnd_00.txt 2 ms 640 KB
01_rnd_01.txt 6 ms 6656 KB
01_rnd_02.txt 7 ms 5888 KB
01_rnd_03.txt 12 ms 16128 KB
01_rnd_04.txt 16 ms 21376 KB
01_rnd_05.txt 2 ms 640 KB
01_rnd_06.txt 11 ms 6784 KB
01_rnd_07.txt 4 ms 2944 KB
01_rnd_08.txt 2 ms 640 KB
01_rnd_09.txt 2 ms 640 KB
01_rnd_10.txt 7 ms 1792 KB
01_rnd_11.txt 2 ms 640 KB
01_rnd_12.txt 5 ms 5248 KB
01_rnd_13.txt 12 ms 13312 KB
01_rnd_14.txt 2 ms 640 KB
01_rnd_15.txt 8 ms 4352 KB
01_rnd_16.txt 2 ms 640 KB
01_rnd_17.txt 8 ms 3328 KB
01_rnd_18.txt 2 ms 640 KB
01_rnd_19.txt 20 ms 26624 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 640 KB
02_rndhard_05.txt 2 ms 640 KB
02_rndhard_06.txt 2 ms 640 KB
02_rndhard_07.txt 2 ms 640 KB
02_rndhard_08.txt 2 ms 640 KB
02_rndhard_09.txt 2 ms 640 KB
02_rndhard_10.txt 2 ms 640 KB
02_rndhard_11.txt 2 ms 640 KB
02_rndhard_12.txt 2 ms 640 KB
02_rndhard_13.txt 2 ms 640 KB
02_rndhard_14.txt 2 ms 640 KB
02_rndhard_15.txt 2 ms 640 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 640 KB
02_rndhard_28.txt 2 ms 640 KB
02_rndhard_29.txt 2 ms 640 KB
02_rndhard_30.txt 2 ms 640 KB
02_rndhard_31.txt 2 ms 640 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 384 KB
03_rndhardsmall_01.txt 1 ms 384 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 384 KB
03_rndhardsmall_06.txt 1 ms 256 KB
03_rndhardsmall_07.txt 1 ms 256 KB
03_rndhardsmall_08.txt 1 ms 384 KB
03_rndhardsmall_09.txt 1 ms 256 KB