QOJ: The 3rd Universal Cup. Stage 34: Aobayama

Author: Macesuted

.vscode/tasks.json

@@ -12,6 +12,7 @@
                 "'${fileBasename}'",
                 "-o",
                 "'${fileBasenameNoExtension}.exe'",
+                "-std=c++23",
                 "-Wall",
                 "-Wextra",
                 "-O2",
@@ -71,6 +72,7 @@
                 "-o",
                 "'${fileBasenameNoExtension}.exe'",
                 "-glldb",
+                "-std=c++23",
                 "-Wall",
                 "-Wextra",
                 "-O2",

QOJ/10325.cpp

@@ -0,0 +1,55 @@
+/**
+ * @file 10325.cpp
+ * @author Macesuted ([email protected])
+ * @date 2025-04-17
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+#define maxn 1000005
+
+int pre[maxn];
+
+void solve(void) {
+    int n;
+    cin >> n;
+    string s;
+    cin >> s, s = ' ' + s;
+
+    for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + (s[i] == '1');
+
+    int xp = 0, xr = -1, rest1 = 2;
+    for (int l = 1, r; l <= n; l = r + 1) {
+        r = l;
+        while (r + 1 <= n && s[l] == s[r + 1]) r++;
+        if (s[l] == '0') {
+            if ((r - l + 1) * 2 > (n - pre[n])) xp = l, xr = r;
+            rest1 = min(rest1, (pre[l - 1] > 0) + (pre[n] - pre[r] > 0));
+        }
+    }
+
+    if (xp == 0) {
+        if ((n - pre[n]) % 2 == 0) return cout << (n - pre[n]) / 2 + pre[n] - 1 << endl, void();
+        return cout << (n - pre[n]) / 2 + pre[n] - rest1 << endl, void();
+    }
+
+    cout << (n - pre[n] - (xr - xp + 1)) + pre[n] - (pre[xp - 1] > 0) - (pre[n] - pre[xr] > 0) << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}

QOJ/10332.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+void solve(void) {
+    int64_t s, t;
+    cin >> s >> t;
+
+    int64_t v = sqrt(s + t);
+    if (v * v == s + t) return cout << "1 " << t << endl, void();
+
+    if (s == t) {
+        v = sqrt(s) + 1;
+        return cout << "2 " << v * v - s << ' ' << t << endl, void();
+    }
+
+    {
+        int64_t delt = abs(s - t), base = 1;
+        if (delt % 2 == 1) {
+            int64_t i = delt / 2;
+            if (s > t && (i + 1) * (i + 1) * base > s)
+                return cout << "2 " << (i + 1) * (i + 1) * base - s << ' ' << t << endl, void();
+            if (s < t && i * i * base > s) return cout << "2 " << i * i * base - s << ' ' << t << endl, void();
+        } else if (delt % 4 == 0) {
+            int64_t q = delt / 4;
+            if (!(q < 1 || (q - 1) * (q - 1) < min(s, t) || (q + 1) * (q + 1) < max(s, t)))
+                return cout << "2 " << (q - 1) * (q - 1) - min(s, t) << ' ' << t << endl, void();
+        }
+    }
+
+    int64_t sum = s + t;
+    int64_t x = sqrt(sum + 2 * sqrt(sum) + 1) + 1;
+    while (!((x * x - sum) & 1)) x++;
+    int64_t y = (x * x - sum) / 2;
+    cout << "3 " << x * x - s << ' ' << y * y - t << ' ' << t << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    cin >> _;
+    while (_--) solve();
+
+    return 0;
+}

compile_flags.txt

@@ -1,4 +1,5 @@
 -xc++
 -Wall
 -Wextra
--DLOCAL
+-DLOCAL
+-std=c++23