feat: kick-start 2022 round b

Author: upupming

kick-start/2022/RoundB/a.js

@@ -0,0 +1,18 @@
+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++) {
+    let [r, a, b] = lines[kase].split(' ').map(Number)
+    let ans = 0; let f = 1
+    while (r) {
+      ans += Math.PI * r * r
+      if (f) r = Math.floor(r * a)
+      else r = Math.floor(r / b)
+      f = !f
+    }
+    console.log(`Case #${kase}: ${ans}`)
+  }
+})

kick-start/2022/RoundB/b-naive.cpp

@@ -0,0 +1,33 @@
+#include <algorithm>
+#include <cmath>
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+typedef long long LL;
+int t;
+LL a;
+string s;
+#define N 3000000
+LL b[N];
+int n;
+
+int solve() {
+    int ans = 0;
+    for (LL b = 1; b <= a; b++) {
+        auto s = to_string(b);
+        auto t = to_string(b);
+        reverse(t.begin(), t.end());
+        if (s == t && (a % b == 0)) ans++;
+    }
+    return ans;
+}
+
+int main() {
+    cin >> t;
+    for (int i = 1; i <= t; i++) {
+        cin >> a;
+        printf("Case #%d: %d\n", i, solve());
+    }
+    return 0;
+}

kick-start/2022/RoundB/b.cpp

@@ -0,0 +1,45 @@
+#include <algorithm>
+#include <cmath>
+#include <iostream>
+using namespace std;
+
+typedef long long LL;
+int t;
+LL a;
+string s;
+#define N 3000000
+LL b[N];
+int n;
+
+int solve() {
+    int ans = 0;
+    for (int i = 0; i < n; i++) {
+        if (a % b[i] == 0) ans++;
+        if (b[i] >= a) break;
+    }
+    return ans;
+}
+
+int main() {
+    cin >> t;
+    for (LL x = 1;; x++) {
+        auto s = to_string(x), t = to_string(x);
+        reverse(t.begin(), t.end());
+        LL y = atoll((s + t).c_str());
+        b[n++] = y;
+        for (int i = 0; i <= 9; i++) {
+            LL y = atoll((s + to_string(i) + t).c_str());
+            b[n++] = y;
+        }
+        if (x <= 9) {
+            b[n++] = x;
+        }
+        if (y >= 2e10) break;
+    }
+    sort(b, b + n);
+    for (int i = 1; i <= t; i++) {
+        cin >> a;
+        printf("Case #%d: %d\n", i, solve());
+    }
+    return 0;
+}

kick-start/2022/RoundB/b.js

@@ -0,0 +1,21 @@
+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 a = BigInt(lines[kase])
+    let ans = 0
+    for (let x = Number(1); x <= Number(1e5 - 1); x++) {
+      if (x <= 9) if (a % BigInt(x) === BigInt(0)) ans++
+      let y = BigInt(String(x) + String(x).split('').reverse().join(''))
+      if (a % y === BigInt(0)) ans++
+      for (let i = 0; i <= 9; i++) {
+        y = BigInt(String(x) + i + String(x).split('').reverse().join(''))
+        if (a % y === BigInt(0)) ans++
+      }
+    }
+    console.log(`Case #${kase}: ${ans}`)
+  }
+})

kick-start/2022/RoundB/c.js

@@ -0,0 +1,33 @@
+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 [_, d] = lines[kase * 2 - 1].split(' ').map(Number)
+    const v = lines[kase * 2].split(' ').map(Number)
+    const n = v.length
+    /*
+    dp[i][j][k] = 将区间 i, j 全部变成 k 的开销
+    Math.min(dp[i1][j][num(i, i1)], dp[i][j1][num(j1, j)])
+    */
+    const cache = {}
+    const solve = (i, j, k) => {
+      console.assert(i >= 0 && i < n)
+      console.assert(j >= 0 && j < n)
+      if (cache[`${i}_${j}_${k}`] != null) {
+        return cache[`${i}_${j}_${k}`]
+      }
+      while (v[i] === k) i++
+      while (v[j] === k) j--
+      if (i > j) return 0
+      const k1 = v[i]; const k2 = v[j]
+      const d1 = Math.abs(k1 - k); const d2 = Math.abs(k2 - k)
+      const ans = Math.min(solve(i, j, k1) + Math.min(d1, d - d1), solve(i, j, k2) + Math.min(d2, d - d2))
+      if (ans < 0) console.log(i, j, k, k1, k2, d, d1, d2)
+      return cache[`${i}_${j}_${k}`] = ans
+    }
+    console.log(`Case #${kase}: ${solve(0, n - 1, 0)}`)
+  }
+})

matcher.cpp

@@ -5,8 +5,8 @@
 #include <ctime>
 #include <iostream>
 
-const std::string bf = "kick-start/2021/RoundE/a.naive.cpp";
-const std::string algo = "kick-start/2021/RoundE/a.cpp";
+const std::string bf = "kick-start/2022/RoundB/b-naive.cpp";
+const std::string algo = "kick-start/2022/RoundB/b.cpp";
 const std::string randomGenerator = "random.cpp";
 
 /*
@@ -28,20 +28,20 @@ int mySystem(const char* command) {
 
 int main() {
     mySystem(("g++ -std=c++17 -o random.out " + randomGenerator).c_str());
-    // mySystem(
-    // ("g++ -std=c++17 -o bf.out " + bf).c_str());
-    // mySystem(
-    //     ("g++ -std=c++17 -o algo.out " + algo).c_str());
+    mySystem(
+        ("g++ -std=c++17 -o bf.out " + bf).c_str());
+    mySystem(
+        ("g++ -std=c++17 -o algo.out " + algo).c_str());
     for (int T = 1;; T++) {
         // 生成随机数据
         mySystem("./random.out > data.in");
         // 记录运行的 CPU 时间
         double st = clock();
         // 暴力解法输出正确答案
-        mySystem("node kick-start/2021/RoundH/c.js < data.in > data.ans");
+        mySystem("./bf.out < data.in > data.ans");
         double ed = clock();
         // 优化解法输出待检查答案
-        mySystem("node kick-start/2021/RoundH/d.js < data.in > data.out");
+        mySystem("./algo.out < data.in > data.out");
 
         if (mySystem("diff data.out data.ans")) {
             puts("\033[1;31mWrong Answer\033[0m");

random.cpp

@@ -23,8 +23,7 @@ int main() {
     cout << n << endl;
     for (int i = 1; i <= n; i++) {
         {
-            cout << 10 << endl
-                 << getRandStr(10);
+            cout << getRandStr(5);
             cout << endl;
         }
     }