Submission #7126295


Source Code Expand

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;

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

    c[h][w] = '#'; // 往路の記録
    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] == '#'|| 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";

}

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

Submission Info

Submission Time
Task A - 深さ優先探索
User miuraKR
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1621 Byte
Status
Exec Time 2121 ms
Memory 632896 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 0 / 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 2 ms 768 KB
01_rnd_01.txt 2111 ms 130560 KB
01_rnd_02.txt 2103 ms 1840 KB
01_rnd_03.txt 1405 ms 632896 KB
01_rnd_04.txt 2107 ms 62336 KB
01_rnd_05.txt 10 ms 768 KB
01_rnd_06.txt 2104 ms 12408 KB
01_rnd_07.txt 2104 ms 6240 KB
01_rnd_08.txt 2 ms 640 KB
01_rnd_09.txt 2 ms 768 KB
01_rnd_10.txt 2103 ms 1464 KB
01_rnd_11.txt 2 ms 768 KB
01_rnd_12.txt 2103 ms 17036 KB
01_rnd_13.txt 2104 ms 9944 KB
01_rnd_14.txt 2 ms 768 KB
01_rnd_15.txt 2103 ms 2656 KB
01_rnd_16.txt 2 ms 768 KB
01_rnd_17.txt 2103 ms 3580 KB
01_rnd_18.txt 2 ms 768 KB
01_rnd_19.txt 2121 ms 290684 KB
02_rndhard_00.txt 2103 ms 1948 KB
02_rndhard_01.txt 2103 ms 1948 KB
02_rndhard_02.txt 2107 ms 1992 KB
02_rndhard_03.txt 2103 ms 1992 KB
02_rndhard_04.txt 2103 ms 1072 KB
02_rndhard_05.txt 2103 ms 1072 KB
02_rndhard_06.txt 2103 ms 1804 KB
02_rndhard_07.txt 359 ms 1076 KB
02_rndhard_08.txt 2103 ms 1368 KB
02_rndhard_09.txt 2103 ms 1368 KB
02_rndhard_10.txt 2103 ms 3696 KB
02_rndhard_11.txt 2103 ms 3696 KB
02_rndhard_12.txt 2103 ms 1776 KB
02_rndhard_13.txt 2103 ms 1784 KB
02_rndhard_14.txt 2103 ms 1164 KB
02_rndhard_15.txt 2103 ms 1164 KB
02_rndhard_16.txt 2103 ms 984 KB
02_rndhard_17.txt 2103 ms 984 KB
02_rndhard_18.txt 2103 ms 1440 KB
02_rndhard_19.txt 2103 ms 1440 KB
02_rndhard_20.txt 2103 ms 2392 KB
02_rndhard_21.txt 2103 ms 2392 KB
02_rndhard_22.txt 2103 ms 1516 KB
02_rndhard_23.txt 2103 ms 1516 KB
02_rndhard_24.txt 2103 ms 1716 KB
02_rndhard_25.txt 2103 ms 1716 KB
02_rndhard_26.txt 2103 ms 1008 KB
02_rndhard_27.txt 2103 ms 1008 KB
02_rndhard_28.txt 2103 ms 1472 KB
02_rndhard_29.txt 2103 ms 1472 KB
02_rndhard_30.txt 15 ms 892 KB
02_rndhard_31.txt 15 ms 892 KB
02_rndhard_32.txt 2103 ms 1440 KB
02_rndhard_33.txt 2103 ms 1440 KB
02_rndhard_34.txt 2103 ms 1248 KB
02_rndhard_35.txt 2103 ms 1248 KB
02_rndhard_36.txt 2103 ms 1612 KB
02_rndhard_37.txt 2103 ms 1612 KB
02_rndhard_38.txt 2103 ms 1748 KB
02_rndhard_39.txt 2103 ms 1624 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