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

verify/yosupo/static_range_frequency.test.cpp

• View this file on GitHub
• Last update: 2025-07-01 03:22:56+09:00
• Problem: https://judge.yosupo.jp/problem/static_range_frequency

Depends on

• Mo's Algorithm (data_structure/mo.hpp)
• template/template.hpp

Code

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

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

using namespace mmrz;

void mmrz::solve(){
	int n, q;
	cin >> n >> q;
	vector<int> a(n);
	for(auto &x : a)cin >> x;
	if(q == 0){
		return;
	}
	if(n == 0){
		while(q--){
			int l, r, x;
			cin >> l >> r >> x;
			cout << 0 << '\n';
		}
		return;
	}
	vector<pair<int, int>> lr(q);
	vector<int> x(q);
	rep(i, q){
		cin >> lr[i].first >> lr[i].second >> x[i];
	}

	{
		vector<int> v;
		for(auto &e : a)v.pb(e);
		for(auto &e : x)v.pb(e);
		sort(all(v));
		UNIQUE(v);
		map<int, int> cmp;
		rep(i, len(v))cmp[v[i]] = i;
		for(auto &e : a)e = cmp[e];
		for(auto &e : x)e = cmp[e];
	}

	Mo mo(lr);

	vector<int> cnt(n+q);

	auto add = [&](int idx) -> void {
		cnt[a[idx]]++;
	};

	auto erase = [&](int idx) -> void {
		cnt[a[idx]]--;
	};

	vector<int> ans(q);
	auto f = [&](int query_id) -> void {
		ans[query_id] = cnt[x[query_id]];
	};

	mo.calc(add, erase, f);

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

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

#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/mo.hpp"

#line 6 "data_structure/mo.hpp"
#include<ranges>
#line 9 "data_structure/mo.hpp"

class Mo {
	std::vector<std::pair<int, int>> lr;
public:
	Mo() = default;
	Mo(const std::vector<std::pair<int, int>> &_lr) : lr(_lr) {}

	template<typename AL, typename AR, typename EL, typename ER, typename F>
	void calc(const AL &add_left, const AR &add_right, const EL &erase_left, const ER& erase_right, const F &f, int _n = -1, int _B = -1){
		int n = (_n == -1 ? std::ranges::max(lr, {}, &std::pair<int, int>::second).second : _n);
		int q = (int)lr.size();
		int B = (_B == -1 ? std::max(1, n/int(sqrt(q))) : _B);

		std::vector<int> index(q);
		std::iota(index.begin(), index.end(), 0);
		std::sort(index.begin(), index.end(), [&](int i, int j){
			const auto &[l_i, r_i] = lr[i];
			const auto &[l_j, r_j] = lr[j];
			const int B_i = l_i / B, B_j = l_j / B;
			if(B_i != B_j){
				return B_i < B_j;
			}
			if(B_i & 1){
				return r_j < r_i;
			}else{
				return r_i < r_j;
			}
		});

		int l = 0, r = 0;
		for(int idx : index){
			const auto &[L, R] = lr[idx];

			while(L < l)add_left(--l);
			while(r < R)add_right(r++);
			
			while(l < L)erase_left(l++);
			while(R < r)erase_right(--r);

			f(idx);
		}
	}

	template<typename A, typename E, typename F>
	void calc(const A &add, const E &erase, const F &f){
		calc(add, add, erase, erase, f);
	}
};
#line 5 "verify/yosupo/static_range_frequency.test.cpp"

using namespace mmrz;

void mmrz::solve(){
	int n, q;
	cin >> n >> q;
	vector<int> a(n);
	for(auto &x : a)cin >> x;
	if(q == 0){
		return;
	}
	if(n == 0){
		while(q--){
			int l, r, x;
			cin >> l >> r >> x;
			cout << 0 << '\n';
		}
		return;
	}
	vector<pair<int, int>> lr(q);
	vector<int> x(q);
	rep(i, q){
		cin >> lr[i].first >> lr[i].second >> x[i];
	}

	{
		vector<int> v;
		for(auto &e : a)v.pb(e);
		for(auto &e : x)v.pb(e);
		sort(all(v));
		UNIQUE(v);
		map<int, int> cmp;
		rep(i, len(v))cmp[v[i]] = i;
		for(auto &e : a)e = cmp[e];
		for(auto &e : x)e = cmp[e];
	}

	Mo mo(lr);

	vector<int> cnt(n+q);

	auto add = [&](int idx) -> void {
		cnt[a[idx]]++;
	};

	auto erase = [&](int idx) -> void {
		cnt[a[idx]]--;
	};

	vector<int> ans(q);
	auto f = [&](int query_id) -> void {
		ans[query_id] = cnt[x[query_id]];
	};

	mo.calc(add, erase, f);

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

Back to top page