mmrz's library

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

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

:heavy_check_mark: verify/yosupo/staticrmq.test.cpp

Depends on

Code

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

#include "./../../template/template.hpp"
#include "./../../data_structure/sparse_table.hpp"

using namespace mmrz;

void mmrz::solve(){
	int n, q;
	cin >> n >> q;
	vector<int> a(n);
	for(auto &x : a)cin >> x;
	sparse_table<int> table(a, [](int l, int r){return min(l, r);});
	while(q--){
		int l, r;
		cin >> l >> r;
		cout << table.fold(l, r) << '\n';
	}
}
#line 1 "verify/yosupo/staticrmq.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "data_structure/sparse_table.hpp"

#line 5 "data_structure/sparse_table.hpp"

template<typename T>
struct sparse_table {
	using F = std::function<T(T, T)>;

	F f;
	std::vector<std::vector<T>> table;
	std::vector<int> lr_length;

	sparse_table() = default;

	sparse_table(const std::vector<T> &v, const F &_f) : f(_f) {
		const int n = std::ssize(v);
		const int msb = 32 - __builtin_clz(n);
		
		table.assign(msb, std::vector<T>(n));
		for(int i = 0;i < std::ssize(v);i++){
			table[0][i] = v[i];
		}
		for(int i = 1;i < msb;i++){
			for(int j = 0;j + (1 << i) <= n;j++){
				table[i][j] = f(table[i-1][j], table[i-1][j + (1 << (i-1))]);
			}
		}

		lr_length.resize(std::ssize(v) + 1);
		for(int i = 2;i < std::ssize(lr_length);i++){
			lr_length[i] = lr_length[i >> 1] + 1;
		}
	}

	T fold(int l, int r) const {
		return f(table[lr_length[r-l]][l], table[lr_length[r-l]][r-(1 << lr_length[r-l])]);
	}
};
#line 5 "verify/yosupo/staticrmq.test.cpp"

using namespace mmrz;

void mmrz::solve(){
	int n, q;
	cin >> n >> q;
	vector<int> a(n);
	for(auto &x : a)cin >> x;
	sparse_table<int> table(a, [](int l, int r){return min(l, r);});
	while(q--){
		int l, r;
		cin >> l >> r;
		cout << table.fold(l, r) << '\n';
	}
}
Back to top page