pastbook2 typical_algorithm_c

cargo-compete/pastbook2/Cargo.toml

@@ -16,6 +16,7 @@ edition = "2018"
 085 = { alias = "pastbook2022_b", problem = "https://atcoder.jp/contests/pastbook2022/tasks/pastbook2022_b" }
 090 = { alias = "dp_n", problem = "https://atcoder.jp/contests/dp/tasks/dp_n" }
 094 = { alias = "tdpc_iwi", problem = "https://atcoder.jp/contests/tdpc/tasks/tdpc_iwi" }
+098 = { alias = "typical_algorithm_c", problem = "https://atcoder.jp/contests/typical-algorithm/tasks/typical_algorithm_c" }
 
 [[bin]]
 name = "027"

cargo-compete/pastbook2/README.md

@@ -12,3 +12,4 @@
 - P.85 編集距離 (オリジナル問題) <https://atcoder.jp/contests/pastbook2022/tasks/pastbook2022_b>
 - P.90 Slimes (Educational DP Contest:N問題) <https://atcoder.jp/contests/dp/tasks/dp_n>
 - P.94 イウィ (Typical DP Contest:I 問題) <https://atcoder.jp/contests/tdpc/tasks/tdpc_iwi>
+- P.98 巡回セールスマン問題 (典型アルゴリズム問題集 C問題) <https://atcoder.jp/contests/typical-algorithm/tasks/typical_algorithm_c>

cargo-compete/pastbook2/src/bin/098.rs

@@ -0,0 +1,34 @@
+use std::collections::VecDeque;
+
+use proconio::input;
+
+fn main() {
+    input! {
+        n: usize,
+        a: [[usize; n]; n],
+    }
+    let inf = 1_usize << 60;
+    let mut dp = vec![vec![inf; n]; 1 << n];
+    dp[1 << 0][0] = 0_usize;
+    let mut deque = VecDeque::new();
+    deque.push_back((1 << 0, 0_usize));
+    while let Some((set, u)) = deque.pop_front() {
+        for v in 0..n {
+            if (set & (1 << v)) != 0 {
+                continue;
+            }
+            let new_set = set | (1 << v);
+            let new_cost = dp[set][u] + a[u][v];
+            if new_cost < dp[new_set][v] {
+                dp[new_set][v] = new_cost;
+                deque.push_back((new_set, v));
+            }
+        }
+    }
+    let mut min = inf;
+    for u in 1..n {
+        min = min.min(dp[(1 << n) - 1][u] + a[u][0]);
+    }
+    let ans = min;
+    println!("{}", ans);
+}