test/yukicoder/0618.test.cpp

• View this file on GitHub
• Last update: 2026-03-15 18:07:20+09:00
• Problem: https://yukicoder.me/problems/no/618

Depends on

• 座標圧縮 (lib/algorithm/compress.hpp)
• lib/segtree/monoid.hpp
• セグメント木 (lib/segtree/segment_tree.hpp)

Code

// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/618
#include <algorithm>
#include <cstdint>
#include <iostream>
#include <limits>
#include <vector>
#include "algorithm/compress.hpp"
#include "segtree/segment_tree.hpp"

struct S {
    std::int64_t x, s;
};

struct M {
    using T = S;
    using value_type = T;
    static constexpr T id() {
        return T(std::numeric_limits<std::int64_t>::max() / 2, 0);
    }
    static constexpr T op(const T& lhs, const T& rhs) {
        return S{std::min(lhs.x, rhs.x), lhs.s + rhs.s};
    }
};

int main(void) {
    int q;
    std::cin >> q;
    std::vector<int> t(q), x(q);
    for (int i = 0; i < q; ++i) std::cin >> t[i] >> x[i];

    std::int64_t s = 0;
    std::vector<std::int64_t> a;
    for (int i = 0; i < q; ++i) {
        if (t[i] == 1)
            a.emplace_back(x[i] - s);
        else if (t[i] == 3)
            s += x[i];
    }

    s = 0;
    coordinate_compression cps(a);
    segment_tree<M> st(cps.size());
    std::vector<std::int64_t> c;
    for (int i = 0; i < q; ++i) {
        if (t[i] == 1) {
            int k = cps.get(x[i] - s);
            c.emplace_back(x[i] - s);
            st.set(k, S{x[i] - s, st.get(k).s + 1});
        } else if (t[i] == 2) {
            int k = cps.get(c[x[i] - 1]);
            st.set(k, S{c[x[i] - 1], st.get(k).s - 1});
        } else {
            s += x[i];
        }
        auto f = [&](S y) {
            return y.x + s >= y.s;
        };
        int k = st.min_left(f);
        auto t = st.prod(k, cps.size());
        std::int64_t ans = std::min(t.x + s, t.s);
        if (k > 0) {
            t = st.prod(k - 1, cps.size());
            ans = std::max(ans, std::min(t.x + s, t.s));
        }
        std::cout << ans << '\n';
    }

    return 0;
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/resolver.py", line 291, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 242, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 479, in update
    self._resolve(pathlib.Path(included), included_from=path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 286, in _resolve
    raise BundleErrorAt(path, -1, "no such header")
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: algorithm/compress.hpp: line -1: no such header

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample	AC	2 ms	3 MB
g++	01_sample	AC	2 ms	4 MB
g++	02_sample	AC	2 ms	3 MB
g++	03_sample	AC	2 ms	3 MB
g++	random00	AC	3 ms	4 MB
g++	random01	AC	3 ms	4 MB
g++	random02	AC	2 ms	4 MB
g++	random03	AC	2 ms	4 MB
g++	random04	AC	2 ms	4 MB
g++	random05	AC	2 ms	4 MB
g++	random06	AC	3 ms	4 MB
g++	random07	AC	2 ms	4 MB
g++	random08	AC	2 ms	3 MB
g++	random09	AC	3 ms	4 MB
g++	random10	AC	2 ms	3 MB
g++	random11	AC	3 ms	4 MB
g++	random12	AC	3 ms	4 MB
g++	random13	AC	2 ms	3 MB
g++	random14	AC	3 ms	4 MB
g++	random15	AC	73 ms	7 MB
g++	random16	AC	75 ms	7 MB
g++	random17	AC	74 ms	7 MB
g++	random18	AC	74 ms	7 MB
g++	random19	AC	73 ms	7 MB
g++	random20	AC	74 ms	7 MB
g++	random21	AC	75 ms	7 MB
g++	random22	AC	74 ms	7 MB
g++	random23	AC	77 ms	7 MB
g++	random24	AC	74 ms	7 MB
g++	random25	AC	74 ms	7 MB
g++	random26	AC	75 ms	7 MB
g++	random27	AC	76 ms	7 MB
g++	random28	AC	75 ms	7 MB
g++	random29	AC	75 ms	7 MB
g++	random30	AC	94 ms	12 MB
g++	random31	AC	86 ms	12 MB
g++	random32	AC	52 ms	6 MB
g++	random33	AC	76 ms	8 MB
g++	random34	AC	2 ms	4 MB

Back to top page