Petrozavodsk Winter 2025. Day 3. K-ontest 1

Author: Macesuted

QOJ/10537.cpp

@@ -101,4 +101,6 @@ int main() {
 #ifdef LOCAL
     cerr << "Time Cost: " << clock() * 1000. / CLOCKS_PER_SEC << "MS" << endl;
 #endif
-    return 0
+
+    return 0;
+}

QOJ/10867.cpp

@@ -0,0 +1,116 @@
+/**
+ * @file 10867.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2025-10-10
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+#define maxn 250005
+
+class SegmentTree {
+   private:
+    int a[maxn << 2], n;
+
+    void pushDown(int p) {
+        if (!a[p]) return;
+        a[p << 1] = max(a[p << 1], a[p]), a[p << 1 | 1] = max(a[p << 1 | 1], a[p]);
+        a[p] = 0;
+        return;
+    }
+    void insert(int p, int l, int r, int qp) {
+        if (l == r) return a[p] = 0, void();
+        pushDown(p);
+        int mid = (l + r) >> 1;
+        return qp <= mid ? insert(p << 1, l, mid, qp) : insert(p << 1 | 1, mid + 1, r, qp);
+    }
+    int erase(int p, int l, int r, int qp) {
+        if (l == r) return a[p];
+        pushDown(p);
+        int mid = (l + r) >> 1;
+        return qp <= mid ? erase(p << 1, l, mid, qp) : erase(p << 1 | 1, mid + 1, r, qp);
+    }
+    void update(int p, int l, int r, int ql, int qr, int v) {
+        if (ql <= l && r <= qr) return a[p] = max(a[p], v), void();
+        pushDown(p);
+        int mid = (l + r) >> 1;
+        if (ql <= mid) update(p << 1, l, mid, ql, qr, v);
+        if (qr > mid) update(p << 1 | 1, mid + 1, r, ql, qr, v);
+        return;
+    }
+
+   public:
+    void resize(int _n) { return n = _n, void(); }
+    void insert(int p) { return insert(1, 1, n, p); }
+    int erase(int p) { return erase(1, 1, n, p); }
+    void update(int l, int r, int v) { return update(1, 1, n, l, r, v); }
+} SGT;
+
+int a[maxn], dep[maxn], fa[maxn], son[maxn], top[maxn], siz[maxn], dfni[maxn], ans[maxn];
+vector<int> t1[maxn], t2[maxn];
+
+void dfs1(int p, int pre = 0) {
+    siz[p] = 1, fa[p] = pre;
+    for (auto q : t2[p])
+        if (q != pre) {
+            dep[q] = dep[p] + 1, dfs1(q, p), siz[p] += siz[q];
+            if (!son[p] || siz[q] > siz[son[p]]) son[p] = q;
+        }
+    return;
+}
+int dfnt = 0;
+void dfs2(int p, int t) {
+    dfni[p] = ++dfnt, top[p] = t;
+    if (son[p]) dfs2(son[p], t);
+    for (auto q : t2[p])
+        if (q != son[p] && q != fa[p]) dfs2(q, q);
+    return;
+}
+void dfs3(int p, int pre = 0) {
+    SGT.insert(dfni[p]);
+
+    int x = p;
+    while (top[x] != 1) SGT.update(dfni[top[x]], dfni[x], a[p]), x = fa[top[x]];
+    SGT.update(1, dfni[x], a[p]);
+
+    for (auto q : t1[p])
+        if (q != pre) dfs3(q, p);
+
+    ans[p] = SGT.erase(dfni[p]);
+
+    return;
+}
+
+void solve(void) {
+    int n;
+    cin >> n;
+    for (int i = 1; i <= n; i++) cin >> a[i];
+    for (int i = 1, x, y; i < n; i++) cin >> x >> y, t1[x].push_back(y), t1[y].push_back(x);
+    for (int i = 1, x, y; i < n; i++) cin >> x >> y, t2[x].push_back(y), t2[y].push_back(x);
+
+    dfs1(1);
+    dfs2(1, 1);
+
+    SGT.resize(n);
+
+    dfs3(1);
+
+    for (int i = 1; i <= n; i++) cout << ans[i] << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    while (_--) solve();
+
+    return 0;
+}

QOJ/10868.cpp

@@ -0,0 +1,42 @@
+/**
+ * @file 10868.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2025-10-10
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+#define maxn 1000005
+
+int f[maxn];
+
+void solve(void) {
+    int n;
+    string s;
+    cin >> n >> s;
+    for (int i = 1; i <= n; i++) f[i] = f[i - 1] + (s[i - 1] == 'H');
+
+    for (int i = 1; i <= n; i++) {
+        int p = 0, ans = 0;
+        while (i + f[p] <= n && p < i + f[p]) p = i + f[p], ans++;
+        cout << ans << ' ';
+    }
+    cout << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    while (_--) solve();
+
+    return 0;
+}

QOJ/10874.cpp

@@ -0,0 +1,109 @@
+/**
+ * @file 10874.cpp
+ * @author Macesuted (i@macesuted.moe)
+ * @date 2025-10-10
+ *
+ * @copyright Copyright (c) 2025
+ *
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+
+#define maxn 500005
+
+using pli = pair<int64_t, int>;
+
+int h[2][maxn], f[maxn], indeg[maxn], id[maxn];
+bool valid[maxn], vis[maxn];
+vector<int> graph[maxn];
+
+void solve(void) {
+    vector<int64_t> pos;
+    vector<pli> poss[2];
+    pos.push_back(0);
+    for (int t = 0, m; t < 2; t++) {
+        cin >> m;
+        int64_t pre = 0;
+        for (int i = 1, w, h; i <= m; i++) cin >> w >> h, pos.push_back(pre += w), poss[t].emplace_back(pre, h);
+    }
+
+    sort(pos.begin(), pos.end());
+    int n = unique(pos.begin(), pos.end()) - pos.begin() - 1;
+
+    for (int t = 1; ~t; t--)
+        for (int j = 1, k = 0; j <= n; j++) {
+            while (poss[t][k].first < pos[j]) k++;
+            h[t][j] = poss[t][k].second, id[j] = k + 1;
+        }
+
+    for (int i = 1; i <= n; i++) valid[i] = (h[0][i] == h[1][i]);
+
+    f[0] = INT_MAX;
+    for (int i = 1; i <= n; i++) {
+        f[i] = min(f[i - 1], h[1][i]);
+        if (h[0][i] == f[i])
+            f[i] = INT_MAX;
+        else
+            valid[i] = false;
+    }
+
+    f[n + 1] = INT_MAX;
+    for (int i = n; i >= 1; i--) {
+        f[i] = min(f[i + 1], h[1][i]);
+        if (h[0][i] == f[i])
+            f[i] = INT_MAX;
+        else
+            valid[i] = false;
+    }
+
+    for (int i = 1; i <= n; i++) {
+        if (!h[1][i]) continue;
+        if (i - 1 >= 1 && h[1][i - 1] <= h[1][i]) graph[i].push_back(i - 1), indeg[i - 1]++;
+        if (i + 1 <= n && h[1][i + 1] <= h[1][i]) graph[i].push_back(i + 1), indeg[i + 1]++;
+    }
+
+    vector<int> nodes;
+    for (int i = 1; i <= n; i++)
+        if (valid[i] && h[1][i]) nodes.push_back(i);
+    sort(nodes.begin(), nodes.end(), [&](int x, int y) { return h[1][x] > h[1][y]; });
+
+    vector<int> ans;
+    for (auto p : nodes) {
+        if (vis[p]) continue;
+
+        ans.push_back(p);
+        vis[p] = true;
+
+        for (int i = p - 1, v = h[0][p]; i >= 1 && !vis[i] && h[1][i]; i--)
+            if ((v = min(v, h[0][i])) == h[1][i])
+                vis[i] = true;
+            else
+                break;
+        for (int i = p + 1, v = h[0][p]; i <= n && !vis[i] && h[1][i]; i++)
+            if ((v = min(v, h[0][i])) == h[1][i])
+                vis[i] = true;
+            else
+                break;
+    }
+
+    for (int i = 1; i <= n; i++)
+        if (h[1][i] && !vis[i]) return cout << -1 << endl, void();
+
+    cout << ans.size() << endl;
+    for (auto x : ans) cout << id[x] << ' ';
+    cout << endl;
+
+    return;
+}
+
+int main() {
+    ios::sync_with_stdio(false), cin.tie(nullptr);
+
+    int _ = 1;
+    while (_--) solve();
+
+    return 0;
+}