AtCoder Typical Contest 001

Submission #7126377

Source codeソースコード

#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] == '#') 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";

}

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

Submission

Task問題 A - 深さ優先探索
User nameユーザ名 miuraKR
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 TLE
Score得点 0
Source lengthソースコード長 1643 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
Sample - 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_min_01.txt AC 1 ms 256 KB
00_min_02.txt AC 1 ms 256 KB
00_min_03.txt AC 1 ms 256 KB
00_min_04.txt AC 1 ms 256 KB
00_min_05.txt AC 1 ms 256 KB
00_min_06.txt AC 1 ms 256 KB
00_min_07.txt AC 1 ms 256 KB
00_min_08.txt AC 1 ms 256 KB
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
00_sample_05.txt AC 1 ms 256 KB
01_rnd_00.txt AC 2 ms 768 KB
01_rnd_01.txt TLE
01_rnd_02.txt TLE
01_rnd_03.txt MLE
01_rnd_04.txt TLE
01_rnd_05.txt AC 10 ms 768 KB
01_rnd_06.txt TLE
01_rnd_07.txt TLE
01_rnd_08.txt AC 2 ms 640 KB
01_rnd_09.txt AC 2 ms 768 KB
01_rnd_10.txt TLE
01_rnd_11.txt AC 2 ms 768 KB
01_rnd_12.txt TLE
01_rnd_13.txt TLE
01_rnd_14.txt AC 2 ms 768 KB
01_rnd_15.txt TLE
01_rnd_16.txt AC 2 ms 768 KB
01_rnd_17.txt TLE
01_rnd_18.txt AC 2 ms 768 KB
01_rnd_19.txt TLE
02_rndhard_00.txt TLE
02_rndhard_01.txt TLE
02_rndhard_02.txt TLE
02_rndhard_03.txt TLE
02_rndhard_04.txt TLE
02_rndhard_05.txt TLE
02_rndhard_06.txt TLE
02_rndhard_07.txt AC 357 ms 1076 KB
02_rndhard_08.txt TLE
02_rndhard_09.txt TLE
02_rndhard_10.txt TLE
02_rndhard_11.txt TLE
02_rndhard_12.txt TLE
02_rndhard_13.txt TLE
02_rndhard_14.txt TLE
02_rndhard_15.txt TLE
02_rndhard_16.txt TLE
02_rndhard_17.txt TLE
02_rndhard_18.txt TLE
02_rndhard_19.txt TLE
02_rndhard_20.txt TLE
02_rndhard_21.txt TLE
02_rndhard_22.txt TLE
02_rndhard_23.txt TLE
02_rndhard_24.txt TLE
02_rndhard_25.txt TLE
02_rndhard_26.txt TLE
02_rndhard_27.txt TLE
02_rndhard_28.txt TLE
02_rndhard_29.txt TLE
02_rndhard_30.txt AC 15 ms 892 KB
02_rndhard_31.txt AC 15 ms 892 KB
02_rndhard_32.txt TLE
02_rndhard_33.txt TLE
02_rndhard_34.txt TLE
02_rndhard_35.txt TLE
02_rndhard_36.txt TLE
02_rndhard_37.txt TLE
02_rndhard_38.txt TLE
02_rndhard_39.txt TLE
03_rndhardsmall_00.txt AC 1 ms 256 KB
03_rndhardsmall_01.txt AC 1 ms 256 KB
03_rndhardsmall_02.txt AC 1 ms 256 KB
03_rndhardsmall_03.txt AC 1 ms 256 KB
03_rndhardsmall_04.txt AC 1 ms 256 KB
03_rndhardsmall_05.txt AC 1 ms 256 KB
03_rndhardsmall_06.txt AC 1 ms 256 KB
03_rndhardsmall_07.txt AC 1 ms 256 KB
03_rndhardsmall_08.txt AC 1 ms 256 KB
03_rndhardsmall_09.txt AC 1 ms 256 KB