Tsinghua Bootcamp 2026. Qualification round

Author: Macesuted

Codeforces Gym/696681C.py

@@ -0,0 +1,47 @@
+"""
+@file 696681C.py
+@author Macesuted (i@macesuted.moe)
+@date 2026-06-06
+
+@copyright Copyright (c) 2026
+"""
+
+sa = input()
+sb = input()
+
+if sb[-len(sa):] == sa:
+    print(0)
+    exit(0)
+
+if len(sa) >= len(sb):
+    print(-1)
+    exit(0)
+
+a = int(sa)
+b = int(sb)
+
+if a > b // 10:
+    print(-1)
+    exit(0)
+
+c = 0
+while a < b // 10 and b % 10 != 0:
+    a += 1
+    b += 1
+    c += 1
+
+if a == b // 10:
+    print(c)
+    exit(0)
+
+delt = (b // 10 - a) // 9 * 10
+a += delt
+b += delt
+c += delt
+
+while a < b // 10:
+    a += 1
+    b += 1
+    c += 1
+
+print(c)

Codeforces Gym/696681E.cpp

@@ -0,0 +1,82 @@
+/**
+ * @file 696681E.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2026-06-06
+ *
+ * @copyright Copyright (c) 2026
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#ifndef LOCAL
+#define endl '\n'
+#endif
+
+bool mem1;
+
+int64_t fib[60], ori[40], base[40], idx[40];
+
+void solve(void) {
+    int64_t n, m;
+    cin >> n >> m;
+
+    fib[0] = fib[1] = 1;
+    for (int i = 2; i < 59; i++) fib[i] = fib[i - 2] + fib[i - 1];
+
+    vector<int64_t> rest;
+    for (int i = 0; i < 59; i++) {
+        int64_t v = fib[i], id = 0;
+        for (int j = 0; j < 40; j++) {
+            if (!(v >> j & 1)) continue;
+            if (!idx[j]) {
+                ori[j] = fib[i], base[j] = v, idx[j] = id ^ ((int64_t)1 << j);
+                break;
+            }
+            v ^= base[j], id ^= idx[j];
+        }
+        if (!v) rest.push_back(fib[i]);
+    }
+
+    int ans = INT_MAX;
+    for (size_t S = 0; S < (1 << rest.size()); S++) {
+        int64_t xsum = 0, sum = 0;
+        for (size_t i = 0; i < rest.size(); i++)
+            if (S >> i & 1) xsum ^= rest[i], sum += rest[i];
+
+        int64_t v = n ^ xsum, id = 0;
+        for (int i = 0; i < 40; i++)
+            if (v >> i & 1) v ^= base[i], id ^= idx[i];
+        for (int i = 0; i < 40; i++)
+            if (id >> i & 1) sum += ori[i];
+
+        if (sum > m || (m - sum) & 1) continue;
+
+        int cur = __builtin_popcountll(id) + __builtin_popcountll(S);
+        for (int i = 58; ~i; i--)
+            if (sum + 2 * fib[i] <= m) sum += 2 * fib[i], cur += 2;
+        ans = min(ans, cur);
+    }
+
+    cout << (ans == INT_MAX ? -1 : ans) << endl;
+
+    return;
+}
+
+bool mem2;
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+#ifdef LOCAL
+    cerr << "Memory Cost: " << abs(&mem1 - &mem2) / 1024. / 1024. << "MB" << endl;
+#endif
+
+    int _ = 1;
+    while (_--) solve();
+
+#ifdef LOCAL
+    cerr << "Time Cost: " << clock() * 1000. / CLOCKS_PER_SEC << "MS" << endl;
+#endif
+    return 0;
+}

Codeforces Gym/696681F.cpp

@@ -0,0 +1,55 @@
+/**
+ * @file 696681F.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2026-06-06
+ *
+ * @copyright Copyright (c) 2026
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#ifndef LOCAL
+#define endl '\n'
+#endif
+
+bool mem1;
+
+#define maxn 200005
+
+int fa[maxn];
+
+int getfa(int p) { return fa[p] == p ? p : fa[p] = getfa(fa[p]); }
+
+void solve(void) {
+    int n, m;
+    cin >> n >> m;
+    for (int i = 1; i <= n; i++) fa[i] = i;
+
+    int ans = 0;
+    for (int i = 1, x, y; i <= m; i++) {
+        cin >> x >> y;
+        if (getfa(x) != getfa(y)) ans++, fa[getfa(x)] = getfa(y);
+    }
+    cout << ans << endl;
+
+    return;
+}
+
+bool mem2;
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+#ifdef LOCAL
+    cerr << "Memory Cost: " << abs(&mem1 - &mem2) / 1024. / 1024. << "MB" << endl;
+#endif
+
+    int _ = 1;
+    while (_--) solve();
+
+#ifdef LOCAL
+    cerr << "Time Cost: " << clock() * 1000. / CLOCKS_PER_SEC << "MS" << endl;
+#endif
+    return 0;
+}

Codeforces Gym/696681I.cpp

@@ -0,0 +1,70 @@
+/**
+ * @file 696681I.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2026-06-06
+ *
+ * @copyright Copyright (c) 2026
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#ifndef LOCAL
+#define endl '\n'
+#endif
+
+bool mem1;
+
+#define maxn 200005
+#define B 500
+
+int64_t buc[B], a[maxn], sum[B];
+
+void solve(void) {
+    int q;
+    cin >> q;
+
+    while (q--) {
+        char op;
+        cin >> op;
+        if (op == '?') {
+            int t;
+            cin >> t, t--;
+            int ans = 0;
+            for (int i = 1; i < B; i++)
+                if (t / i % 2 == 0) ans += buc[i];
+            int x = -1;
+            while (x + B <= t) x += B, ans += sum[x / B];
+            while (x < t) ans += a[++x];
+            cout << ans << endl;
+        } else {
+            int x, k;
+            cin >> x >> k;
+            if (op == '-') x = -x;
+            if (k < B)
+                buc[k] += x;
+            else
+                for (int i = 0; i < maxn; i += k, x = -x) a[i] += x, sum[i / B] += x;
+        }
+    }
+
+    return;
+}
+
+bool mem2;
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+#ifdef LOCAL
+    cerr << "Memory Cost: " << abs(&mem1 - &mem2) / 1024. / 1024. << "MB" << endl;
+#endif
+
+    int _ = 1;
+    while (_--) solve();
+
+#ifdef LOCAL
+    cerr << "Time Cost: " << clock() * 1000. / CLOCKS_PER_SEC << "MS" << endl;
+#endif
+    return 0;
+}

Codeforces Gym/696681L.cpp

@@ -0,0 +1,84 @@
+/**
+ * @file 696681L.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2026-06-06
+ *
+ * @copyright Copyright (c) 2026
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#ifndef LOCAL
+#define endl '\n'
+#endif
+
+bool mem1;
+
+#define maxn 200005
+
+using pll = pair<int64_t, int64_t>;
+
+class SegmentTree {
+   private:
+    pll a[maxn << 2];
+    int n;
+
+    pll merge(const pll& a, const pll& b) { return {a.first + b.first + a.second * b.second, a.second + b.second}; }
+    void build(int p, int l, int r, int v[]) {
+        if (l == r) return a[p] = {0, v[l]}, void();
+        int mid = (l + r) >> 1;
+        build(p << 1, l, mid, v), build(p << 1 | 1, mid + 1, r, v);
+        return a[p] = merge(a[p << 1], a[p << 1 | 1]), void();
+    }
+    pll query(int p, int l, int r, int ql, int qr) {
+        if (ql <= l && r <= qr) return a[p];
+        int mid = (l + r) >> 1;
+        if (qr <= mid) return query(p << 1, l, mid, ql, qr);
+        if (ql > mid) return query(p << 1 | 1, mid + 1, r, ql, qr);
+        return merge(query(p << 1, l, mid, ql, qr), query(p << 1 | 1, mid + 1, r, ql, qr));
+    }
+
+   public:
+    void resize(int _n) { return n = _n, void(); }
+    void build(int v[]) { return build(1, 1, n, v); }
+    pll query(int l, int r) { return query(1, 1, n, l, r); }
+};
+
+int v[maxn];
+
+void solve(void) {
+    int n, q;
+    cin >> n >> q;
+    for (int i = 1; i <= n; i++) cin >> v[i];
+
+    SegmentTree SGT;
+    SGT.resize(n), SGT.build(v);
+
+    while (q--) {
+        int l, r, S;
+        cin >> l >> r >> S;
+        pll res = SGT.query(l, r);
+        cout << (res.second > S ? -1 : res.first + res.second * (S - res.second)) << endl;
+    }
+
+    return;
+}
+
+bool mem2;
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+#ifdef LOCAL
+    cerr << "Memory Cost: " << abs(&mem1 - &mem2) / 1024. / 1024. << "MB" << endl;
+#endif
+
+    int _ = 1;
+    while (_--) solve();
+
+#ifdef LOCAL
+    cerr << "Time Cost: " << clock() * 1000. / CLOCKS_PER_SEC << "MS" << endl;
+#endif
+    return 0;
+}