https://leetcode.cn/problems/reachable-nodes-in-subdivided-graph

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/reachable-nodes-in-subdivided-graph
+
 https://leetcode.cn/problems/check-if-array-is-sorted-and-rotated
 
 https://leetcode.cn/problems/number-of-subarrays-with-bounded-maximum

deno.lock

@@ -0,0 +1,47 @@
+export default function reachableNodes(
+    edges: number[][],
+    maxMoves: number,
+    n: number,
+): number {
+    const adList: [number, number][][] = Array(n)
+        .fill(0)
+        .map(() => []);
+
+    for (const [u, v, c] of edges) {
+        adList[u].push([v, c]);
+        adList[v].push([u, c]);
+    }
+
+    const used = new Map<string, number>();
+    const visited: boolean[] = Array(n).fill(false);
+    let reachableNodes = 0;
+
+    const pq = new BinaryHeap<[number, number]>((a, b) => a[0] - b[0]);
+    pq.push([0, 0]);
+
+    while (!pq.isEmpty() && (pq.peek() as [number, number])[0] <= maxMoves) {
+        const [step, u] = pq.pop() as [number, number];
+        if (visited[u]) {
+            continue;
+        }
+        visited[u] = true;
+        reachableNodes++;
+
+        for (const [v, c] of adList[u]) {
+            if (c + step + 1 <= maxMoves && !visited[v]) {
+                pq.push([c + step + 1, v]);
+            }
+            used.set(JSON.stringify([u, v]), Math.min(c, maxMoves - step));
+        }
+    }
+
+    for (const [u, v, c] of edges) {
+        reachableNodes += Math.min(
+            c,
+            (used.get(JSON.stringify([u, v])) ?? 0) +
+                (used.get(JSON.stringify([v, u])) ?? 0),
+        );
+    }
+    return reachableNodes;
+}
+import { BinaryHeap } from "https://deno.land/std@0.166.0/collections/binary_heap.ts";