HDOJ: 2024“钉耙编程”中国大学生算法设计超级联赛（4）

Macesuted · Macesuted · commit fda0f9f76e9f · 2024-07-29T19:24:47.000+08:00
diff --git a/.vscode/tasks.json b/.vscode/tasks.json
@@ -12,7 +12,7 @@
                 "'${fileBasename}'",
                 "-o",
                 "'${fileBasenameNoExtension}.exe'",
-                "-std=c++17",
+                "-std=c++20",
                 "-Wall",
                 "-Wextra",
                 "-O2",
@@ -72,7 +72,7 @@
                 "-o",
                 "'${fileBasenameNoExtension}.exe'",
                 "-glldb",
-                "-std=c++17",
+                "-std=c++20",
                 "-Wall",
                 "-Wextra",
                 "-O2",
diff --git a/HDOJ/7471.cpp b/HDOJ/7471.cpp
@@ -0,0 +1,86 @@
+/**
+ * @file 7471.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2024-07-29
+ *
+ * @copyright Copyright (c) 2024
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define maxn 200005
+
+typedef pair<int, int> pii;
+
+vector<int> prime;
+bool notPrime[maxn];
+
+int a[maxn], f[maxn];
+int64_t sum[maxn];
+int n, k;
+
+int read() {
+    char ch = getchar();
+    int res = 0, f = +1;
+    while (ch < '0' || ch > '9') {
+        if (ch == '-') f = -f;
+        ch = getchar();
+    }
+    while (ch >= '0' && ch <= '9') {
+        res = res * 10 + ch - '0';
+        ch = getchar();
+    }
+    return res * f;
+}
+
+bool check(int64_t lim) {
+    set<pii> S;
+    for (int r = 1, cnt = 0; r <= n; r++) {
+        S.emplace(sum[r - 1], r);
+        for (auto [v, l] : S) {
+            if (sum[r] - v < lim) break;
+            if (notPrime[r - l + 1]) continue;
+            cnt++, S.clear();
+            break;
+        }
+        if (cnt == k) return true;
+    }
+    return false;
+}
+
+void solve(void) {
+    n = read(), k = read();
+    for (int i = 1; i <= n; i++) a[i] = read(), sum[i] = sum[i - 1] + a[i];
+
+    if (2 * k > n) return cout << "impossible" << endl, void();
+
+    int64_t l = -1e6, r = +1e6;
+    while (l + 1 < r) {
+        int64_t mid = (l + r) >> 1;
+        (check(mid) ? l : r) = mid;
+    }
+
+    cout << l << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
+
+    notPrime[1] = true;
+    for (int i = 2; i < maxn; i++) {
+        if (!notPrime[i]) prime.push_back(i);
+        for (auto j = prime.begin(); j != prime.end() && i * *j < maxn; j++) {
+            notPrime[i * *j] = true;
+            if (i % *j == 0) break;
+        }
+    }
+
+    int _ = read();
+    while (_--) solve();
+
+    return 0;
+}
diff --git a/HDOJ/7472.cpp b/HDOJ/7472.cpp
@@ -0,0 +1,75 @@
+/**
+ * @file 7472.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2024-07-29
+ *
+ * @copyright Copyright (c) 2024
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef pair<int, int> pii;
+
+int read() {
+    char ch = getchar();
+    int res = 0, f = +1;
+    while (ch < '0' || ch > '9') {
+        if (ch == '-') f = -f;
+        ch = getchar();
+    }
+    while (ch >= '0' && ch <= '9') {
+        res = res * 10 + ch - '0';
+        ch = getchar();
+    }
+    return res * f;
+}
+
+int a[20], w[1 << 20], f[1 << 20], xorS[1 << 20], ans, n2, m2;
+bool vis[1 << 20];
+vector<pii> rec;
+
+void check(int S, int T, int val) {
+    f[S | T] = min(f[S | T], w[xorS[T]]);
+    ans = min(ans, max(f[S | T], f[(n2 - 1) ^ (S | T)]) - val);
+    return;
+};
+
+void solve(void) {
+    int n = read(), m = read();
+    n2 = 1 << n, m2 = 1 << m;
+    for (int i = 0; i < n; i++) a[i] = read();
+    for (int i = 0; i < m2; i++) w[i] = read();
+    for (int i = 0; i < n2; i++) vis[i] = false, f[i] = INT_MAX;
+    for (int S = 0; S < n2; S++) {
+        xorS[S] = 0;
+        for (int j = 0; j < n; j++)
+            if (S >> j & 1) xorS[S] ^= a[j];
+    }
+
+    rec.clear();
+    for (int S = 0; S < n2; S++) rec.emplace_back(w[xorS[S]], S);
+    sort(rec.begin(), rec.end(), greater<pii>());
+
+    ans = INT_MAX;
+    for (auto [val, S] : rec) {
+        vis[S] = true;
+        for (int fT = S ^ (n2 - 1), T = fT; T; T = (T - 1) & fT)
+            if (vis[T]) check(S, T, val);
+        if (vis[0]) check(S, 0, val);
+    }
+
+    cout << ans << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
+
+    int _ = read();
+    while (_--) solve();
+
+    return 0;
+}
diff --git a/HDOJ/7474.cpp b/HDOJ/7474.cpp
@@ -0,0 +1,99 @@
+/**
+ * @file 7474.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2024-07-29
+ *
+ * @copyright Copyright (c) 2024
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define mod 1000000007
+#define maxn 52
+
+bool mem1;
+
+const int way[2][4] = {{0, 0, +1, -1}, {+1, -1, 0, 0}};
+
+int f[maxn][maxn][maxn][11][11][6], g[maxn][maxn][maxn];
+string a[maxn];
+
+bool mem2;
+
+void solve(void) {
+    int n, m, k, hp;
+    cin >> n >> m >> k >> hp;
+
+    a[0] = a[n + 1] = string(n + 2, '#');
+    for (int i = 1; i <= n; i++) cin >> a[i], a[i] = '#' + a[i] + '#';
+
+    int sx, sy, tx, ty;
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= n; j++)
+            if (a[i][j] == 'P')
+                sx = i, sy = j, a[i][j] = '.';
+            else if (a[i][j] == 'E')
+                tx = i, ty = j, a[i][j] = '.';
+
+    for (int t = 0; t <= m - k; t++)
+        for (int i = 1; i <= n; i++)
+            for (int j = 1; j <= n; j++)
+                for (int dx = 0; dx <= 2 * hp; dx++)
+                    for (int dy = 0; dy <= 2 * hp; dy++)
+                        for (int vhp = 0; vhp <= hp; vhp++) f[t][i][j][dx][dy][vhp] = 0;
+
+    for (int t = 0; t <= k; t++)
+        for (int i = 0; i <= n + 1; i++)
+            for (int j = 0; j <= n + 1; j++) g[t][i][j] = 0;
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= n; j++)
+            if (a[i][j] == '.') g[0][i][j] = 1;
+    for (int t = 1; t <= k; t++)
+        for (int i = 1; i <= n; i++)
+            for (int j = 1; j <= n; j++)
+                if (a[i][j] == '.')
+                    g[t][i][j] =
+                        ((int64_t)g[t - 1][i - 1][j] + g[t - 1][i + 1][j] + g[t - 1][i][j - 1] + g[t - 1][i][j + 1]) % mod;
+
+    f[0][sx][sy][hp][hp][hp] = 1;
+
+    int64_t ans = 0;
+    for (int t = 0; t < m - k; t++)
+        for (int i = 1; i <= n; i++)
+            for (int j = 1; j <= n; j++)
+                for (int dx = 0; dx <= 2 * hp; dx++)
+                    for (int dy = 0; dy <= 2 * hp; dy++)
+                        for (int vhp = 1; vhp <= hp; vhp++) {
+                            if (!f[t][i][j][dx][dy][vhp]) continue;
+                            int ox = i - sx + tx + (dx - hp), oy = j - sy + ty + (dy - hp);
+                            for (int x = 0; x < 4; x++) {
+                                int Px = i + way[0][x], Py = j + way[1][x], Ex = ox + way[0][x], Ey = oy + way[1][x];
+                                int Ehp = vhp, Edx = dx, Edy = dy;
+                                if (a[Px][Py] == '#') continue;
+                                if (a[Ex][Ey] == '#')
+                                    Ex -= way[0][x], Ey -= way[1][x], Ehp--, Edx -= way[0][x], Edy -= way[1][x];
+                                if (Ehp == 0) {
+                                    ans = (ans + (int64_t)f[t][i][j][dx][dy][vhp] * g[k][Px][Py]) % mod;
+                                    continue;
+                                }
+                                f[t + 1][Px][Py][Edx][Edy][Ehp] =
+                                    (f[t + 1][Px][Py][Edx][Edy][Ehp] + f[t][i][j][dx][dy][vhp]) % mod;
+                            }
+                        }
+
+    cout << ans << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
+
+    int _;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}
diff --git a/HDOJ/7477.cpp b/HDOJ/7477.cpp
@@ -0,0 +1,77 @@
+/**
+ * @file 7477.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2024-07-29
+ *
+ * @copyright Copyright (c) 2024
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define maxn 1000005
+
+string S;
+
+int nxt[maxn][40], pre[maxn][40];
+int f[maxn];
+
+int code(char c) { return '0' <= c && c <= '9' ? c - '0' : c - 'a' + 10; }
+
+void solve(void) {
+    int n, m;
+    cin >> n >> m;
+    cin >> S, S = ' ' + S;
+    for (int i = 1; i <= m; i++) f[i] = 0;
+
+    for (int j = 0; j < 40; j++) nxt[m][j] = nxt[m + 1][j] = m + 1;
+    for (int i = m - 1; ~i; i--) {
+        for (int j = 0; j < 40; j++) nxt[i][j] = nxt[i + 1][j];
+        nxt[i][code(S[i + 1])] = i + 1;
+    }
+
+    for (int j = 0; j < 40; j++) pre[1][j] = pre[0][j] = 0;
+    for (int i = 2; i <= m + 1; i++) {
+        for (int j = 0; j < 40; j++) pre[i][j] = pre[i - 1][j];
+        pre[i][code(S[i - 1])] = i - 1;
+    }
+
+    for (int i = 1; i <= 12; i++) {
+        int day = 30;
+        if (i == 2) day = 29;
+        if (i == 1 || i == 3 || i == 5 || i == 7 || i == 8 || i == 10 || i == 12) day = 31;
+        for (int j = 1; j <= day; j++) {
+            string s = "0000";
+            int mon = i, day = j;
+            s[1] = mon % 10 + '0', s[0] = mon / 10 % 10 + '0';
+            s[3] = day % 10 + '0', s[2] = day / 10 + '0';
+            int p = m + 1;
+            for (int t = 3; ~t; t--) p = pre[p][code(s[t])];
+            f[p]++;
+        }
+    }
+
+    for (int i = m - 1; i; i--) f[i] += f[i + 1];
+
+    int64_t ans = 0;
+    while (n--) {
+        string s;
+        cin >> s;
+        int p = 0;
+        for (char c : s) p = nxt[p][code(c)];
+        if (p < m) ans += f[p + 1];
+    }
+    cout << ans << endl;
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
+
+    int _;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}
diff --git a/compile_flags.txt b/compile_flags.txt
@@ -1,5 +1,5 @@
 -xc++
--std=c++17
+-std=c++20
 -Wall
 -Wextra
 -IE:/Code/libs/testlib/
