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

Author: Macesuted

HDOJ/7445.cpp

@@ -0,0 +1,41 @@
+/**
+ * @file 7445.cpp
+ * @author Macesuted ([email protected])
+ * @date 2024-07-22
+ *
+ * @copyright Copyright (c) 2024
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+typedef pair<int, int> pii;
+
+void solve(void) {
+    vector<pii> ans;
+
+    int n, n1 = 1;
+    cin >> n;
+    for (int i = 1; i * 3 <= n; i++) {
+        ans.emplace_back(min(i, 3), i + 1);
+        ans.emplace_back(min(i, 2), i + 2);
+        ans.emplace_back(min(i, 1), i + 3);
+        n1 = i + 3;
+    }
+    for (int i = 0; i < n % 3; i++) ans.emplace_back(1, ++n1);
+    sort(ans.begin(), ans.end());
+    for (auto [x, y] : ans) cout << x << ' ' << y << endl;
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _;
+    cin >> _;
+    while (_--) solve();
+    return 0;
+}

HDOJ/7446.cpp

@@ -0,0 +1,102 @@
+/**
+ * @file 7446.cpp
+ * @author Macesuted ([email protected])
+ * @date 2024-07-22
+ *
+ * @copyright Copyright (c) 2024
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+typedef tuple<int, int, int, int> tiiii;
+
+int f[35][35][2000], id[50][50], X[30], Y[30], A[30], B[30], C[30];
+bool vis[35][35][2000];
+priority_queue<tiiii, vector<tiiii>, less<tiiii>> que;
+
+void solve(void) {
+    int n, m, q, d, sx, sy;
+    cin >> n >> m >> q;
+    for (int i = 1; i <= n; i++)
+        for (int j = 1; j <= m; j++) {
+            id[i][j] = -1;
+            for (int S = 0; S < (1 << q); S++) f[i][j][S] = -1e9, vis[i][j][S] = false;
+        }
+    cin >> d;
+    for (int i = 0; i < q; i++) cin >> X[i] >> Y[i] >> A[i] >> B[i] >> C[i], id[X[i]][Y[i]] = i;
+    cin >> sx >> sy;
+
+    auto waste = [&](int x, int y, int S) {
+        int sum = 0;
+        for (int i = 0; i < q; i++)
+            if (!(S >> i & 1) && abs(x - X[i]) + abs(y - Y[i]) <= C[i]) sum += B[i];
+        return sum;
+    };
+
+    que.emplace(f[sx][sy][0] = 0, sx, sy, 0);
+    while (!que.empty()) {
+        auto [val, x, y, S] = que.top();
+        que.pop();
+        if (vis[x][y][S]) continue;
+        vis[x][y][S] = true;
+        for (int tx = x - 1, T = S; tx >= max(1, x - d); tx--) {
+            int ty = y;
+            if (id[tx][ty] >= 0 && !(T >> id[tx][ty] & 1))
+                T |= 1 << id[tx][ty];
+            else {
+                int v = val - waste(tx, ty, T);
+                if (f[tx][ty][T] < v) que.emplace(f[tx][ty][T] = v, tx, ty, T);
+            }
+        }
+        for (int tx = x + 1, T = S; tx <= min(n, x + d); tx++) {
+            int ty = y;
+            if (id[tx][ty] >= 0 && !(T >> id[tx][ty] & 1))
+                T |= 1 << id[tx][ty];
+            else {
+                int v = val - waste(tx, ty, T);
+                if (f[tx][ty][T] < v) que.emplace(f[tx][ty][T] = v, tx, ty, T);
+            }
+        }
+        for (int ty = y - 1, T = S; ty >= max(1, y - d); ty--) {
+            int tx = x;
+            if (id[tx][ty] >= 0 && !(T >> id[tx][ty] & 1))
+                T |= 1 << id[tx][ty];
+            else {
+                int v = val - waste(tx, ty, T);
+                if (f[tx][ty][T] < v) que.emplace(f[tx][ty][T] = v, tx, ty, T);
+            }
+        }
+        for (int ty = y + 1, T = S; ty <= min(m, y + d); ty++) {
+            int tx = x;
+            if (id[tx][ty] >= 0 && !(T >> id[tx][ty] & 1))
+                T |= 1 << id[tx][ty];
+            else {
+                int v = val - waste(tx, ty, T);
+                if (f[tx][ty][T] < v) que.emplace(f[tx][ty][T] = v, tx, ty, T);
+            }
+        }
+    }
+    int ans = 0;
+    for (int S = 0; S < (1 << q); S++) {
+        int delt = 0;
+        for (int i = 0; i < q; i++)
+            if (S >> i & 1) delt += A[i];
+        for (int i = 1; i <= n; i++)
+            for (int j = 1; j <= m; j++) ans = max(ans, f[i][j][S] + delt);
+    }
+    cout << ans << endl;
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _;
+    cin >> _;
+    while (_--) solve();
+    return 0;
+}

HDOJ/7447.cpp

@@ -0,0 +1,77 @@
+/**
+ * @file 7447.cpp
+ * @author Macesuted ([email protected])
+ * @date 2024-07-22
+ *
+ * @copyright Copyright (c) 2024
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+typedef tuple<int, int, int> tiii;
+
+int a[20][20];
+
+vector<tiii> ans;
+void chk(int x, int y, int z) {
+    int t = min({x, y, z});
+    if (t == y) tie(x, y, z) = make_tuple(y, z, x);
+    if (t == z) tie(x, y, z) = make_tuple(z, x, y);
+    if (x == 1) {
+        if (y == 2 && z == 3) return;
+        if (y == 3 && z == 4) return;
+        if (y == 4 && z == 5) return;
+        if (y == 5 && z == 2) return;
+    }
+    if (x == 2) {
+        if (y == 5 && z == 6) return;
+        if (y == 6 && z == 3) return;
+    }
+    if (x == 3) {
+        if (y == 6 && z == 4) return;
+    }
+    if (x == 4) {
+        if (y == 6 && z == 5) return;
+    }
+    ans.emplace_back(x, min(y, z), max(y, z));
+    return;
+}
+
+void solve(void) {
+    ans.clear();
+    for (int i = 1; i <= 9; i++) {
+        string s;
+        cin >> s;
+        for (int j = 1; j <= 12; j++)
+            if (s[j - 1] == '*')
+                a[i][j] = -1;
+            else
+                a[i][j] = s[j - 1] - '0';
+    }
+    chk(a[3][6], a[4][6], a[4][7]);
+    chk(a[1][6], a[4][9], a[4][10]);
+    chk(a[1][4], a[4][12], a[4][1]);
+    chk(a[3][4], a[4][3], a[4][4]);
+
+    chk(a[7][4], a[6][4], a[6][3]);
+    chk(a[9][4], a[6][1], a[6][12]);
+    chk(a[9][6], a[6][10], a[6][9]);
+    chk(a[7][6], a[6][7], a[6][6]);
+
+    if (ans.empty()) return cout << "No problem" << endl, void();
+    cout << get<0>(ans.front()) << ' ' << get<1>(ans.front()) << ' ' << get<2>(ans.front()) << endl;
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _;
+    cin >> _;
+    while (_--) solve();
+    return 0;
+}

HDOJ/7450.cpp

@@ -0,0 +1,62 @@
+/**
+ * @file 7450.cpp
+ * @author Macesuted ([email protected])
+ * @date 2024-07-22
+ *
+ * @copyright Copyright (c) 2024
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define maxn 100005
+#define endl '\n'
+
+struct Frac {
+    int64_t u, d;
+    Frac(void) { u = 0, d = 1; }
+    Frac(int64_t u_, int64_t d_) { u = u_, d = d_; }
+    Frac operator+(const Frac& o) const {
+        int64_t ud = d / __gcd(d, o.d) * o.d, uu = ud / d * u + ud / o.d * o.u;
+        int64_t x = __gcd(ud, uu);
+        return Frac{uu / x, ud / x};
+    }
+    bool operator<(const Frac& o) const {
+        int64_t ud = d / __gcd(d, o.d) * o.d;
+        return ud / d * u < ud / o.d * o.u;
+    }
+};
+
+Frac f[maxn];
+vector<vector<int>> graph;
+
+void dfs(int p, int pre = -1) {
+    for (auto i : graph[p])
+        if (i != pre) f[i] = f[p] + f[i], dfs(i, p);
+    return;
+}
+
+void solve(void) {
+    int n;
+    cin >> n;
+    graph.clear(), graph.resize(n + 1);
+    for (int i = 1, x, y; i < n; i++) cin >> x >> y, graph[x].push_back(y), graph[y].push_back(x);
+    for (int i = 1; i <= n; i++) f[i].u = 15, cin >> f[i].d;
+    dfs(1);
+    Frac ans(0, 1);
+    for (int i = 1; i <= n; i++)
+        if (ans < f[i]) ans = f[i];
+    cout << ans.u << '/' << ans.d << endl;
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}

HDOJ/7451.cpp

@@ -0,0 +1,43 @@
+/**
+ * @file 7451.cpp
+ * @author Macesuted ([email protected])
+ * @date 2024-07-22
+ *
+ * @copyright Copyright (c) 2024
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _;
+    cin >> _;
+    while (_--) {
+        string s;
+        cin >> s;
+        int n = s.size();
+        s = ' ' + s;
+
+        vector<int> pos;
+
+        for (int i = 1; i <= n; i++)
+            if (s[i] == '/') pos.push_back(i);
+        for (int i = 1; i < pos[0] - 1; i++) cout << s[i];
+        cout << endl;
+        for (int i = 1; i + 1 < (int)pos.size(); i++) {
+            string t;
+            for (int j = pos[i] + 1; j < pos[i + 1]; j++) t.push_back(s[j]);
+            int cnt = 0;
+            for (int j = 1; j + 1 < (int)t.size(); j++)
+                if (t[j] == '=') cnt++;
+            if (i != 1 && cnt != 1) continue;
+            cout << t << endl;
+        }
+    }
+    return 0;
+}