2025“钉耙编程”中国大学生算法设计暑期联赛（5）

Author: Macesuted

HDOJ/1176-1002.cpp

@@ -0,0 +1,57 @@
+/**
+ * @file 1176-1002.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2025-08-01
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+#define maxn 200005
+
+int64_t a[maxn];
+
+void solve(void) {
+    int n, m, k, p;
+    cin >> n >> m >> k >> p;
+    for (int i = 1; i <= n; i++) cin >> a[i];
+
+    auto chk = [&](int64_t lim) -> bool {
+        int64_t sum = 0, rest = lim * p;
+        vector<int64_t> rec;
+        for (int i = 1; i <= n; i++) {
+            int64_t v = min(a[i], min(rest, lim) * k);
+            if (v % k) rec.push_back(v % k), v -= v % k;
+            sum += v, rest -= v / k;
+        }
+        sort(rec.begin(), rec.end(), greater<int64_t>());
+        for (auto x : rec)
+            if (rest) sum += x, rest--;
+        return sum >= m;
+    };
+
+    int64_t l = 0, r = 1e9;
+    while (l + 1 < r) {
+        int64_t mid = (l + r) >> 1;
+        (chk(mid) ? r : l) = mid;
+    }
+
+    cout << r << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}

HDOJ/1176-1005.cpp

@@ -0,0 +1,56 @@
+/**
+ * @file 1176-1005.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2025-08-01
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+void solve(void) {
+    int A, B, C, D;
+    cin >> A >> B >> C >> D;
+    int cnt[4];
+    vector<int64_t> rec[4];
+    for (int i = 0; i < 4; i++) {
+        cin >> cnt[i];
+        rec[i].push_back(0);
+        for (int t = 0, x; t < cnt[i]; t++) cin >> x, rec[i].push_back(x);
+        sort(rec[i].begin() + 1, rec[i].end(), greater<int>());
+        for (int t = 1; t <= cnt[i]; t++) rec[i][t] += rec[i][t - 1];
+    }
+
+    int64_t ans = 0;
+
+    for (int c = 0; c <= min(C, cnt[2]); c++) {
+        int64_t wC = rec[2][c];
+        for (int d = 0; d <= min(D, cnt[3]); d++) {
+            int64_t wD = rec[3][d];
+            int nA = A + (C - c), nB = B + (C - c) + 2 * (D - d);
+            for (int b = 0; b <= min(nB, cnt[1]); b++) {
+                int64_t wB = rec[1][b];
+                int64_t wA = rec[0][min(nA + 2 * (nB - b), cnt[0])];
+                ans = max(ans, wA + wB + wC + wD);
+            }
+        }
+    }
+
+    cout << ans << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}

HDOJ/1176-1009.cpp

@@ -0,0 +1,38 @@
+/**
+ * @file 1176-1009.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2025-08-01
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+#define maxn 200005
+
+int a[maxn], p[maxn], b[maxn];
+
+void solve(void) {
+    int n;
+    cin >> n;
+    for (int i = 1; i <= n; i++) cin >> a[i], p[a[i]] = i;
+    for (int i = 1; i <= n; i++) cin >> b[i];
+    int ans = 1;
+    for (int i = 2; i <= n; i++) ans += (p[b[i]] != p[b[i - 1]] + 1);
+    cout << ans << endl;
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}