feat: problems for the next week

Author: upupming

leetcode/残酷刷题/1617. Count Subtrees With Max Distance Between Cities.js

@@ -0,0 +1,50 @@
+/**
+ * @param {number} n
+ * @param {number[][]} edges
+ * @return {number[]}
+ */
+const countSubgraphsForEachDiameter = function (n, edges) {
+  const e = Array(n).fill(0).map(() => [])
+  for (const [x, y] of edges) e[x - 1].push(y - 1), e[y - 1].push(x - 1)
+  const bfs = (st, x) => {
+    const d = Array(n).fill(1e10)
+    const q = [x]
+    d[x] = 0
+    let maxID = x
+    while (q.length) {
+      const cur = q.shift()
+      for (const y of e[cur]) {
+        if ((st >> y & 1) && d[y] > d[cur] + 1) {
+          d[y] = d[cur] + 1
+          q.push(y)
+          maxID = y
+        }
+      }
+    }
+    return {
+      maxID,
+      d
+    }
+  }
+  const ans = Array(n - 1).fill(0)
+  for (let i = 1; i < 1 << n; i++) {
+    let m = 0; let x
+    for (let j = 0; j < n; j++) {
+      if (i >> j & 1) m++, x = j
+    }
+    const { maxID: s, d } = bfs(i, x)
+    let reached = 0
+    for (let i = 0; i < n; i++) if (d[i] < 1e10) reached++
+    if (reached < m) continue
+    const { d: d1 } = bfs(i, s)
+    let max = 0
+    for (let j = 0; j < n; j++) {
+      if (i >> j & 1) {
+        max = Math.max(max, d1[j])
+      }
+    }
+    // console.log(i.toString(2), s, d1)
+    ans[max - 1]++
+  }
+  return ans
+}

leetcode/残酷刷题/1654. Minimum Jumps to Reach Home.js

@@ -0,0 +1,24 @@
+/**
+ * @param {number[]} forbidden
+ * @param {number} a
+ * @param {number} b
+ * @param {number} x
+ * @return {number}
+ */
+const minimumJumps = function (forbidden, a, b, x) {
+  const q = [[0, 0, 0]]; const limit = Math.max(...forbidden, x) + b
+  const s = new Set(forbidden); const v = {}
+  while (q.length) {
+    const [p, d, lastDir] = q.shift()
+    if (v[`${p}_${lastDir}`]) continue
+    v[`${p}_${lastDir}`] = 1
+    if (p === x) return d
+    if ((p <= limit || s.has(p - b)) && !s.has(p + a)) {
+      q.push([p + a, d + 1, 1])
+    }
+    if (p - b >= 0 && lastDir !== -1 && !s.has(p - b)) {
+      q.push([p - b, d + 1, -1])
+    }
+  }
+  return -1
+}

leetcode/残酷刷题/2101. Detonate the Maximum Bombs.js

@@ -0,0 +1,32 @@
+/**
+ * @param {number[][]} bombs
+ * @return {number}
+ */
+ var maximumDetonation = function(bs) {
+  const n = bs.length
+  const e = Array(n).fill(0).map(() => [])
+  for (let i = 0; i < n; i++) {
+      for (let j = 0; j < n; j++) {
+          // i 可以引爆 j
+          if ((bs[i][0] - bs[j][0])**2 + (bs[i][1] - bs[j][1])**2 <= bs[i][2] ** 2) {
+              e[i].push(j)
+          }
+      }
+  }
+  let ans = 0
+  for (let i = 0; i < n; i++) {
+      const v = Array(n).fill(0)
+      v[i] = 1
+      const q = [i]
+      while (q.length) {
+          const cur = q.shift()
+          for (const y of e[cur]) {
+              if (v[y]) continue
+              v[y] = 1
+              q.push(y)
+          }
+      }
+      ans = Math.max(ans, v.reduce((p, c) => p+c, 0))
+  }
+  return ans
+};

leetcode/残酷刷题/README.md

@@ -200,6 +200,9 @@
 - 1263. Minimum Moves to Move a Box to Their Target Location
     - Deque, 只有 0 和 1 两个边权
 - 2258. Escape the Spreading Fire
+- 2101. Detonate the Maximum Bombs
+- 1654. Minimum Jumps to Reach Home
+- 1617. Count Subtrees With Max Distance Between Cities
 
 #### 拓扑排序