The 4th Universal Cup. Stage 8: Grand Prix of Poland

Author: Macesuted

QOJ/15448.cpp

@@ -0,0 +1,66 @@
+/**
+ * @file 15448.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2026-01-22
+ *
+ * @copyright Copyright (c) 2026
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+const int pw10[5] = {1, 10, 100, 1000, 10000};
+
+int dist[100000], cnt[25];
+
+void solve(void) {
+    int n;
+    cin >> n;
+
+    for (int i = 0; i < 100000; i++) cnt[dist[i] = 25]++;
+
+    auto upd = [&](int p, int d) -> void {
+        cnt[dist[p]]--;
+        cnt[dist[p] = d]++;
+        return;
+    };
+
+    int ans = 25;
+    for (int i = 1; i <= n; i++) {
+        string s;
+        cin >> s;
+
+        int x = stoi(s);
+        if (dist[x] == 0) continue;
+
+        queue<int> que;
+        upd(x, 0), que.push(x);
+        while (!que.empty()) {
+            int p = que.front();
+            que.pop();
+
+            for (int t = 0; t < 5; t++)
+                for (int delt : {-1, 1}) {
+                    int pb = p / pw10[t] % 10, qb = (pb + 10 + delt) % 10;
+                    int q = p + (qb - pb) * pw10[t];
+                    if (dist[q] > dist[p] + 1) upd(q, dist[p] + 1), que.push(q);
+                }
+        }
+
+        while (!cnt[ans]) ans--;
+
+        cout << ans << ' ' << cnt[ans] << endl;
+    }
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    while (_--) solve();
+
+    return 0;
+}

QOJ/15452.cpp

@@ -0,0 +1,84 @@
+/**
+ * @file 15452.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2026-01-22
+ *
+ * @copyright Copyright (c) 2026
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+const string names[27] = {"UW",  "UJ",  "UWR", "MAP", "PW",  "AGH", "PG", "NLU", "PUT", "PO", "PWR", "SGGW", "UMCS", "UR",
+                          "ZUT", "DTP", "GOO", "HUA", "KUL", "PL",  "PM", "PS",  "UAM", "UG", "UMK", "UO",   "WAT"};
+int cnt[27] = {11, 9, 8, 7, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
+
+int a[8][10];
+
+int _(string s) {
+    for (int i = 0; i < 27; i++)
+        if (names[i] == s) return i;
+    assert(false);
+}
+
+bool dfs(int x, int y) {
+    if (x && y && a[x - 1][y - 1] == a[x][y]) return false;
+    if (x && a[x - 1][y] == a[x][y]) return false;
+    if (x && y < 9 && a[x - 1][y + 1] == a[x][y]) return false;
+    if (y && a[x][y - 1] == a[x][y]) return false;
+
+    if (x == 7 && y == 9) return true;
+
+    vector<int> ids;
+    for (int i = 0; i < 27; i++)
+        if (cnt[i]) ids.push_back(i);
+    sort(ids.begin(), ids.end(), [&](int x, int y) { return cnt[x] > cnt[y]; });
+
+    int nx = x, ny = y + 1;
+    if (ny == 10) nx++, ny = 0;
+
+    for (auto id : ids) {
+        cnt[id]--;
+        a[nx][ny] = id;
+        if (dfs(nx, ny)) return true;
+        cnt[id]++;
+    }
+
+    return false;
+}
+
+void solve(void) {
+    string name;
+    cin >> name;
+
+    cnt[a[0][0] = _(name)]--;
+    assert(dfs(0, 0));
+
+    for (int i = 0; i < 8; i++)
+        for (int j = 0; j < 10; j++)
+            for (int dx = -1; dx <= +1; dx++)
+                for (int dy = -1; dy <= +1; dy++)
+                    if (dx != 0 || dy != 0) {
+                        if (i + dx < 0 || i + dx > 7 || j + dy < 0 || j + dy > 9) continue;
+                        if (a[i][j] == a[i + dx][j + dy]) cerr << i << ' ' << j << ' ' << dx << ' ' << dy << endl;
+                    }
+
+    for (int i = 0; i < 8; i++) {
+        for (int j = 0; j < 10; j++) cout << names[a[i][j]] << ' ';
+        cout << endl;
+    }
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    while (_--) solve();
+
+    return 0;
+}