提出 #47185709

---

ソースコード 拡げる

#![allow(unused_imports)]

const MAX: usize = 1_000_000;

fn dfs(graph: &[Vec<usize>], seen: &mut [bool], now: usize, mut cnt: usize) -> Option<usize> {
    cnt += 1;
    if cnt == MAX {
        return None;
    }
    seen[now] = true;
    for &next in &graph[now] {
        if !seen[next] {
            cnt = dfs(graph, seen, next, cnt)?;
        }
    }
    seen[now] = false;
    Some(cnt)
}

fn main() {
    input! {
        n: usize, m: usize,
    }
    let mut graph = vec![vec![]; n];
    for _ in 0..m {
        input! {
            u: Usize1, v: Usize1,
        }
        graph[u].push(v);
        graph[v].push(u);
    }
    let ans = dfs(&graph, &mut vec![false; n], 0, 0).unwrap_or(MAX);
    println!("{ans}");
}

use proconio::{input, marker::*};

提出情報

ジャッジ結果