cp-documentation

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub zawa-tin/cp-documentation

:heavy_check_mark: Test/AtCoder/abc430_g.test.cpp

Depends on

Code

// #define PROBLEM "https://atcoder.jp/contests/abc430/tasks/abc430_g"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/2/ITP1/1/ITP1_1_A"

/*
    AtCoder Beginner Contest 430 G - Range Set Modifying Query
    https://atcoder.jp/contests/abc430/submissions/70642359
 */

#include "../../Src/DataStructure/Other/RangeAssigner.hpp"
#include "../../Src/DataStructure/SegmentTree/LazySegmentTree.hpp"
#include "../../Src/Algebra/Group/AdditiveGroup.hpp"
using namespace zawa;
#include <cassert>
#include <iostream>
#include <utility>
using namespace std;
struct MAX {
    using Element = pair<int, int>;
    static Element identity() {
        return {-1, 0};
    }
    static Element operation(Element L, Element R) {
        if (L.first < R.first)
            swap(L, R);
        if (L.first == R.first)
            L.second += R.second;
        return L;
    }
};
struct ACT {
    using ValueMonoid = MAX;
    using OperatorMonoid = AdditiveGroup<int>;
    static ValueMonoid::Element mapping(ValueMonoid::Element v, OperatorMonoid::Element o) {
        v.first += o;
        return v;
    }
};
int main() {
#ifdef ATCODER
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    int N, Q;
    cin >> N >> Q;
    vector rg(60, RangeAssigner<int, bool>(N, false));
    LazySegmentTree<ACT> seg(vector<MAX::Element>(N, {0, 1}));
    while (Q--) {
        int T, L, R;
        cin >> T >> L >> R;
        L--;
        if (T == 1) {
            int x;
            cin >> x;
            for (auto [l, r, v] : rg[x - 1].assign(L, R, true)) {
                if (v == false)
                    seg.operation(l, r, 1);
            }
        }
        else if (T == 2) {
            int x;
            cin >> x;
            for (auto [l, r, v] : rg[x - 1].assign(L, R, false)) {
                if (v == true)
                    seg.operation(l, r, -1);
            }
        }
        else if (T == 3) {
            auto [x, y] = seg.product(L, R);
            cout << x << ' ' << y << '\n';
        }
        else
            assert(0);
    }
#else
    cout << "Hello World\n";
#endif
}
#line 1 "Test/AtCoder/abc430_g.test.cpp"
// #define PROBLEM "https://atcoder.jp/contests/abc430/tasks/abc430_g"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/2/ITP1/1/ITP1_1_A"

/*
    AtCoder Beginner Contest 430 G - Range Set Modifying Query
    https://atcoder.jp/contests/abc430/submissions/70642359
 */

#line 2 "Src/DataStructure/Other/RangeAssigner.hpp"

#include <algorithm>
#include <cassert>
#include <concepts>
#include <utility>
#include <map>
#include <vector>

namespace zawa {

template <std::integral Z, class T>
class RangeAssigner {
public:

    RangeAssigner() = default;

    RangeAssigner(Z n, T init)
        : m_min{0}, m_max{n} {
        m_mp[0] = {n, init};
    }

    RangeAssigner(Z min, Z max, T init) 
        : m_min{min}, m_max{max} {
        assert(min <= max);
        m_mp[m_min] = {max, init};
    }

    std::vector<std::tuple<Z, Z, T>> operator()(Z l, Z r) const {
        assert(m_min <= l and l <= r and r <= m_max);
        std::vector<std::tuple<Z, Z, T>> res;
        for (auto it = prev(m_mp.upper_bound(l)) ; it != m_mp.end() and it->first < r ; it++)
            res.emplace_back(std::max(it->first, l), std::min(it->second.first, r), it->second.second);
        return res;
    }

    std::vector<std::tuple<Z, Z, T>> assign(Z l, Z r, T v) {
        assert(m_min <= l and l <= r and r <= m_max);
        std::vector<std::tuple<Z, Z, T>> res;
        {
            auto it = prev(m_mp.upper_bound(l));
            const Z L = it->first, R = it->second.first;
            const T V = it->second.second;
            it->second.first = L;
            m_mp.erase(it);
            if (L < l)
                m_mp[L] = {l, V};
            res.emplace_back(l, std::min(r, R), V);
            if (r < R)
                m_mp[r] = {R, V};
            if (r <= R) {
                m_mp[l] = {r, v};
                return res;
            }
        }
        auto it = m_mp.upper_bound(l);
        for ( ; it != m_mp.end() and it->second.first <= r ; it = m_mp.erase(it))
            res.emplace_back(it->first, it->second.first, it->second.second);
        if (it != m_mp.end() and r < it->second.first) {
            const Z L = it->first, R = it->second.first;
            const T V = it->second.second;
            it = m_mp.erase(it);
            res.emplace_back(L, r, V);
            m_mp[r] = {R, V};
        }
        m_mp[l] = {r, v};
        return res;
    }

private:

    std::map<Z, std::pair<Z, T>> m_mp;

    Z m_min, m_max;

};

} // namespace zawa
#line 2 "Src/DataStructure/SegmentTree/LazySegmentTree.hpp"

#line 2 "Src/Template/TypeAlias.hpp"

#include <cstdint>
#include <cstddef>

namespace zawa {

using i16 = std::int16_t;
using i32 = std::int32_t;
using i64 = std::int64_t;
using i128 = __int128_t;

using u8 = std::uint8_t;
using u16 = std::uint16_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;

using usize = std::size_t;

} // namespace zawa
#line 2 "Src/DataStructure/SegmentTree/SegmentTreeConcept.hpp"

#line 2 "Src/Algebra/Monoid/MonoidConcept.hpp"

#line 2 "Src/Algebra/Semigroup/SemigroupConcept.hpp"

#line 4 "Src/Algebra/Semigroup/SemigroupConcept.hpp"

namespace zawa {

namespace concepts {

template <class T>
concept Semigroup = requires {
    typename T::Element;
    { T::operation(std::declval<typename T::Element>(), std::declval<typename T::Element>()) } -> std::same_as<typename T::Element>;
};

} // namespace concepts

} // namespace zawa
#line 4 "Src/Algebra/Monoid/MonoidConcept.hpp"

#line 6 "Src/Algebra/Monoid/MonoidConcept.hpp"

namespace zawa {

namespace concepts {

template <class T>
concept Identitiable = requires {
    typename T::Element;
    { T::identity() } -> std::same_as<typename T::Element>;
};

template <class T>
concept Monoid = Semigroup<T> and Identitiable<T>;

} // namespace

} // namespace zawa
#line 4 "Src/DataStructure/SegmentTree/SegmentTreeConcept.hpp"

namespace zawa {

namespace concepts {

template <class T>
concept MonoidWithAction = requires {
    requires Monoid<typename T::ValueMonoid>;
    requires Monoid<typename T::OperatorMonoid>;
    { T::mapping(
            std::declval<typename T::ValueMonoid::Element>(),
            std::declval<typename T::OperatorMonoid::Element>()
            ) } -> std::same_as<typename T::ValueMonoid::Element>; 
};

} // namespace concepts

} // namespace zawa
#line 5 "Src/DataStructure/SegmentTree/LazySegmentTree.hpp"

#line 7 "Src/DataStructure/SegmentTree/LazySegmentTree.hpp"
#include <bit>
#line 9 "Src/DataStructure/SegmentTree/LazySegmentTree.hpp"
#include <ranges>
#include <tuple>
#line 12 "Src/DataStructure/SegmentTree/LazySegmentTree.hpp"

namespace zawa {

template <concepts::MonoidWithAction S>
class LazySegmentTree {
public:

    using VM = S::ValueMonoid;

    using V = typename VM::Element;

    using OM = S::OperatorMonoid;

    using O = typename OM::Element;

    LazySegmentTree() = default;

    explicit LazySegmentTree(usize n) 
        : m_n{n}, m_sz{1u << (std::bit_width(n))}, m_dat(m_sz << 1, VM::identity()), m_lazy(m_sz << 1, OM::identity()) {}

    explicit LazySegmentTree(const std::vector<V>& a)
        : m_n{a.size()}, m_sz{1u << (std::bit_width(a.size()))}, m_dat(m_sz << 1, VM::identity()), m_lazy(m_sz << 1, OM::identity()) {
        std::ranges::copy(a, m_dat.begin() + inner_size());
        for (usize i = inner_size() ; --i ; ) recalc(i);
    }

    [[nodiscard]] inline usize size() const noexcept {
        return m_n;
    }

    [[nodiscard]] V operator[](usize i) {
        assert(i < size());
        return get(i, 1, 0, inner_size());
    }

    [[nodiscard]] V get(usize i) {
        return (*this)[i];
    }

    [[nodiscard]] V product(usize l, usize r) {
        assert(l <= r and r <= size());
        return product(l, r, 1, 0, inner_size());
    }

    void operation(usize l, usize r, const O& o) {
        assert(l <= r and r <= size());
        return operation(l, r, o, 1, 0, inner_size());
    }

    void assign(usize i, const V& v) {
        assert(i < size());
        assign(i, v, 1, 0, inner_size());
    }

    void operation(usize i, const O& o) {
        assert(i < size());
        operation(i, o, 1, 0, inner_size());
    }

private:

    using NodeInfo = std::tuple<usize, usize, usize>;

public:

    template <class F>
    requires std::predicate<F, V>
    usize maxRight(usize l, F f) {
        assert(l <= size());
        if (!f(VM::identity())) return l;
        if (l == size()) return size();
        std::vector<NodeInfo> ranges;
        partition_range(l, size(), ranges, 1, 0, inner_size());
        V prod = VM::identity();
        for (auto [nd, nl, nr] : ranges) {
            if (!f(VM::operation(prod, m_dat[nd]))) {
                return maxRight(f, prod, nd, nl, nr);
            }
            else {
                prod = VM::operation(prod, m_dat[nd]);
            }
        }
        return size();
    }

    template <class F>
    requires std::predicate<F, V>
    usize minLeft(usize r, F f) {
        assert(r <= size());
        if (!f(VM::identity())) return r;
        if (!r) return 0;
        std::vector<NodeInfo> ranges;
        partition_range(0, r, ranges, 1, 0, inner_size());
        V prod = VM::identity();
        for (auto [nd, nl, nr] : ranges | std::views::reverse) {
            if (!f(VM::operation(m_dat[nd], prod))) {
                return minLeft(f, prod, nd, nl, nr);
            }
            else {
                prod = VM::operation(prod, m_dat[nd]);
            }
        }
        return 0;
    }

private:

    usize m_n{}, m_sz{};

    std::vector<V> m_dat;

    std::vector<O> m_lazy;

    inline usize inner_size() const noexcept {
        return m_sz;
    }
    
    void recalc(usize nd) {
        // assert(nd < inner_size());
        m_dat[nd] = VM::operation(m_dat[nd << 1 | 0], m_dat[nd << 1 | 1]);
    }

    void propagate(usize nd) {
        // assert(nd < inner_size());
        for (usize ch : {nd << 1 | 0, nd << 1 | 1}) {
            m_dat[ch] = S::mapping(m_dat[ch], m_lazy[nd]);
            m_lazy[ch] = OM::operation(m_lazy[ch], m_lazy[nd]);
        }
        m_lazy[nd] = OM::identity();
    }

    V product(usize ql, usize qr, usize nd, usize nl, usize nr) {
        if (qr <= nl or nr <= ql) return VM::identity();
        if (ql <= nl and nr <= qr) return m_dat[nd];
        propagate(nd);
        const usize m = (nl + nr) >> 1;
        return VM::operation(
                product(ql, qr, nd << 1 | 0, nl, m),
                product(ql, qr, nd << 1 | 1, m, nr)
                );
    }

    V get(usize i, usize nd, usize nl, usize nr) {
        if (nd >= inner_size()) return m_dat[nd];
        propagate(nd);
        const usize m = (nl + nr) >> 1;
        return i < m ? get(i, nd << 1 | 0, nl, m) : get(i, nd << 1 | 1, m, nr);
    }

    void operation(usize ql, usize qr, const O& o, usize nd, usize nl, usize nr) {
        if (qr <= nl or nr <= ql) return;
        if (ql <= nl and nr <= qr) {
            m_dat[nd] = S::mapping(m_dat[nd], o);
            m_lazy[nd] = OM::operation(m_lazy[nd], o);
            return;
        }
        propagate(nd);
        const usize m = (nl + nr) >> 1;
        operation(ql, qr, o, nd << 1 | 0, nl, m);
        operation(ql, qr, o, nd << 1 | 1, m, nr);
        recalc(nd);
    }

    void operation(usize i, const O& o, usize nd, usize nl, usize nr) {
        if (nl == i and i + 1 == nr) {
            m_dat[nd] = S::mapping(m_dat[nd], o);
            return;
        }
        propagate(nd); 
        const usize m = (nl + nr) >> 1;
        i < m ? operation(i, o, nd << 1 | 0, nl, m) : operation(i, o, nd << 1 | 1, m, nr);
        recalc(nd);
    }

    void assign(usize i, const V& v, usize nd, usize nl, usize nr) {
        if (nl == i and i + 1 == nr) {
            m_dat[nd] = v;
            return;
        }
        propagate(nd); 
        const usize m = (nl + nr) >> 1;
        i < m ? assign(i, v, nd << 1 | 0, nl, m) : assign(i, v, nd << 1 | 1, m, nr);
        recalc(nd);
    }

    void partition_range(usize ql, usize qr, std::vector<NodeInfo>& res, usize nd, usize nl, usize nr) {
        if (qr <= nl or nr <= ql) return;
        if (ql <= nl and nr <= qr) {
            res.emplace_back(nd, nl, nr);
            return;
        }
        propagate(nd);
        const usize m = (nl + nr) >> 1;
        partition_range(ql, qr, res, nd << 1 | 0, nl, m);
        partition_range(ql, qr, res, nd << 1 | 1, m, nr);
    }

    template <class F>
    requires std::predicate<F, V>
    usize maxRight(F f, const V& prod, usize nd, usize nl, usize nr) {
        if (nd >= inner_size()) return nl;
        propagate(nd);
        const usize m = (nl + nr) >> 1, lch = nd << 1 | 0, rch = nd << 1 | 1;
        return f(VM::operation(prod, m_dat[lch])) ? 
            maxRight(f, VM::operation(prod, m_dat[lch]), rch, m, nr) : maxRight(f, prod, lch, nl, m);
    }

    template <class F>
    requires std::predicate<F, V>
    usize minLeft(F f, const V& prod, usize nd, usize nl, usize nr) {
        if (nd >= inner_size()) return nr;
        propagate(nd);
        const usize m = (nl + nr) >> 1, lch = nd << 1 | 0, rch = nd << 1 | 1;
        return f(VM::operation(m_dat[rch], prod)) ? 
            minLeft(f, VM::operation(m_dat[rch], prod), lch, nl, m) : minLeft(f, prod, rch, m, nr);
    }
};

} // namespace zawa
#line 2 "Src/Algebra/Group/AdditiveGroup.hpp"

namespace zawa {

template <class T>
class AdditiveGroup {
public:
    using Element = T;
    static constexpr T identity() noexcept {
        return T{};
    }
    static constexpr T operation(const T& l, const T& r) noexcept {
        return l + r;
    }
    static constexpr T inverse(const T& v) noexcept {
        return -v;
    }
};

} // namespace zawa
#line 12 "Test/AtCoder/abc430_g.test.cpp"
using namespace zawa;
#line 14 "Test/AtCoder/abc430_g.test.cpp"
#include <iostream>
#line 16 "Test/AtCoder/abc430_g.test.cpp"
using namespace std;
struct MAX {
    using Element = pair<int, int>;
    static Element identity() {
        return {-1, 0};
    }
    static Element operation(Element L, Element R) {
        if (L.first < R.first)
            swap(L, R);
        if (L.first == R.first)
            L.second += R.second;
        return L;
    }
};
struct ACT {
    using ValueMonoid = MAX;
    using OperatorMonoid = AdditiveGroup<int>;
    static ValueMonoid::Element mapping(ValueMonoid::Element v, OperatorMonoid::Element o) {
        v.first += o;
        return v;
    }
};
int main() {
#ifdef ATCODER
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    int N, Q;
    cin >> N >> Q;
    vector rg(60, RangeAssigner<int, bool>(N, false));
    LazySegmentTree<ACT> seg(vector<MAX::Element>(N, {0, 1}));
    while (Q--) {
        int T, L, R;
        cin >> T >> L >> R;
        L--;
        if (T == 1) {
            int x;
            cin >> x;
            for (auto [l, r, v] : rg[x - 1].assign(L, R, true)) {
                if (v == false)
                    seg.operation(l, r, 1);
            }
        }
        else if (T == 2) {
            int x;
            cin >> x;
            for (auto [l, r, v] : rg[x - 1].assign(L, R, false)) {
                if (v == true)
                    seg.operation(l, r, -1);
            }
        }
        else if (T == 3) {
            auto [x, y] = seg.product(L, R);
            cout << x << ' ' << y << '\n';
        }
        else
            assert(0);
    }
#else
    cout << "Hello World\n";
#endif
}
Back to top page