第十一届中国大学生程序设计竞赛 哈尔滨站（CCPC 2025 Harbin Site）

Author: Macesuted

14819.cpp

@@ -0,0 +1,64 @@
+/**
+ * @file 14819.cpp
+ * @author Macesuted ([email protected])
+ * @date 2025-11-11
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+#define maxn 1000005
+#define mod 1'000'000'007
+
+int64_t f[maxn], g[maxn], h[maxn], a[maxn], mul[maxn], sum[maxn];
+
+void solve(void) {
+    int n, x;
+    cin >> n >> x;
+    mul[0] = sum[0] = 1;
+    for (int i = 1; i <= n; i++) cin >> a[i], sum[i] = (sum[i - 1] + (mul[i] = mul[i - 1] * a[i] % mod)) % mod;
+
+    auto add = [&](int64_t &x, int64_t y) -> int64_t { return x = (x + y) % mod; };
+
+    int64_t ans = mul[n];
+    for (int i = 1; i <= n; i++) f[i] = g[i] = h[i] = 0;
+    f[n + 1] = 1, g[n + 1] = h[n + 1] = 0;
+    for (int i = n + 1; i >= 1; i--) {
+        if (i > 1 && a[i] > 1) add(h[i - 1], h[i]);
+        if (i > 2 && a[i] == 1) add(h[i - 2], h[i]);
+
+        if (a[i] > 1) add(f[i], h[i]), add(g[i], h[i] * (a[i] - 2));
+        if (i > 2 && a[i - 2] == a[i]) add(f[i - 2], h[i]);
+        if (i > 1) add(f[i - 1], h[i]), add(g[i - 1], h[i] * (a[i - 1] - 1));
+
+        if (i > 1) add(f[i - 1], f[i]), add(g[i - 1], f[i] * (a[i - 1] - 1));
+        if (i > 2) add(h[i - 2], f[i]);
+
+        if (i > 1) add(f[i - 1], g[i]), add(g[i - 1], g[i] * (a[i - 1] - 1));
+        if (i > 1) add(h[i - 1], g[i]);
+
+        if (i > 2) add(ans, (sum[i - 3] + mul[i - 3] * (a[i - 2] - 1)) % mod * f[i]);
+        if (i > 1) add(ans, (sum[i - 2] + mul[i - 2] * (a[i - 1] - 1)) % mod * g[i]);
+        if (i > 1 && a[i] > 1) add(ans, (sum[i - 2] + mul[i - 2] * (a[i - 1] - 1)) % mod * h[i]);
+        if (i > 2 && a[i] == 1) add(ans, (sum[i - 3] + mul[i - 3] * (a[i - 2] - 1)) % mod * h[i]);
+    }
+
+    cout << ans << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}

14820.cpp

@@ -0,0 +1,53 @@
+/**
+ * @file 14820.cpp
+ * @author Macesuted ([email protected])
+ * @date 2025-11-11
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+#define maxn 1005
+
+int64_t a[maxn][maxn];
+
+void solve(void) {
+    int n, m;
+    cin >> n >> m;
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= m; j++) cin >> a[i][j];
+    map<int, int64_t> S;
+    int64_t ans = 0;
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= m; j++) {
+            if (a[i][j] >= 0) {
+                S[j] += a[i][j];
+                continue;
+            }
+            auto it = S.upper_bound(j);
+            while (it != S.begin() && a[i][j] < 0) {
+                it--;
+                int64_t v = min(it->second, -a[i][j]);
+                it->second -= v, a[i][j] += v;
+            }
+            ans += abs(a[i][j]);
+        }
+    for (auto [x, v] : S) ans += v;
+    cout << ans << endl;
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}

14825.cpp

@@ -0,0 +1,63 @@
+/**
+ * @file 14825.cpp
+ * @author Macesuted ([email protected])
+ * @date 2025-11-11
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+#define maxn 15
+
+int X[maxn], Y[maxn];
+
+void solve(void) {
+    int n, m, k;
+    cin >> n >> m >> k;
+    for (int i = 0; i < k; i++) cin >> X[i] >> Y[i];
+    for (int S = 0; S < (1 << k); S++)
+        cout << [&](void) -> int {
+            int xl = 1, xr = n, pl = 1, pr = n, y = 1, d = 0;
+            for (int l = 0, r; l < k; l = r + 1) {
+                r = l;
+                while (r + 1 < k && Y[r + 1] == Y[l]) r++;
+
+                int ql = 1, qr = n;
+                for (int i = l; i <= r; i++)
+                    if (S >> i & 1)
+                        ql = max(ql, X[i] + 1);
+                    else
+                        qr = min(qr, X[i] - 1);
+                if (ql > qr) return -1;
+
+                if (Y[l] == 1) {
+                    l = ql, r = qr;
+                    continue;
+                }
+                if (Y[l] == y + 1 && (pr < ql || qr < pl)) return -1;
+                if (xr < ql) d += ql - xr, xl = xr = ql;
+                if (xl > qr) d += xl - qr, xl = xr = qr;
+                xl = max(xl, ql), xr = min(xr, qr);
+                d += Y[l] - y, y = Y[l];
+                pl = ql, pr = qr;
+            }
+            return d + (m - y);
+        }() << ' ';
+    cout << endl;
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}