competitive-programing

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

View the Project on GitHub Astral-23/competitive-programing

:heavy_check_mark: verify/mo.test.cpp

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/static_range_inversions_query"

#include "../Utility/template.hpp"
#include "../Algorithm/Mo.hpp"
#include "../Datastructure/segtree.hpp"
using S = ll;
S op(S l, S r) {return l + r;}
S e() {return 0;}

ll ans = 0;
vec<ll> res;

int main() {
    int n, q;
    cin >> n >> q;
    res = vec<ll>(q);
    vec<ll> A(n);
    rep(i, 0, n) cin >> A[i];

    vec<ll> cmp = A;
    sort(all(cmp));
    cmp.erase(unique(all(cmp)), cmp.end());

    auto get = [&](int x) {
        return lower_bound(all(cmp), x) - cmp.begin();
    };

    segtree<S, op, e> seg(n);

    auto addL = [&](int id) {
        int i = get(A[id]);
        ans += seg.prod(0, i);
        seg.set(i, seg.get(i) + 1);
    };

    auto addR = [&](int id) {
        int i = get(A[id]);
        ans += seg.prod(i + 1, n);
        seg.set(i, seg.get(i) + 1);
    };

    auto delL = [&](int id) {
        int i = get(A[id]);
        seg.set(i, seg.get(i) - 1);
        ans -= seg.prod(0, i);
    };

    auto delR = [&](int id) {
        int i = get(A[id]);
        seg.set(i, seg.get(i) - 1);
        ans -= seg.prod(i + 1, n);
    };

    auto rem = [&](int id, int l, int r) {//id番目に格納された区間のクエリに対する答えをどうするか。
        res[id] = ans;
    };

    vec<pair<int, int>> qs;
    rep(i, 0, q) {
        int l, r;
        cin >> l >> r;
        qs.emplace_back(l, r);
    }

    Mo mo(n, qs);
    mo.run(addL, addR, delL, delR, rem);

    rep(i, 0, q) {
        cout << res[i] << '\n';
    }

}
#line 1 "verify/mo.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/static_range_inversions_query"

#line 1 "Utility/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)

#define TT template <typename T>
TT using vec = vector<T>;
template <class T1, class T2> bool chmin(T1 &x, T2 y) {
    return x > y ? (x = y, true) : false;
}
template <class T1, class T2> bool chmax(T1 &x, T2 y) {
    return x < y ? (x = y, true) : false;
}
struct io_setup {
    io_setup() {
        ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        cout << fixed << setprecision(15);
    }
} io_setup;

/*
@brief verify用テンプレート
*/
#line 1 "Algorithm/Mo.hpp"

struct Mo {
    int n, q;
    vec<pair<int, int>> qs;
    vec<int> qi;
    Mo(int n, vec<pair<int, int>> qs) : n(n), q(qs.size()), qs(qs) {   
        qi = vec<int>(q);
        iota(all(qi), 0);
        int width = max<int>(1, 1.0 * n / max(1.0, sqrt(q * 2.0 / 3.0)));
        sort(all(qi), [&](int i, int j) {
            if(qs[i].first/width != qs[j].first/width) {
                return qs[i].first < qs[j].first;
            }
            else {
                int g = qs[i].first / width;
                if(g % 2 == 0) {
                    return qs[i].second < qs[j].second;
                }
                else {
                    return qs[i].second > qs[j].second;
                }
            }
        });
    }
    
    template<class AL, class AR, class DL, class DR, class REM> void run(AL addL, AR addR, DL delL, DR delR, REM rem) {
        int l = 0, r = 0;
        for(int i : qi) {
            while(l > qs[i].first) addL(--l);
            while(l < qs[i].first) delL(l++);
            while(r < qs[i].second)addR(r++);
            while(r > qs[i].second)delR(--r);
            rem(i, l, r);            
        }
    }
};

/*
@brief Moアルゴリズム
*/
#line 1 "Datastructure/segtree.hpp"
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
    int n;
    int sz;
    vector<S> d;

    segtree(int n) : segtree(vector<S>(n, e())) {}

    segtree(const vector<S> &v) : n((int)v.size()), sz(1) {
        while(sz < n) sz <<= 1;
        d.resize(2*sz, e());
        rep(i, 0, n) {
            d[sz+i] = v[i];
        }
        rrep(i, 1, sz) d[i] = op(d[i<<1], d[i<<1|1]);
    }

    void set(int p, S x) {
        assert(0 <= p && p < n);
        p += sz;
        d[p] = x;
        while(p > 1) {
            p >>= 1;
            d[p] = op(d[p<<1], d[p<<1|1]);
        }
    }

    S get(int p) const {
        assert(0 <= p && p < n);
        return d[p + sz];
    }

    S prod(int l, int r) const {
        assert(0 <= l && l <= r && r <= n);
        S sml = e(), smr = e();
        l += sz;
        r += sz;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() const { return d[1]; }

    template <class F> int max_right(int l, F f) const {
        assert(0 <= l && l <= n);
        assert(f(e()));
        if (l == n) return n;
        l += sz;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < sz) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - sz;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return n;
    }

    template <class F> int min_left(int r, F f) const {
        assert(0 <= r && r <= n);
        assert(f(e()));
        if (r == 0) return 0;
        r += sz;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < sz) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - sz;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
    
};
/*
@brief segtree
@docs doc/segtree.md
*/
#line 6 "verify/mo.test.cpp"
using S = ll;
S op(S l, S r) {return l + r;}
S e() {return 0;}

ll ans = 0;
vec<ll> res;

int main() {
    int n, q;
    cin >> n >> q;
    res = vec<ll>(q);
    vec<ll> A(n);
    rep(i, 0, n) cin >> A[i];

    vec<ll> cmp = A;
    sort(all(cmp));
    cmp.erase(unique(all(cmp)), cmp.end());

    auto get = [&](int x) {
        return lower_bound(all(cmp), x) - cmp.begin();
    };

    segtree<S, op, e> seg(n);

    auto addL = [&](int id) {
        int i = get(A[id]);
        ans += seg.prod(0, i);
        seg.set(i, seg.get(i) + 1);
    };

    auto addR = [&](int id) {
        int i = get(A[id]);
        ans += seg.prod(i + 1, n);
        seg.set(i, seg.get(i) + 1);
    };

    auto delL = [&](int id) {
        int i = get(A[id]);
        seg.set(i, seg.get(i) - 1);
        ans -= seg.prod(0, i);
    };

    auto delR = [&](int id) {
        int i = get(A[id]);
        seg.set(i, seg.get(i) - 1);
        ans -= seg.prod(i + 1, n);
    };

    auto rem = [&](int id, int l, int r) {//id番目に格納された区間のクエリに対する答えをどうするか。
        res[id] = ans;
    };

    vec<pair<int, int>> qs;
    rep(i, 0, q) {
        int l, r;
        cin >> l >> r;
        qs.emplace_back(l, r);
    }

    Mo mo(n, qs);
    mo.run(addL, addR, delL, delR, rem);

    rep(i, 0, q) {
        cout << res[i] << '\n';
    }

}
Back to top page