seekworser's Library

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

Project maintained by seekworser Hosted on GitHub Pages — Theme by mattgraham

:warning: mo.hpp
(competitive/algorithm/mo.hpp)

うしさんだよーもーもー

Depends on

Code

#pragma once
#include "competitive/std/std.hpp"
template<typename Rev_t> struct Mo {
    int range_min, range_max;
    using query_t = tuple<int, int, int>;
    vector<query_t> query;
    Mo() {};
    Mo(const vector<pii>& lr) : range_min(INF), range_max(-INF) {
        rep(i, sz(lr)) {
            assert(lr[i].first <= lr[i].second);
            query.emplace_back(lr[i].first, lr[i].second, i);
            chmin((*this).range_min, lr[i].first);
            chmax((*this).range_max, lr[i].second);
        }
    }
    Mo(const vi& l, const vi& r) : range_min(INF), range_max(-INF) {
        assert(sz(l) == sz(r));
        rep(i, sz(l)) {
            assert(l[i] <= r[i]);
            query.emplace_back(l[i], r[i], i);
            chmin((*this).range_min, l[i]);
            chmax((*this).range_max, r[i]);
        }
    }
    void add_query(int l, int r) {
        (*this).query.emplace_back(l, r, sz((*this).query));
    }
    template<typename AL, typename AR, typename DL, typename DR, typename GET>
    vector<Rev_t> answer(
        const AL& add_left,
        const AR& add_right,
        const DL& delete_left,
        const DR& delete_right,
        const GET& get,
        int init_l = 0,
        int init_r = 0
    ) {
        assert(range_max >= range_min);
        int q = sz(query);
        int range = range_max - range_min;
        int width = max<int>(1, 1.0 * range / max<double>(1.0, sqrt(q * 2.0 / 3.0)));
        sort(all((*this).query), [&](query_t a, query_t b) {
            auto [la, ra, ida] = a;
            auto [lb, rb, idb] = b;
            int ablock = la / width, bblock = lb / width;
            if (ablock != bblock) return ablock < bblock;
            if (ablock & 1) return ra < rb;
            return ra > rb;
        });
        vector<Rev_t> rev(q);
        int cl(init_l), cr(init_r);
        rep(i, q) {
            auto [l, r, id] = query[i];
            while (cl > l) { cl--; add_left(cl); }
            while (cr < r) { add_right(cr); cr++;}
            while (cl < l) { delete_left(cl); cl++; }
            while (cr > r) { cr--; delete_right(cr); }
            rev[id] = get();
        }
        return rev;
    };
    template<typename A, typename D, typename GET>
    vector<Rev_t> answer(
        const A& add,
        const D& del,
        const GET& get,
        int init_l = 0,
        int init_r = 0
    ) {
        return (*this).answer(add, add, del, del, get, init_l, init_r);
    }
};
/**
 * @brief mo.hpp
 * @docs docs/algorithm/mo.md
 */
#line 2 "competitive/std/std.hpp"
#include <bits/stdc++.h>
#ifndef LOCAL_TEST
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // LOCAL_TEST
using namespace std;
// 型名の短縮
using ll = long long;
using pii = pair<int, int>; using pll = pair<ll, ll>;
using vi = vector<int>;  using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>;  using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;
template<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); }
template<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }
template<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); }
template <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;
// 定数の定義
constexpr double PI = 3.14159265358979323;
constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;
float EPS = 1e-8; double EPSL = 1e-16;
template<typename T> bool eq(const T x, const T y) { return x == y; }
template<> bool eq<double>(const double x, const double y) { return abs(x - y) < EPSL; }
template<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS; }
template<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); }
template<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); }
template<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); }
template<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); }
template<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); }
constexpr int MODINT998244353 = 998244353;
constexpr int MODINT1000000007 = 1000000007;
// 入出力高速化
struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;
// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((ll)(x).size())
#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0 から n-1 まで昇順
#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // 0 から n-1 まで昇順
#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // s から t まで昇順
#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // s から t まで stepずつ
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define repe(a, v) for(auto& a : (v)) // v の全要素（変更可能）
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod
#define sdiv(n, m) (((n) - smod(n, m)) / (m)) // 非負div
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
int Yes(bool b=true) { cout << (b ? "Yes\n" : "No\n"); return 0; };
int YES(bool b=true) { cout << (b ? "YES\n" : "NO\n"); return 0; };
int No(bool b=true) {return Yes(!b);};
int NO(bool b=true) {return YES(!b);};
template<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); };
template<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); };
template<typename T> T max(vector<T>& a) { return *max_element(all(a)); };
template<typename T> T min(vector<T>& a) { return *min_element(all(a)); };
template<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };
template<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };
template<typename T> bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; };

template <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }

// modでのpow
ll powm(ll a, ll n, ll mod=INFL) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = (res * a) % mod;
        if (n > 1) a = (a * a) % mod;
        n >>= 1;
    }
    return res;
}
// 整数Sqrt
ll sqrtll(ll x) {
    assert(x >= 0);
    ll rev = sqrt(x);
    while(rev * rev > x) --rev;
    while((rev+1) * (rev+1)<=x) ++rev;
    return rev;
}
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } // xのd進数桁数
/**
 * @brief std.hpp
 * @docs docs/std/std.md
 */
#line 3 "competitive/algorithm/mo.hpp"
template<typename Rev_t> struct Mo {
    int range_min, range_max;
    using query_t = tuple<int, int, int>;
    vector<query_t> query;
    Mo() {};
    Mo(const vector<pii>& lr) : range_min(INF), range_max(-INF) {
        rep(i, sz(lr)) {
            assert(lr[i].first <= lr[i].second);
            query.emplace_back(lr[i].first, lr[i].second, i);
            chmin((*this).range_min, lr[i].first);
            chmax((*this).range_max, lr[i].second);
        }
    }
    Mo(const vi& l, const vi& r) : range_min(INF), range_max(-INF) {
        assert(sz(l) == sz(r));
        rep(i, sz(l)) {
            assert(l[i] <= r[i]);
            query.emplace_back(l[i], r[i], i);
            chmin((*this).range_min, l[i]);
            chmax((*this).range_max, r[i]);
        }
    }
    void add_query(int l, int r) {
        (*this).query.emplace_back(l, r, sz((*this).query));
    }
    template<typename AL, typename AR, typename DL, typename DR, typename GET>
    vector<Rev_t> answer(
        const AL& add_left,
        const AR& add_right,
        const DL& delete_left,
        const DR& delete_right,
        const GET& get,
        int init_l = 0,
        int init_r = 0
    ) {
        assert(range_max >= range_min);
        int q = sz(query);
        int range = range_max - range_min;
        int width = max<int>(1, 1.0 * range / max<double>(1.0, sqrt(q * 2.0 / 3.0)));
        sort(all((*this).query), [&](query_t a, query_t b) {
            auto [la, ra, ida] = a;
            auto [lb, rb, idb] = b;
            int ablock = la / width, bblock = lb / width;
            if (ablock != bblock) return ablock < bblock;
            if (ablock & 1) return ra < rb;
            return ra > rb;
        });
        vector<Rev_t> rev(q);
        int cl(init_l), cr(init_r);
        rep(i, q) {
            auto [l, r, id] = query[i];
            while (cl > l) { cl--; add_left(cl); }
            while (cr < r) { add_right(cr); cr++;}
            while (cl < l) { delete_left(cl); cl++; }
            while (cr > r) { cr--; delete_right(cr); }
            rev[id] = get();
        }
        return rev;
    };
    template<typename A, typename D, typename GET>
    vector<Rev_t> answer(
        const A& add,
        const D& del,
        const GET& get,
        int init_l = 0,
        int init_r = 0
    ) {
        return (*this).answer(add, add, del, del, get, init_l, init_r);
    }
};
/**
 * @brief mo.hpp
 * @docs docs/algorithm/mo.md
 */
Back to top page