verify/yosupo/data-structure/staticrmq.test.cpp

View this file on GitHub
Last update: 2024-10-31 23:18:18+07:00
Problem: https://judge.yosupo.jp/problem/staticrmq

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"
#include "template.hpp"
#include "data-structure/sparse-table.hpp"
#include "group/monoid/min.hpp"

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,q;
    cin >> n >> q;
    vector<int> a(n);
    for(auto &x:a)cin >> x;
    SparseTable<MinMonoid<int>> s(a);
    while(q--){
        int l,r;
        cin >> l >> r;
        cout << s.query(l,r-1) << "\n";
    }
}

#line 1 "verify/yosupo/data-structure/staticrmq.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"
#line 1 "template.hpp"
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using db = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<db>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pdd = pair<db,db>;
const int INF=INT_MAX/2;
const int MOD=998244353;
const int MOD2=1000000007;
const ll LINF=LLONG_MAX/2;
const db DINF=numeric_limits<db>::infinity();
const db EPS=1e-9;
const db PI=acos(db(-1));

template<class T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T>
using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
#line 2 "data-structure/sparse-table.hpp"

/**
 * Author: Teetat T.
 * Date: 2024-06-12
 * Description: Sparse Table class.
 */

template<class Monoid>
struct SparseTable{
    using T = typename Monoid::value_type;
    int n;
    vector<vector<T>> t;
    SparseTable(){}
    SparseTable(const vector<T> &a){init(a);}
    void init(const vector<T> &a){
        n=(int)a.size();
        int lg=31-__builtin_clz(n);
        t.assign(lg+1,vector<T>(n,Monoid::unit()));
        t[0]=a;
        for(int i=0;i<lg;i++){
            for(int j=0;j+(2<<i)<=n;j++){
                t[i+1][j]=Monoid::op(t[i][j],t[i][j+(1<<i)]);
            }
        }
    }
    T query(int l,int r){
        int lg=31-__builtin_clz(r-l+1);
        return Monoid::op(t[lg][l],t[lg][r-(1<<lg)+1]);
    }
};

#line 2 "group/monoid/min.hpp"

/**
 * Author: Teetat T.
 * Date: 2024-04-14
 * Description: Min Monoid class.
 */

template<class T>
struct MinMonoid{
    using value_type = T;
    static constexpr T op(const T &x,const T &y){return min(x,y);}
    static constexpr T unit(){return numeric_limits<T>::max();}
};

#line 5 "verify/yosupo/data-structure/staticrmq.test.cpp"

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,q;
    cin >> n >> q;
    vector<int> a(n);
    for(auto &x:a)cin >> x;
    SparseTable<MinMonoid<int>> s(a);
    while(q--){
        int l,r;
        cin >> l >> r;
        cout << s.query(l,r-1) << "\n";
    }
}