compro-library
This documentation is automatically generated by online-judge-tools/verification-helper
test/needless/IntegerRangeFrequencyQueryTree-range-freq.test.cpp
- View this file on GitHub
- Last update: 2023-06-15 04:20:46+09:00
- Problem: https://judge.yosupo.jp/problem/static_range_frequency
Depends on
FastIO
(lib/00-util/FastIO.cpp)
- IntegerRangeFrequencyQueryTree - integer専用区間freq
(lib/98-needless/IntegerRangeFrequencyQueryTree.cpp)
Code
#define PROBLEM "https://judge.yosupo.jp/problem/static_range_frequency"
#include <vector>
#include <iostream>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <stack>
using namespace std;
#include "../../lib/00-util/FastIO.cpp"
#include "../../lib/98-needless/IntegerRangeFrequencyQueryTree.cpp"
int main() {
cin.tie(0);ios::sync_with_stdio(false);
int N,Q; read(N); read(Q);
vector<unsigned long long> A(N);
for(int i=0;i<N;++i) read(A[i]);
IntegerRangeFrequencyQueryTree<30> rfqt(A);
while(Q--) {
int l,r,k; read(l); read(r); read(k);
cout << rfqt.range_freq(l,r,k) << "\n";
}
return 0;
}#line 1 "test/needless/IntegerRangeFrequencyQueryTree-range-freq.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/static_range_frequency"
#include <vector>
#include <iostream>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <stack>
using namespace std;
#line 1 "lib/00-util/FastIO.cpp"
/*
* @title FastIO
* @docs md/util/FastIO.md
*/
class FastIO{
private:
inline static constexpr int ch_0='0';
inline static constexpr int ch_9='9';
inline static constexpr int ch_n='-';
inline static constexpr int ch_s=' ';
inline static constexpr int ch_l='\n';
inline static void endline_skip(char& ch) {
while(ch==ch_l) ch=getchar();
}
template<typename T> inline static void read_integer(T &x) {
int neg=0; char ch; x=0;
ch=getchar();
endline_skip(ch);
if(ch==ch_n) neg=1,ch=getchar();
for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0);
if(neg) x*=-1;
}
template<typename T> inline static void read_unsigned_integer(T &x) {
char ch; x=0;
ch=getchar();
endline_skip(ch);
for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0);
}
inline static void read_string(string &x) {
char ch; x="";
ch=getchar();
endline_skip(ch);
for(;(ch != ch_s && ch!=ch_l); ch = getchar()) x.push_back(ch);
}
inline static char ar[40];
inline static char *ch_ar;
template<typename T> inline static void write_integer(T x) {
ch_ar=ar;
if(x< 0) putchar(ch_n), x=-x;
if(x==0) putchar(ch_0);
for(;x;x/=10) *ch_ar++=(ch_0+x%10);
while(ch_ar--!=ar) putchar(*ch_ar);
}
public:
inline static void read(int &x) {read_integer<int>(x);}
inline static void read(long long &x) {read_integer<long long>(x);}
inline static void read(unsigned int &x) {read_unsigned_integer<unsigned int>(x);}
inline static void read(unsigned long long &x) {read_unsigned_integer<unsigned long long>(x);}
inline static void read(string &x) {read_string(x);}
inline static void read(__int128_t &x) {read_integer<__int128_t>(x);}
inline static void write(__int128_t x) {write_integer<__int128_t>(x);}
inline static void write(char x) {putchar(x);}
};
#define read(arg) FastIO::read(arg)
#define write(arg) FastIO::write(arg)
#line 1 "lib/98-needless/IntegerRangeFrequencyQueryTree.cpp"
/*
* @title IntegerRangeFrequencyQueryTree - integer専用区間freq
* @docs md/needless/IntegerRangeFrequencyQueryTree.md
*/
template<unsigned int bit_length=20> class IntegerRangeFrequencyQueryTree {
using u64 = unsigned long long;
class SimpleBinaryTrie {
struct Node {
Node *left, *right;
u64 size;
Node(): size(0) {left=right=nullptr;}
};
Node* root;
size_t size(Node* node) const {return (node==nullptr ? 0 : node->size);}
bool empty(Node* node) const {return size(node) == 0;}
void print(Node* node,u64 i, u64 val) {
if(i == bit_length) {
cout << "{" << val << ":" << size(node) << ":" << size(node->left) << ":" << size(node->right) << "} ";
return;
}
if(node->left != nullptr) {
print(node->left, i+1, val);
}
if(node->right != nullptr) {
print(node->right, i+1, (val | (1UL<<(bit_length-1-i))) );
}
}
public:
SimpleBinaryTrie(): root(new Node()) {}
void insert(const u64 val) {
Node* curr = root; stack<Node*> st;
for(u64 i=0; i < bit_length; ++i) {
u64 j = ((val>>(bit_length-1-i)) & 1UL);
st.push(curr);
if(j) {
if(curr->right != nullptr) { curr = curr->right;}
else {
Node* next = new Node();
curr->right = next;
curr = next;
}
}
else {
if(curr->left != nullptr) curr = curr->left;
else {
Node* next = new Node();
curr->left = next;
curr = next;
}
}
}
curr->size += 1;
while(st.size()) {
auto node=st.top(); st.pop();
node->size = size(node->left) + size(node->right);
}
}
void erase(const u64 val) {
Node* curr = root; stack<Node*> st;
for(u64 i=0; i < bit_length; ++i) {
u64 j = ((val>>(bit_length-1-i)) & 1UL);
st.push(curr);
if(j) {
if(curr->right != nullptr) curr = curr->right;
else return;
}
else {
if(curr->left != nullptr) curr = curr->left;
else return;
}
}
if(empty(curr)) return;
curr->size -= 1;
while(st.size()) {
auto node=st.top(); st.pop();
node->size = size(node->left) + size(node->right);
}
}
size_t size() const {return size(root);}
bool empty() const {return empty(root);}
u64 kth_smallest(u64 k) const {
Node* curr = root; u64 val=0;
for(u64 i=0; i < bit_length; ++i) {
u64 j = 1UL << (bit_length-1-i);
u64 sz_l = size(curr->left);
if(k<sz_l) curr = curr->left;
else {
val |= j;
k -= sz_l;
curr = curr->right;
}
}
return val;
}
size_t lower_bound(const u64 val) const {
Node* curr = root;
u64 k=0;
for(u64 i=0; i < bit_length; ++i) {
u64 j = ((val>>(bit_length-1-i)) & 1UL);
if(j) {
k+=size(curr->left);
if(curr->right != nullptr) curr = curr->right;
else break;
}
else {
if(curr->left != nullptr) curr = curr->left;
else break;
}
}
return k;
}
size_t count(const u64 val) const {
Node* curr = root;
for(u64 i=0; i < bit_length; ++i) {
u64 j = ((val>>(bit_length-1-i)) & 1);
if(j) {
if(curr->right != nullptr) curr = curr->right;
else return 0;
}
else {
if(curr->left != nullptr) curr = curr->left;
else return 0;
}
}
return size(curr);
}
void print() {
cout << "{"; print(root,0,0); cout << "}" << endl;
}
};
size_t length;
size_t num;
vector<SimpleBinaryTrie> node;
void insert_impl(size_t idx, const u64 val) {
if(idx < 0 || length <= idx) return;
idx += length;
node[idx].insert(val);
while(idx >>= 1) node[idx].insert(val);
}
void erase_impl(size_t idx) {
if(idx < 0 || length <= idx) return;
idx += length;
if(node[idx].empty()) return;
u64 val = node[idx].kth_smallest(0);
node[idx].erase(val);
while(idx >>= 1) node[idx].erase(val);
}
int range_freq_upper_impl(int l, int r, const u64 upper) const {
if (l < 0 || length <= l || r < 0 || length < r) return 0;
int ret=0;
for(l += length, r += length; l < r; l >>=1, r >>=1) {
if(l&1) ret += node[l++].lower_bound(upper);
if(r&1) ret += node[--r].lower_bound(upper);
}
return ret;
}
int range_freq_impl(int l, int r, const u64 val) const {
if (l < 0 || length <= l || r < 0 || length < r) return 0;
int ret=0;
for(l += length, r += length; l < r; l >>=1, r >>=1) {
if(l&1) ret += node[l++].count(val);
if(r&1) ret += node[--r].count(val);
}
return ret;
}
public:
IntegerRangeFrequencyQueryTree(const u64 num) {
for (length = 1; length <= num; length *= 2);
node.resize(2 * length);
}
IntegerRangeFrequencyQueryTree(const vector<u64> & vec) {
for (length = 1; length <= vec.size(); length *= 2);
node.resize(2 * length);
for (int i=0; i < vec.size(); ++i) {
update(i, vec[i]);
}
}
//idx番目の要素をupdate
void update(const size_t idx, const u64 val) { erase_impl(idx); insert_impl(idx, val);}
//idx番目の要素をerase
void erase(const size_t idx) { erase_impl(idx); }
//[l,r) range freq of val (val < upper)
int range_freq_upper(const int l, const int r, const u64 upper) const {return range_freq_upper_impl(l,r,upper);}
//[l,r) range freq of val (lower <= val < upper)
int range_freq_lower_upper(const int l, const int r, const u64 lower, const u64 upper) const { return range_freq_upper_impl(l,r,upper) - range_freq_upper_impl(l,r,lower);}
//[l,r) range freq of val
int range_freq(const int l, const int r, const u64 val) const {return range_freq_impl(l,r,val);}
void print() { for(int i= length; i < 2*length; ++i) node[i].print();}
};
#line 13 "test/needless/IntegerRangeFrequencyQueryTree-range-freq.test.cpp"
int main() {
cin.tie(0);ios::sync_with_stdio(false);
int N,Q; read(N); read(Q);
vector<unsigned long long> A(N);
for(int i=0;i<N;++i) read(A[i]);
IntegerRangeFrequencyQueryTree<30> rfqt(A);
while(Q--) {
int l,r,k; read(l); read(r); read(k);
cout << rfqt.range_freq(l,r,k) << "\n";
}
return 0;
}