feat: kick-start 2022 round d

Author: upupming

kick-start/2022/RoundD/a.js

@@ -0,0 +1,23 @@
+let input = ''
+
+process.stdin.on('data', data => input += data)
+process.stdin.on('end', () => {
+  const lines = input.split('\n')
+  const [t] = lines[0].split(' ').map(Number)
+  for (let kase = 1; kase <= t; kase++) {
+    const [n, m] = lines[kase * 2 - 1].split(' ').map(Number)
+    const a = lines[kase * 2].split(' ').map(Number).sort((a, b) => b - a)
+    let sum = 0
+    a[-1] = 0
+    for (let i = -1; i < a.length; i++) {
+      sum += a[i]
+      if (i === m - 2) {
+        // [m-1, n-1]
+        // console.log(((n - m + 1) % 2) ? a[(m + n - 2) / 2] : ((a[(m + n - 2 - 1) / 2] + a[(m + n - 2 + 1) / 2]) / 2))
+        sum += ((n - m + 1) % 2) ? a[(m + n - 2) / 2] : ((a[(m + n - 2 - 1) / 2] + a[(m + n - 2 + 1) / 2]) / 2)
+        break
+      }
+    }
+    console.log(`Case #${kase}: ${sum}`)
+  }
+})

kick-start/2022/RoundD/b.js

@@ -0,0 +1,47 @@
+let input = ''
+
+process.stdin.on('data', data => input += data)
+process.stdin.on('end', () => {
+  const lines = input.split('\n')
+  const [t] = lines[0].split(' ').map(Number)
+  for (let kase = 0; kase < t; kase++) {
+    const [n] = lines[kase * 5 + 1].split(' ').map(Number)
+    const a = lines[kase * 5 + 2].split(' ').map(Number)
+    const [m] = lines[kase * 5 + 3].split(' ').map(Number)
+    const b = lines[kase * 5 + 4].split(' ').map(Number)
+    const [k] = lines[kase * 5 + 5].split(' ').map(Number)
+    // console.log(`Case #${kase + 1}`, n, a, m, b, k)
+    // f[i]: 从 a 里面选 i 个数的最大
+    const f = Array(n + 1).fill(0)
+    let sum = Array(n + 1).fill(0)
+    for (let i = 0; i < n; i++) sum[i + 1] = sum[i] + a[i]
+    for (let i = 0; i <= n; i++) {
+      // 从左侧选 j 个数
+      for (let j = 0; j <= i; j++) {
+        const k = i - j
+        // [0, j-1], [n-k, n-1]
+        f[i] = Math.max(f[i], sum[j] + sum[n] - sum[n - k])
+      }
+    }
+
+    const g = Array(m + 1).fill(0)
+    sum = Array(m + 1).fill(0)
+    for (let i = 0; i < m; i++) sum[i + 1] = sum[i] + b[i]
+    for (let i = 0; i <= m; i++) {
+      // 从左侧选 j 个数
+      for (let j = 0; j <= i; j++) {
+        const k = i - j
+        // [0, j-1], [n-k, n-1]
+        g[i] = Math.max(g[i], sum[j] + sum[m] - sum[m - k])
+      }
+    }
+
+    let ans = 0
+    for (let i = 0; i <= Math.min(k, n); i++) {
+      if (k - i < 0 || k - i > m) continue
+      ans = Math.max(ans, f[i] + g[k - i])
+    }
+
+    console.log(`Case #${kase + 1}: ${ans}`)
+  }
+})

kick-start/2022/RoundD/c.js

@@ -0,0 +1,36 @@
+let input = ''
+
+process.stdin.on('data', data => input += data)
+process.stdin.on('end', () => {
+  const lines = input.split('\n')
+  const [t] = lines[0].split(' ').map(Number)
+  for (let kase = 0; kase < t; kase++) {
+    const [n] = lines[kase * 4 + 1].split(' ').map(Number)
+    const s = lines[kase * 4 + 2].split(' ').map(Number)
+    const [m] = lines[kase * 4 + 3].split(' ').map(Number)
+    const k = lines[kase * 4 + 4].split(' ').map(Number)
+
+    const pos = Array(3000).fill(0).map(() => [])
+    for (let i = 0; i < m; i++) {
+      pos[k[i]].push(i)
+    }
+
+    const solve = (i) => {
+      if (i === n - 1) return pos[s[i]].map((p) => [p, 0])
+      const ans = []
+      const last = solve(i + 1)
+      for (const p of pos[s[i]]) {
+        let cost = 1e10
+        for (const [lp, lc] of last) {
+          cost = Math.min(cost, lc + Math.abs(p - lp))
+        }
+        ans.push([p, cost])
+      }
+      ans.sort((a, b) => a[1] - b[1])
+      while (ans[ans.length - 1][1] - ans[0][1] >= m) ans.pop()
+      return ans
+    }
+
+    console.log(`Case #${kase + 1}: ${solve(0).reduce((p, c) => Math.min(p, c[1]), 1e10)}`)
+  }
+})

kick-start/2022/RoundD/d-case-1.js

@@ -0,0 +1,37 @@
+let input = ''
+
+process.stdin.on('data', data => input += data)
+process.stdin.on('end', () => {
+  const lines = input.split('\n')
+  let loc = 0
+  const [t] = lines[loc++].split(' ').map(Number)
+  for (let kase = 0; kase < t; kase++) {
+    const [n, m, k] = lines[loc++].split(' ').map(Number)
+    const e = Array(n + 1).fill(0).map(() => [])
+    const er = Array(n + 1).fill(0).map(() => [])
+    for (let i = loc; i < loc + m; i++) {
+      // console.log(i, lines[i])
+      let [a, b] = lines[i].split(' ').map(Number)
+      a--, b--
+      // console.log(a, b)
+      e[a].push(b)
+      er[b].push(a)
+    }
+    loc += m
+
+    const f = Array(n).fill(1)
+    for (let i = 0; i < n; i++) {
+      // 第 i 个人是 not innocent 的
+      let ok = true
+
+      if (er[i].length > 0) ok = false
+
+      if (ok) {
+        f[i] = 0
+      }
+    }
+
+    // console.log(f)
+    console.log(`Case #${kase + 1}: ${f.reduce((p, c) => p + c, 0)}`)
+  }
+})

kick-start/2022/RoundD/d.js

@@ -0,0 +1,56 @@
+let input = ''
+
+process.stdin.on('data', data => input += data)
+process.stdin.on('end', () => {
+  const lines = input.split('\n')
+  let loc = 0
+  const [t] = lines[loc++].split(' ').map(Number)
+  for (let kase = 0; kase < t; kase++) {
+    const [n, m, k] = lines[loc++].split(' ').map(Number)
+    const e = Array(n + 1).fill(0).map(() => [])
+    for (let i = loc; i < loc + m; i++) {
+      let [a, b] = lines[i].split(' ').map(Number)
+      a--, b--
+      // console.log(a, b)
+      e[a].push(b)
+    }
+    loc += m
+
+    const f = Array(n).fill(1)
+    for (let i = 0; i < 1 << n; i++) {
+      let ok = true
+
+      let cnt = 0
+      for (let j = 0; j < n; j++) {
+        if (!((i >> k) & 1)) cnt++
+      }
+      if (cnt > k) continue
+
+      for (let j = 0; j < n; j++) {
+        // j is innocent
+        if ((i >> j) & 1) {
+          for (const k of e[j]) {
+            // k is not innocent
+            if (!((i >> k) & 1)) {
+              ok = false
+              break
+            }
+          }
+        }
+        if (!ok) break
+      }
+
+      if (ok) {
+        for (let j = 0; j < n; j++) {
+          // not innocent
+          if (!((i >> j) & 1)) {
+            f[j] = 0
+          }
+        }
+      }
+    }
+
+    // console.log(f)
+    console.log(`Case #${kase + 1}: ${f.reduce((p, c) => p + c, 0)}`)
+  }
+})