From dd26b7b2753bbde2e826b6d60ba50cc5809061ed Mon Sep 17 00:00:00 2001
From: bouzuya <m@bouzuya.net>
Date: Tue, 29 Nov 2022 18:56:00 +0900
Subject: [PATCH] tessoku-book a62-b62

---
 tessoku-book/src/bin/a62.rs | 135 +++++++++++++++++++++++++++++++++++-
 tessoku-book/src/bin/b62.rs |  49 ++++++++++++-
 2 files changed, 178 insertions(+), 6 deletions(-)

diff --git a/tessoku-book/src/bin/a62.rs b/tessoku-book/src/bin/a62.rs
index 2a9506c8..e4e925af 100644
--- a/tessoku-book/src/bin/a62.rs
+++ b/tessoku-book/src/bin/a62.rs
@@ -1,10 +1,139 @@
+// use dsu::*;
 use proconio::{input, marker::Usize1};
 
+fn dfs(used: &mut Vec<bool>, edges: &[Vec<usize>], u: usize, p: usize) {
+    if used[u] {
+        return;
+    }
+
+    used[u] = true;
+    for v in edges[u].iter().copied() {
+        if v == p {
+            continue;
+        }
+        dfs(used, edges, v, u);
+    }
+}
+
 fn main() {
     input! {
         n: usize,
-        a: [Usize1; n],
+        m: usize,
+        ab: [(Usize1, Usize1); m],
     };
-    let ans = n - a.len();
-    println!("{}", ans);
+
+    // let mut dsu = Dsu::new(n);
+    // for (a, b) in ab {
+    //     dsu.merge(a, b);
+    // }
+    // let ans = dsu.groups().len() == 1;
+
+    let mut edges = vec![vec![]; n];
+    for (a, b) in ab {
+        edges[a].push(b);
+        edges[b].push(a);
+    }
+
+    let mut used = vec![false; n];
+    dfs(&mut used, &edges, 0, 0);
+
+    let ans = used.into_iter().all(|b| b);
+    println!(
+        "The graph is {}.",
+        if ans { "connected" } else { "not connected" }
+    );
 }
+
+// //https://github.com/rust-lang-ja/ac-library-rs
+
+// pub mod dsu {
+//     /// Implement (union by size) + (path compression)
+//     /// Reference:
+//     /// Zvi Galil and Giuseppe F. Italiano,
+//     /// Data structures and algorithms for disjoint set union problems
+//     pub struct Dsu {
+//         n: usize,
+//         // root node: -1 * component size
+//         // otherwise: parent
+//         parent_or_size: Vec<i32>,
+//     }
+
+//     impl Dsu {
+//         // 0 <= size <= 10^8 is constrained.
+//         pub fn new(size: usize) -> Self {
+//             Self {
+//                 n: size,
+//                 parent_or_size: vec![-1; size],
+//             }
+//         }
+//         pub fn merge(&mut self, a: usize, b: usize) -> usize {
+//             assert!(a < self.n);
+//             assert!(b < self.n);
+//             let (mut x, mut y) = (self.leader(a), self.leader(b));
+//             if x == y {
+//                 return x;
+//             }
+//             if -self.parent_or_size[x] < -self.parent_or_size[y] {
+//                 std::mem::swap(&mut x, &mut y);
+//             }
+//             self.parent_or_size[x] += self.parent_or_size[y];
+//             self.parent_or_size[y] = x as i32;
+//             x
+//         }
+
+//         pub fn same(&mut self, a: usize, b: usize) -> bool {
+//             assert!(a < self.n);
+//             assert!(b < self.n);
+//             self.leader(a) == self.leader(b)
+//         }
+//         pub fn leader(&mut self, a: usize) -> usize {
+//             assert!(a < self.n);
+//             if self.parent_or_size[a] < 0 {
+//                 return a;
+//             }
+//             self.parent_or_size[a] = self.leader(self.parent_or_size[a] as usize) as i32;
+//             self.parent_or_size[a] as usize
+//         }
+//         pub fn size(&mut self, a: usize) -> usize {
+//             assert!(a < self.n);
+//             let x = self.leader(a);
+//             -self.parent_or_size[x] as usize
+//         }
+//         pub fn groups(&mut self) -> Vec<Vec<usize>> {
+//             let mut leader_buf = vec![0; self.n];
+//             let mut group_size = vec![0; self.n];
+//             for i in 0..self.n {
+//                 leader_buf[i] = self.leader(i);
+//                 group_size[leader_buf[i]] += 1;
+//             }
+//             let mut result = vec![Vec::new(); self.n];
+//             for i in 0..self.n {
+//                 result[i].reserve(group_size[i]);
+//             }
+//             for i in 0..self.n {
+//                 result[leader_buf[i]].push(i);
+//             }
+//             result
+//                 .into_iter()
+//                 .filter(|x| !x.is_empty())
+//                 .collect::<Vec<Vec<usize>>>()
+//         }
+//     }
+
+//     #[cfg(test)]
+//     mod tests {
+//         use super::*;
+
+//         #[test]
+//         fn dsu_works() {
+//             let mut d = Dsu::new(4);
+//             d.merge(0, 1);
+//             assert_eq!(d.same(0, 1), true);
+//             d.merge(1, 2);
+//             assert_eq!(d.same(0, 2), true);
+//             assert_eq!(d.size(0), 3);
+//             assert_eq!(d.same(0, 3), false);
+//             assert_eq!(d.groups(), vec![vec![0, 1, 2], vec![3]]);
+//         }
+//     }
+// }
diff --git a/tessoku-book/src/bin/b62.rs b/tessoku-book/src/bin/b62.rs
index 2a9506c8..7d8cfff0 100644
--- a/tessoku-book/src/bin/b62.rs
+++ b/tessoku-book/src/bin/b62.rs
@@ -1,10 +1,53 @@
 use proconio::{input, marker::Usize1};
 
+fn dfs(
+    used: &mut Vec<bool>,
+    route: &mut Vec<usize>,
+    edges: &[Vec<usize>],
+    u: usize,
+    p: usize,
+) -> bool {
+    if u == edges.len() - 1 {
+        return true;
+    }
+    if used[u] {
+        return false;
+    }
+    used[u] = true;
+
+    for v in edges[u].iter().copied() {
+        if v == p {
+            continue;
+        }
+        if dfs(used, route, edges, v, u) {
+            route.push(v);
+            return true;
+        }
+    }
+
+    false
+}
+
 fn main() {
     input! {
         n: usize,
-        a: [Usize1; n],
+        m: usize,
+        ab: [(Usize1, Usize1); m],
     };
-    let ans = n - a.len();
-    println!("{}", ans);
+
+    let mut edges = vec![vec![]; n];
+    for (a, b) in ab {
+        edges[a].push(b);
+        edges[b].push(a);
+    }
+
+    let mut used = vec![false; n];
+    let mut route = vec![];
+    if dfs(&mut used, &mut route, &edges, 0, 0) {
+        route.push(0);
+    }
+
+    for a in route.into_iter().rev() {
+        println!("{}", a + 1);
+    }
 }