This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2674
#include "../../template/template.hpp"
#include "../../structure/wavelet/wavelet-matrix.hpp"
int main() {
int N, Q;
cin >> N;
vector< int > X(N);
for(int i = 0; i < N; i++) {
cin >> X[i];
X[i] += 5e8;
}
CompressedWaveletMatrix< int, 30 > matrix(X);
cin >> Q;
while(Q--) {
int L, R, E;
cin >> L >> R >> E;
--L, --R;
cout << (R - L + 1) - matrix.range_freq(L, R + 1, min(X[L], X[R]) - E, max(X[L], X[R]) + E + 1) << "\n";
}
}
#line 1 "test/verify/aoj-2674.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2674
#line 1 "template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v) is >> in;
return is;
}
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = int64>
vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t) fill_v(e, v);
}
template <typename F>
struct FixPoint : F {
explicit FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args>
decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F>
inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/aoj-2674.test.cpp"
#line 1 "structure/wavelet/succinct-indexable-dictionary.hpp"
/**
* @brief Succinct Indexable Dictionary(完備辞書)
*/
struct SuccinctIndexableDictionary {
size_t length;
size_t blocks;
vector<unsigned> bit, sum;
SuccinctIndexableDictionary() = default;
SuccinctIndexableDictionary(size_t length)
: length(length), blocks((length + 31) >> 5) {
bit.assign(blocks, 0U);
sum.assign(blocks, 0U);
}
void set(int k) { bit[k >> 5] |= 1U << (k & 31); }
void build() {
sum[0] = 0U;
for (int i = 1; i < blocks; i++) {
sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);
}
}
bool operator[](int k) { return (bool((bit[k >> 5] >> (k & 31)) & 1)); }
int rank(int k) {
return (sum[k >> 5] +
__builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1)));
}
int rank(bool val, int k) { return (val ? rank(k) : k - rank(k)); }
};
#line 2 "structure/wavelet/wavelet-matrix.hpp"
/*
* @brief Wavelet Matrix(ウェーブレット行列)
*
*/
template <typename T, int MAXLOG>
struct WaveletMatrix {
size_t length;
SuccinctIndexableDictionary matrix[MAXLOG];
int mid[MAXLOG];
WaveletMatrix() = default;
WaveletMatrix(vector<T> v) : length(v.size()) {
vector<T> l(length), r(length);
for (int level = MAXLOG - 1; level >= 0; level--) {
matrix[level] = SuccinctIndexableDictionary(length + 1);
int left = 0, right = 0;
for (int i = 0; i < length; i++) {
if (((v[i] >> level) & 1)) {
matrix[level].set(i);
r[right++] = v[i];
} else {
l[left++] = v[i];
}
}
mid[level] = left;
matrix[level].build();
v.swap(l);
for (int i = 0; i < right; i++) {
v[left + i] = r[i];
}
}
}
pair<int, int> succ(bool f, int l, int r, int level) {
return {matrix[level].rank(f, l) + mid[level] * f,
matrix[level].rank(f, r) + mid[level] * f};
}
// v[k]
T access(int k) {
T ret = 0;
for (int level = MAXLOG - 1; level >= 0; level--) {
bool f = matrix[level][k];
if (f) ret |= T(1) << level;
k = matrix[level].rank(f, k) + mid[level] * f;
}
return ret;
}
T operator[](const int &k) { return access(k); }
// count i s.t. (0 <= i < r) && v[i] == x
int rank(const T &x, int r) {
int l = 0;
for (int level = MAXLOG - 1; level >= 0; level--) {
tie(l, r) = succ((x >> level) & 1, l, r, level);
}
return r - l;
}
// k-th(0-indexed) smallest number in v[l,r)
T kth_smallest(int l, int r, int k) {
assert(0 <= k && k < r - l);
T ret = 0;
for (int level = MAXLOG - 1; level >= 0; level--) {
int cnt = matrix[level].rank(false, r) - matrix[level].rank(false, l);
bool f = cnt <= k;
if (f) {
ret |= T(1) << level;
k -= cnt;
}
tie(l, r) = succ(f, l, r, level);
}
return ret;
}
// k-th(0-indexed) largest number in v[l,r)
T kth_largest(int l, int r, int k) {
return kth_smallest(l, r, r - l - k - 1);
}
// count i s.t. (l <= i < r) && (v[i] < upper)
int range_freq(int l, int r, T upper) {
int ret = 0;
for (int level = MAXLOG - 1; level >= 0; level--) {
bool f = ((upper >> level) & 1);
if (f) ret += matrix[level].rank(false, r) - matrix[level].rank(false, l);
tie(l, r) = succ(f, l, r, level);
}
return ret;
}
// count i s.t. (l <= i < r) && (lower <= v[i] < upper)
int range_freq(int l, int r, T lower, T upper) {
return range_freq(l, r, upper) - range_freq(l, r, lower);
}
// max v[i] s.t. (l <= i < r) && (v[i] < upper)
T prev_value(int l, int r, T upper) {
int cnt = range_freq(l, r, upper);
return cnt == 0 ? T(-1) : kth_smallest(l, r, cnt - 1);
}
// min v[i] s.t. (l <= i < r) && (lower <= v[i])
T next_value(int l, int r, T lower) {
int cnt = range_freq(l, r, lower);
return cnt == r - l ? T(-1) : kth_smallest(l, r, cnt);
}
};
template <typename T, int MAXLOG>
struct CompressedWaveletMatrix {
WaveletMatrix<int, MAXLOG> mat;
vector<T> ys;
CompressedWaveletMatrix(const vector<T> &v) : ys(v) {
sort(begin(ys), end(ys));
ys.erase(unique(begin(ys), end(ys)), end(ys));
vector<int> t(v.size());
for (int i = 0; i < v.size(); i++) t[i] = get(v[i]);
mat = WaveletMatrix<int, MAXLOG>(t);
}
inline int get(const T &x) {
return lower_bound(begin(ys), end(ys), x) - begin(ys);
}
T access(int k) { return ys[mat.access(k)]; }
T operator[](const int &k) { return access(k); }
int rank(const T &x, int r) {
auto pos = get(x);
if (pos == ys.size() || ys[pos] != x) return 0;
return mat.rank(pos, r);
}
T kth_smallest(int l, int r, int k) { return ys[mat.kth_smallest(l, r, k)]; }
T kth_largest(int l, int r, int k) { return ys[mat.kth_largest(l, r, k)]; }
int range_freq(int l, int r, T upper) {
return mat.range_freq(l, r, get(upper));
}
int range_freq(int l, int r, T lower, T upper) {
return mat.range_freq(l, r, get(lower), get(upper));
}
T prev_value(int l, int r, T upper) {
auto ret = mat.prev_value(l, r, get(upper));
return ret == -1 ? T(-1) : ys[ret];
}
T next_value(int l, int r, T lower) {
auto ret = mat.next_value(l, r, get(lower));
return ret == -1 ? T(-1) : ys[ret];
}
};
#line 6 "test/verify/aoj-2674.test.cpp"
int main() {
int N, Q;
cin >> N;
vector< int > X(N);
for(int i = 0; i < N; i++) {
cin >> X[i];
X[i] += 5e8;
}
CompressedWaveletMatrix< int, 30 > matrix(X);
cin >> Q;
while(Q--) {
int L, R, E;
cin >> L >> R >> E;
--L, --R;
cout << (R - L + 1) - matrix.range_freq(L, R + 1, min(X[L], X[R]) - E, max(X[L], X[R]) + E + 1) << "\n";
}
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 00_sample_00.in | AC | 7 ms | 4 MB |
g++ | 00_sample_01.in | AC | 7 ms | 4 MB |
g++ | 00_sample_02.in | AC | 7 ms | 4 MB |
g++ | 10_randomsmall_00.in | AC | 7 ms | 4 MB |
g++ | 10_randomsmall_01.in | AC | 8 ms | 4 MB |
g++ | 10_randomsmall_02.in | AC | 8 ms | 4 MB |
g++ | 10_randomsmall_03.in | AC | 7 ms | 4 MB |
g++ | 10_randomsmall_04.in | AC | 8 ms | 4 MB |
g++ | 10_randomsmall_05.in | AC | 8 ms | 4 MB |
g++ | 10_randomsmall_06.in | AC | 8 ms | 4 MB |
g++ | 10_randomsmall_07.in | AC | 7 ms | 4 MB |
g++ | 10_randomsmall_08.in | AC | 7 ms | 4 MB |
g++ | 10_randomsmall_09.in | AC | 8 ms | 4 MB |
g++ | 20_random_00.in | AC | 62 ms | 5 MB |
g++ | 20_random_01.in | AC | 68 ms | 5 MB |
g++ | 20_random_02.in | AC | 60 ms | 6 MB |
g++ | 20_random_03.in | AC | 121 ms | 6 MB |
g++ | 20_random_04.in | AC | 49 ms | 5 MB |
g++ | 20_random_05.in | AC | 126 ms | 6 MB |
g++ | 20_random_06.in | AC | 33 ms | 5 MB |
g++ | 20_random_07.in | AC | 117 ms | 5 MB |
g++ | 20_random_08.in | AC | 96 ms | 6 MB |
g++ | 20_random_09.in | AC | 23 ms | 4 MB |
g++ | 80_tirivial_00.in | AC | 8 ms | 4 MB |
g++ | 90_max_00.in | AC | 159 ms | 6 MB |
g++ | 90_max_01.in | AC | 158 ms | 6 MB |
g++ | 90_max_challenge_00.in | AC | 146 ms | 6 MB |
g++ | 90_max_challenge_01.in | AC | 145 ms | 6 MB |
g++ | 90_max_challenge_02.in | AC | 149 ms | 6 MB |
g++ | 90_max_challenge_03.in | AC | 149 ms | 6 MB |
g++ | 90_max_challenge_04.in | AC | 146 ms | 6 MB |
clang++ | 00_sample_00.in | AC | 7 ms | 4 MB |
clang++ | 00_sample_01.in | AC | 7 ms | 4 MB |
clang++ | 00_sample_02.in | AC | 7 ms | 4 MB |
clang++ | 10_randomsmall_00.in | AC | 8 ms | 4 MB |
clang++ | 10_randomsmall_01.in | AC | 8 ms | 4 MB |
clang++ | 10_randomsmall_02.in | AC | 7 ms | 4 MB |
clang++ | 10_randomsmall_03.in | AC | 7 ms | 4 MB |
clang++ | 10_randomsmall_04.in | AC | 8 ms | 4 MB |
clang++ | 10_randomsmall_05.in | AC | 7 ms | 4 MB |
clang++ | 10_randomsmall_06.in | AC | 8 ms | 4 MB |
clang++ | 10_randomsmall_07.in | AC | 7 ms | 4 MB |
clang++ | 10_randomsmall_08.in | AC | 7 ms | 4 MB |
clang++ | 10_randomsmall_09.in | AC | 7 ms | 4 MB |
clang++ | 20_random_00.in | AC | 59 ms | 5 MB |
clang++ | 20_random_01.in | AC | 65 ms | 5 MB |
clang++ | 20_random_02.in | AC | 57 ms | 6 MB |
clang++ | 20_random_03.in | AC | 121 ms | 6 MB |
clang++ | 20_random_04.in | AC | 47 ms | 5 MB |
clang++ | 20_random_05.in | AC | 128 ms | 6 MB |
clang++ | 20_random_06.in | AC | 32 ms | 5 MB |
clang++ | 20_random_07.in | AC | 117 ms | 5 MB |
clang++ | 20_random_08.in | AC | 96 ms | 6 MB |
clang++ | 20_random_09.in | AC | 22 ms | 4 MB |
clang++ | 80_tirivial_00.in | AC | 7 ms | 4 MB |
clang++ | 90_max_00.in | AC | 174 ms | 6 MB |
clang++ | 90_max_01.in | AC | 157 ms | 6 MB |
clang++ | 90_max_challenge_00.in | AC | 141 ms | 6 MB |
clang++ | 90_max_challenge_01.in | AC | 141 ms | 6 MB |
clang++ | 90_max_challenge_02.in | AC | 144 ms | 6 MB |
clang++ | 90_max_challenge_03.in | AC | 142 ms | 6 MB |
clang++ | 90_max_challenge_04.in | AC | 141 ms | 6 MB |