CCPC Online 2025

Author: Macesuted

QOJ/14547.cpp

@@ -0,0 +1,57 @@
+/**
+ * @file 14547.cpp
+ * @author Macesuted ([email protected])
+ * @date 2025-09-06
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+void solve(void) {
+    int n, m;
+    cin >> n >> m;
+    vector<vector<int>> a(n + 2, vector<int>(m + 2, 0));
+
+    auto add = [&](int xl, int xr, int yl, int yr) -> void {
+        a[xl][yl]++;
+        a[xl][yr + 1]--;
+        a[xr + 1][yl]--;
+        a[xr + 1][yr + 1]++;
+        return;
+    };
+
+    for (int x = 0; x <= min(n, m); x++)
+        for (int y = 1; x + y <= min(n, m); y++) {
+            add(0, n - x - y, x, m - y);
+            add(y, n - x, 0, m - x - y);
+            add(x + y, n, y, m - x);
+            add(x, n - y, x + y, m);
+        }
+
+    for (int i = 0; i <= n; i++)
+        for (int j = 1; j <= m; j++) a[i][j] += a[i][j - 1];
+
+    for (int i = 1; i <= n; i++)
+        for (int j = 0; j <= m; j++) a[i][j] += a[i - 1][j];
+
+    for (int i = 0; i <= n; i++) {
+        for (int j = 0; j <= m; j++) cout << a[i][j] << ' ';
+        cout << endl;
+    }
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    while (_--) solve();
+
+    return 0;
+}

QOJ/14548.cpp

@@ -0,0 +1,95 @@
+/**
+ * @file 14548.cpp
+ * @author Macesuted ([email protected])
+ * @date 2025-09-06
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+#define maxn 100005
+
+struct Block {
+    int64_t val, cnt;
+    int top;
+
+    bool operator<(const Block& o) const {
+        if (this->val * o.cnt != o.val * this->cnt) return this->val * o.cnt < o.val * this->cnt;
+        return this->top < o.top;
+    }
+};
+
+vector<int> graph[maxn];
+Block a[maxn];
+int fa[maxn], f[maxn];
+
+int getfa(int p) { return f[p] == p ? p : f[p] = getfa(f[p]); }
+
+void dfs(int p, int pre = 0) {
+    fa[p] = pre;
+    for (auto q : graph[p])
+        if (q != pre) dfs(q, p);
+    return;
+}
+
+void solve(void) {
+    int n, X;
+    cin >> n >> X;
+
+    for (int i = 1, x, y; i < n; i++) cin >> x >> y, graph[x].push_back(y), graph[y].push_back(x);
+
+    int64_t ans = 0;
+
+    for (int i = 2, op; i <= n; i++) {
+        cin >> op;
+        if (op == 1)
+            a[i] = {0, 1, i};
+        else {
+            int64_t x, d, h;
+            cin >> x >> d >> h;
+            a[i] = {h / (X - d) + (h % (X - d) > 0) - 1, 0, i};
+            ans -= a[i].val * x;
+        }
+    }
+
+    dfs(1);
+
+    for (int i = 1; i <= n; i++) f[i] = i;
+
+    multiset<Block> S;
+
+    a[1] = {0, 0, 1};
+    for (int i = 2; i <= n; i++)
+        if (a[i].val > 0 || a[i].cnt > 0) S.insert(a[i]);
+
+    while (!S.empty()) {
+        int p = S.begin()->top, q = getfa(fa[p]);
+        S.erase(a[p]);
+        if (q != 1) S.erase(a[q]);
+
+        ans += a[q].cnt * a[p].val;
+        a[q].val += a[p].val;
+        a[q].cnt += a[p].cnt;
+        f[p] = q;
+
+        if (q != 1) S.insert(a[q]);
+    }
+
+    cout << ans << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    while (_--) solve();
+
+    return 0;
+}

QOJ/14551.cpp

@@ -0,0 +1,31 @@
+/**
+ * @file 14551.cpp
+ * @author Macesuted ([email protected])
+ * @date 2025-09-06
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+void solve(void) {
+    int n, m;
+    cin >> n >> m;
+    int x = (n + 1) / 2, y = m - x;
+    cout << 2 * min(x, y) + 1 << endl;
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}

QOJ/14559.cpp

@@ -0,0 +1,70 @@
+/**
+ * @file 14559.cpp
+ * @author Macesuted ([email protected])
+ * @date 2025-09-06
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+using tiii = tuple<int, int, int>;
+
+void printx(const string& s, const vector<tiii>& rec) {
+    cout << s << ' ' << rec.size() << endl;
+    for (auto [x, y, z] : rec) cout << x << ' ';
+    cout << endl;
+    for (auto [x, y, z] : rec) cout << y << ' ';
+    cout << endl;
+    for (auto [x, y, z] : rec) cout << z << ' ';
+    cout << endl;
+    return;
+}
+
+void makePre(string cmd, int l, int r) {
+    for (int i = 1; i < 32; i++) {
+        vector<tiii> rec;
+        for (int x = l + i; x <= r; x += 32) rec.emplace_back(x - 1, x, x);
+        printx(cmd, rec);
+    }
+    for (int i = l + 32; i <= r; i += 32) {
+        vector<tiii> rec;
+        for (int j = i; j < i + 32; j++) rec.emplace_back(i - 1, j, j);
+        printx(cmd, rec);
+    }
+    return;
+}
+
+void solve(void) {
+    cout << 188 << endl;
+
+    makePre("add", 0, 1023);
+
+    vector<tiii> rec;
+    for (int i = 0; i < 1024; i++) {
+        rec.emplace_back(i, i | (1 << 10), i | (1 << 10));
+        if (rec.size() == 32) printx("mul", rec), rec.clear();
+    }
+
+    makePre("max", 1024, 2047);
+
+    for (int i = 0; i < 1024; i++) {
+        rec.emplace_back(i, i | (1 << 10), i);
+        if (rec.size() == 32) printx("sub", rec), rec.clear();
+    }
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    while (_--) solve();
+
+    return 0;
+}