AtCoder Typical Contest 001

Submission #7470831

Source codeソースコード

#include <iostream>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;

// 深さ優先探索
vector<bool> seen;
void dfs(const Graph &G, int v) {
    seen[v] = true; // v を訪問済にする

    // v から行ける各頂点 next_v について
    for (auto next_v : G[v]) { 
        if (seen[next_v]) continue; // next_v が探索済だったらスルー
        dfs(G, next_v); // 再帰的に探索
    }
}

int main() {
    // 頂点数と辺数、s と t
    int N, M, s, t; cin >> N >> M >> s >> t;

    // グラフ入力受取
    Graph G(N);
    for (int i = 0; i < M; ++i) {
        int a, b;
        cin >> a >> b;
        G[a].push_back(b);
    }

    // 頂点 s をスタートとした探索
    seen.assign(N, false); // 全頂点を「未訪問」に初期化
    dfs(G, s);

    // t に辿り着けるかどうか
    if (seen[t]) cout << "Yes" << endl;
    else cout << "No" << endl;
}

Submission

Task問題 A - 深さ優先探索
User nameユーザ名 anon565656
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 RE
Score得点 0
Source lengthソースコード長 969 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 RE
00_min_02.txt RE
00_min_03.txt RE
00_min_04.txt RE
00_min_05.txt RE
00_min_06.txt RE
00_min_07.txt RE
00_min_08.txt RE
00_sample_01.txt RE
00_sample_02.txt RE
00_sample_03.txt RE
00_sample_04.txt RE
00_sample_05.txt RE
01_rnd_00.txt RE
01_rnd_01.txt RE
01_rnd_02.txt RE
01_rnd_03.txt RE
01_rnd_04.txt RE
01_rnd_05.txt RE
01_rnd_06.txt RE
01_rnd_07.txt RE
01_rnd_08.txt RE
01_rnd_09.txt RE
01_rnd_10.txt RE
01_rnd_11.txt RE
01_rnd_12.txt RE
01_rnd_13.txt RE
01_rnd_14.txt RE
01_rnd_15.txt RE
01_rnd_16.txt RE
01_rnd_17.txt RE
01_rnd_18.txt RE
01_rnd_19.txt RE
02_rndhard_00.txt RE
02_rndhard_01.txt RE
02_rndhard_02.txt RE
02_rndhard_03.txt RE
02_rndhard_04.txt RE
02_rndhard_05.txt RE
02_rndhard_06.txt RE
02_rndhard_07.txt RE
02_rndhard_08.txt RE
02_rndhard_09.txt RE
02_rndhard_10.txt RE
02_rndhard_11.txt RE
02_rndhard_12.txt RE
02_rndhard_13.txt RE
02_rndhard_14.txt RE
02_rndhard_15.txt RE
02_rndhard_16.txt RE
02_rndhard_17.txt RE
02_rndhard_18.txt RE
02_rndhard_19.txt RE
02_rndhard_20.txt RE
02_rndhard_21.txt RE
02_rndhard_22.txt RE
02_rndhard_23.txt RE
02_rndhard_24.txt RE
02_rndhard_25.txt RE
02_rndhard_26.txt RE
02_rndhard_27.txt RE
02_rndhard_28.txt RE
02_rndhard_29.txt RE
02_rndhard_30.txt RE
02_rndhard_31.txt RE
02_rndhard_32.txt RE
02_rndhard_33.txt RE
02_rndhard_34.txt RE
02_rndhard_35.txt RE
02_rndhard_36.txt RE
02_rndhard_37.txt RE
02_rndhard_38.txt RE
02_rndhard_39.txt RE
03_rndhardsmall_00.txt RE
03_rndhardsmall_01.txt RE
03_rndhardsmall_02.txt RE
03_rndhardsmall_03.txt RE
03_rndhardsmall_04.txt RE
03_rndhardsmall_05.txt RE
03_rndhardsmall_06.txt RE
03_rndhardsmall_07.txt RE
03_rndhardsmall_08.txt RE
03_rndhardsmall_09.txt RE