This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)
template <class X, class Y>
inline bool maximize(X &x, Y y) {
return (x < y ? x = y, true : false);
}
template <class X, class Y>
inline bool minimize(X &x, Y y) {
return (x > y ? x = y, true : false);
}
template <class X>
inline void compress(vector<X> &a) {
sort(all(a));
a.resize(unique(all(a)) - a.begin());
}
int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcount(ll x) { return __builtin_popcount(x); }
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
return l + abs((ll) rng()) % (r - l + 1);
}
const ll oo = (ll) 1e17;
const int inf = (ll) 1e9 + 7, mod = (ll) 1e9 + 7;
const int N = 1e6 + 5, M = 2e5 + 5, BASE = 307, LOG = 23;
void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }
int n, m;
int a[N];
struct node {
int Max, Min, res;
node() {
res = -inf;
};
node(int a, int b, int c) {
Max = a; Min = b; res = c;
}
};
struct Seg {
int n;
vector<node> st;
Seg(int n) : n(n) {
st.resize(n << 2);
build(1, 1, n);
}
node combine(node x, node y) {
if (x.res == -inf) return y;
if (y.res == -inf) return x;
node res;
res.res = max(x.res, y.res);
res.Max = max(x.Max, y.Max);
res.Min = min(x.Min, y.Min);
if (x.Max > y.Min)
maximize(res.res, x.Max + y.Min);
if (x.Min > y.Max)
maximize(res.res, x.Min + y.Max);
return res;
}
void build(int i, int l, int r) {
if (l == r) {
st[i] = {a[l], a[l], 0};
return;
}
int m = (l + r) >> 1;
build(2 * i, l, m);
build(2 * i + 1, m + 1, r);
st[i] = combine(st[2 * i], st[2 * i + 1]);
}
node get(int i, int l, int r, int u, int v) {
if (l > v || r < u) return node(-inf, inf, -inf);
if (l >= u && r <= v) return st[i];
int m = (l + r) >> 1;
return combine(get(2 * i, l, m, u, v), get(2 * i + 1, m + 1, r, u, v));
}
node get(int u, int v) { return get(1, 1, n, u, v); }
};
int main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m;
rep(i, n) cin >> a[i];
Seg s(n);
rep(_, m) {
int l, r, k;
cin >> l >> r >> k;
cout << (s.get(l, r).res <= k) << '\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |