noya2_Library

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

View the Project on GitHub noya2ruler/noya2_Library

:heavy_check_mark: test/misc/StaticRangeModeQuery.test.cpp

Depends on

Code

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

#include"../../template/template.hpp"
#include"../../misc/static_range_mode_query.hpp"
#include"../../data_structure/compress.hpp"

int main(){
    int n, q; in(n,q);
    vector<int> a(n); in(a);
    compress<int> cp(a);
    rep(i,n){
        a[i] = cp.id(a[i]);
    }
    static_range_mode_query srmq(a);
    while (q--){
        int l, r; in(l,r);
        auto [id, ma] = srmq.prod(l,r);
        id = cp.raw(id);
        out(id,ma);
    }
}
#line 1 "test/misc/StaticRangeModeQuery.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/static_range_mode_query"

#line 2 "template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "template/utils.hpp"

#line 6 "template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "misc/static_range_mode_query.hpp"

#line 6 "misc/static_range_mode_query.hpp"

namespace noya2 {

struct static_range_mode_query {
    const int w = 320;
    std::vector<int> a;
    std::vector<std::vector<int>> ids;
    std::vector<std::vector<std::pair<int,int>>> pre;
    std::vector<int> pos;
    std::vector<int> buf;
    // a[i] in [0, n), n = a.size()
    static_range_mode_query (const std::vector<int> _a) : a(_a), ids(_a.size()) {
        int n = a.size(), sz = n / w;
        pos.resize(n);
        ids.resize(n);
        for (int i = 0; i < n; i++){
            assert(0 <= a[i] && a[i] < n);
            pos[i] = ids[a[i]].size();
            ids[a[i]].emplace_back(i);
        }
        pre.resize((sz+1),std::vector<std::pair<int,int>>(sz+1));
        for (int l = 0; l < sz; l++){
            std::vector<int> cnt(n,0);
            int ma = -1, id = -1;
            for (int r = l+1; r <= sz; r++){
                for (int i = (r-1)*w; i < r*w; i++){
                    if (++cnt[a[i]] > ma){
                        ma = cnt[a[i]];
                        id = a[i];
                    }
                }
                pre[l][r] = {id, ma};
            }
        }
        buf.resize(n, 0);
    }
    std::pair<int,int> prod_naive(int l, int r){
        int ma = -1, id = -1;
        for (int i = l; i < r; i++){
            if (++buf[a[i]] > ma){
                ma = buf[a[i]];
                id = a[i];
            }
        }
        for (int i = l; i < r; i++){
            --buf[a[i]];
        }
        return {id, ma};
    }
    std::pair<int,int> prod(int l, int r){
        assert(0 <= l && l < r && r <= (int)(a.size()));
        // li = ceil(l / w), ri = floor(r / w)
        int li = (l + w - 1) / w, ri = r / w;
        if (li >= ri){
            return prod_naive(l, r);
        }
        auto [id, ma] = pre[li][ri];
        for (int i = l; i < li*w; i++){
            int p = pos[i] + ma;
            if (p >= (int)(ids[a[i]].size())) continue;
            if (ids[a[i]][p] < r){
                ma++;
                id = a[i];
                i--;
            }
        }
        for (int i = ri*w; i < r; i++){
            int p = pos[i] - ma;
            if (p < 0) continue;
            if (ids[a[i]][p] >= l){
                ma++;
                id = a[i];
                i--;
            }
        }
        return {id, ma};
    }
};

} // namespace noya2
#line 2 "data_structure/compress.hpp"

#line 5 "data_structure/compress.hpp"

namespace noya2{

template<typename T>
struct compress {
    std::vector<T> raws;
    compress () {}
    compress (const vector<T> &_raws) : raws(_raws){ build(); }
    void build(){
        std::sort(raws.begin(), raws.end());
        raws.erase(std::unique(raws.begin(), raws.end()), raws.end());
    }
    int id(const T &raw){ return lb(raw); }
    T raw(const int &id){ return raws[id]; }
    void add(const T &raw){ raws.emplace_back(raw); }
    void reserve(size_t sz){ raws.reserve(sz); }
    size_t size(){ return raws.size(); }
    int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }
    int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }
    bool contains(const T &raw){
        int jd = lb(raw);
        if (jd < (int)size()) return raws[jd] == raw;
        return false;
    }
    int contains_id(const T &raw){
        int jd = lb(raw);
        if (jd < (int)size() && raws[jd] == raw) return jd;
        return -1;
    }
};

} // namespace noya2
#line 6 "test/misc/StaticRangeModeQuery.test.cpp"

int main(){
    int n, q; in(n,q);
    vector<int> a(n); in(a);
    compress<int> cp(a);
    rep(i,n){
        a[i] = cp.id(a[i]);
    }
    static_range_mode_query srmq(a);
    while (q--){
        int l, r; in(l,r);
        auto [id, ma] = srmq.prod(l,r);
        id = cp.raw(id);
        out(id,ma);
    }
}
Back to top page