library/superstd/Set.hpp

• View this file on GitHub
• Last update: 2025-11-24 18:49:07+09:00
• Include: #include "library/superstd/Set.hpp"

Depends on

• build/pch/stdc++.hpp

Verified with

• test/library-checker/DataStructure/PredecessorProblem.test.cpp

Code

template <typename T> struct Set : std::set<T> {
    using std::set<T>::size;
    using std::set<T>::begin;
    using std::set<T>::rbegin;
    using std::set<T>::insert;
    using std::set<T>::erase;
    using std::set<T>::lower_bound;
    using std::set<T>::upper_bound;

    T mn() const {
        assert(size());
        return *begin();
    }
    T mx() const {
        assert(size());
        return *rbegin();
    }

    T pop_front() {
        assert(size());
        T mn = *begin();
        erase(begin());
        return mn;
    }
    T pop_back() {
        assert(size());
        T mx = *rbegin();
        erase(mx);
        return mx;
    }

    T lt(const T &a) const {
        assert(mn() < a);
        if (mx() < a)
            return mx();
        return *--lower_bound(a);
    }
    T leq(const T &a) const {
        assert(mn() <= a);
        if (mx() <= a)
            return mx();
        return *--upper_bound(a);
    }
    T gt(const T &a) const {
        assert(mx() > a);
        return *upper_bound(a);
    }
    T geq(const T &a) {
        assert(mx() >= a);
        return *lower_bound(a);
    }

    Set() = default;
    Set(const std::vector<T> &v) {
        for (const auto &p : v)
            insert(p);
    }

    void scan(int n) {
        while (n--) {
            T a;
            std::cin >> a;
            insert(a);
        }
    }

    void banpei() {
        insert(std::numeric_limits<T>::max() / 2);
        insert(std::numeric_limits<T>::min() / 2);
    }
};

#line 1 "library/superstd/Set.hpp"
template <typename T> struct Set : std::set<T> {
    using std::set<T>::size;
    using std::set<T>::begin;
    using std::set<T>::rbegin;
    using std::set<T>::insert;
    using std::set<T>::erase;
    using std::set<T>::lower_bound;
    using std::set<T>::upper_bound;

    T mn() const {
        assert(size());
        return *begin();
    }
    T mx() const {
        assert(size());
        return *rbegin();
    }

    T pop_front() {
        assert(size());
        T mn = *begin();
        erase(begin());
        return mn;
    }
    T pop_back() {
        assert(size());
        T mx = *rbegin();
        erase(mx);
        return mx;
    }

    T lt(const T &a) const {
        assert(mn() < a);
        if (mx() < a)
            return mx();
        return *--lower_bound(a);
    }
    T leq(const T &a) const {
        assert(mn() <= a);
        if (mx() <= a)
            return mx();
        return *--upper_bound(a);
    }
    T gt(const T &a) const {
        assert(mx() > a);
        return *upper_bound(a);
    }
    T geq(const T &a) {
        assert(mx() >= a);
        return *lower_bound(a);
    }

    Set() = default;
    Set(const std::vector<T> &v) {
        for (const auto &p : v)
            insert(p);
    }

    void scan(int n) {
        while (n--) {
            T a;
            std::cin >> a;
            insert(a);
        }
    }

    void banpei() {
        insert(std::numeric_limits<T>::max() / 2);
        insert(std::numeric_limits<T>::min() / 2);
    }
};

Back to top page